DAS-PINNs for high-dimensional partial differential equations: extending deep adaptive sampling to spacetime domains

• URL: http://arxiv.org/abs/2606.06314v1
• Date: Thu, 04 Jun 2026 15:54:25 GMT
• Title: DAS-PINNs for high-dimensional partial differential equations: extending deep adaptive sampling to spacetime domains
• Abstract summary: Time-dependent partial differential equations (PDEs) with localised and dynamically evolving solutions pose a fundamental challenge for physics-informed neural networks (PINNs)<n>In this work, a deep adaptive framework for PINNs is extended to treating space and time as a unified domain without any explicit time marching.<n>A normalising flow neural network model effectively learns the distribution induced by the PDE residual and generates new collocation points concentrated in regions where the solution is most difficult to learn.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Time-dependent high-dimensional partial differential equations (PDEs) with spatially localised and dynamically evolving solutions pose a fundamental challenge for physics-informed neural networks (PINNs), as uniform collocation sampling becomes increasingly ineffective in high-dimensional spatiotemporal domains. In this work, a deep adaptive sampling framework for PINNs is extended to the time-dependent setting by treating space and time as a unified domain without any explicit time marching. A normalising flow neural network model effectively learns the distribution induced by the PDE residual and generates new collocation points concentrated in regions where the solution is most difficult to learn. Unlike conventional adaptive strategies that require explicit time stepping or moving meshes, high-residual regions are automatically identified and tracked across both space and time, driven purely by the PDE residual distribution. The effectiveness of the proposed strategy is assessed on a range of benchmark problems, from sharp and moving features in two spatial dimensions to localised structures in up to eight spatial dimensions.

Related papers

• Dynamics and Representation Structure of Local Approximations to Gradient-Based Learning in Linear Recurrent Neural Networks [56.42974363744522]
  We study the learning dynamics of random feedback local online (RFLO) and truncated backpropagation through time (tBPTT)<n>Our work provides analytical insight into how locality constraints shape learning dynamics, with implications for neuroscientific models of learning and alternative optimization approaches for RNNs.
  arXiv  Detail & Related papers  (2026-05-29T18:19:45Z)
• Physics-Informed Neural PDE Solvers via Spatio-Temporal MeanFlow [28.327009081337746]
  We introduce S-Temporal MeanFlow, which functions as a novel PDE solver learning the finite-interval evolution of physical states.<n>We extend the original MeanFlow constraint from the temporal to thetemporal domain, coupling time evolution with spatial consistency.<n>This yields a unified framework naturally accommodating both time-dependent and stationary PDEs.
  arXiv  Detail & Related papers  (2026-05-09T12:29:10Z)
• Adaptive Mesh-Quantization for Neural PDE Solvers [51.26961483962011]
  Graph Neural Networks can handle the irregular meshes required for complex geometries and boundary conditions, but still apply uniform computational effort across all nodes.<n>We propose Adaptive Mesh Quantization: spatially adaptive quantization across mesh node, edge, and cluster features, dynamically adjusting the bit-width used by a quantized model.<n>We demonstrate our framework's effectiveness by integrating it with two state-of-the-art models, MP-PDE and GraphViT, to evaluate performance across multiple tasks.
  arXiv  Detail & Related papers  (2025-11-23T14:47:24Z)
• Simulating Distribution Dynamics: Liquid Temporal Feature Evolution for Single-Domain Generalized Object Detection [58.25418970608328]
  Single-Domain Generalized Object Detection (Single-DGOD) aims to transfer a detector trained on one source domain to multiple unknown domains.<n>Existing methods for Single-DGOD typically rely on discrete data augmentation or static perturbation methods to expand data diversity.<n>We propose a new method, which simulates the progressive evolution of features from the source domain to simulated latent distributions.
  arXiv  Detail & Related papers  (2025-11-13T03:10:39Z)
• Quantum-inspired space-time PDE solver and dynamic mode decomposition [0.0]
  We develop an MPS-DMD algorithm to make accurate long-term predictions of nonlinear systems.<n>This research highlights the role of tensor networks in developing effective and interpretable models.
  arXiv  Detail & Related papers  (2025-10-15T14:39:44Z)
• Deformable Dynamic Convolution for Accurate yet Efficient Spatio-Temporal Traffic Prediction [1.7268829007643391]
  Deformable Dynamic Convolutional Network (DDCN) is a novel CNN-based architecture that integrates both deformable and receptive dynamic operations.<n> DDCN achieves competitive predictive performance while significantly reducing computational costs, underscoring its potential for large-scale and real-time deployment.
  arXiv  Detail & Related papers  (2025-07-13T06:49:35Z)
• Spline Deformation Field [21.755382164519776]
  inductive biases can hinder canonical spatial coherence in ill-posed scenarios.<n>We introduce a novel low-rank spatial encoding, replacing conventional coupled techniques.<n>It achieves competitive dynamic reconstruction quality compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-07-10T08:11:46Z)
• Multiresolution Analysis and Statistical Thresholding on Dynamic Networks [49.09073800467438]
  ANIE (Adaptive Network Intensity Estimation) is a multi-resolution framework designed to automatically identify the time scales at which network structure evolves.<n>We show that ANIE adapts to the appropriate time resolution and is able to capture sharp structural changes while remaining robust to noise.
  arXiv  Detail & Related papers  (2025-06-01T22:55:55Z)
• Convergence of mean-field Langevin dynamics: Time and space discretization, stochastic gradient, and variance reduction [49.66486092259376]
  The mean-field Langevin dynamics (MFLD) is a nonlinear generalization of the Langevin dynamics that incorporates a distribution-dependent drift. Recent works have shown that MFLD globally minimizes an entropy-regularized convex functional in the space of measures. We provide a framework to prove a uniform-in-time propagation of chaos for MFLD that takes into account the errors due to finite-particle approximation, time-discretization, and gradient approximation.
  arXiv  Detail & Related papers  (2023-06-12T16:28:11Z)
• Implicit Neural Spatial Representations for Time-dependent PDEs [29.404161110513616]
  Implicit Neural Spatial Representation (INSR) has emerged as an effective representation of spatially-dependent vector fields. This work explores solving time-dependent PDEs with INSR.
  arXiv  Detail & Related papers  (2022-09-30T22:46:40Z)
• Learning to Accelerate Partial Differential Equations via Latent Global Evolution [64.72624347511498]
  Latent Evolution of PDEs (LE-PDE) is a simple, fast and scalable method to accelerate the simulation and inverse optimization of PDEs. We introduce new learning objectives to effectively learn such latent dynamics to ensure long-term stability. We demonstrate up to 128x reduction in the dimensions to update, and up to 15x improvement in speed, while achieving competitive accuracy.
  arXiv  Detail & Related papers  (2022-06-15T17:31:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.