The paper introduces SFRBE–RaNN, a two‑stage adaptive randomized neural network framework for solving partial differential equations. It first redistributes a fixed feature budget based on regional indicator masses and optimizes regional weight scales using low‑dimensional residuals, then enriches the trial space by selecting nonredundant activation families through residual verification. The authors provide theoretical guarantees for linear problems, including a discrete residual‑reduction identity, error bounds, and a probabilistic success bound, and validate the approach with numerical experiments on localized, multiscale, and nonlinear space–time PDEs.
arXiv:2609. 16406v1 Announce Type: cross Abstract: Machine learning-based partial differential equations (PDEs) solvers have attracted significant attention in recent years.
arXiv:2606. 06314v1 Announce Type: cross 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.
arXiv:2607. 19786v1 Announce Type: cross Abstract: Random-feature methods reduce high-dimensional elliptic PDE collocation to linear coefficient problems, but full-dimensional trial spaces overlook lower-dimensional structure.
The paper demonstrates that a neural solver trained on a single condition can generate a reusable response space via its output Jacobian, enabling efficient cross‑condition solution transfer. By introducing Linearized Subspace Transfer (LST) and Active Transfer Modeling (ATM), the authors recover target solutions through residual minimization and selectively acquire additional response spaces based on coverage indicators. Experiments on six PDE systems show that this approach reduces error and offline construction cost compared to physics‑informed baselines, achieving significant accuracy gains and rapid target adaptation.
arXiv:2604. 09361v3 Announce Type: replace Abstract: This paper introduces the Stochastic-Dimension Frozen Sampled Neural Network (SD-FSNN), a novel computational framework for solving high-dimensional Gross-Pitaevskii equation (GPE) on unbounded domain.
arXiv:2603. 29237v2 Announce Type: replace Abstract: Enforcing prescribed global integral constraints in mesh-free neural PDE solvers is challenging in high-dimensional domains.
arXiv:2601. 20496v2 Announce Type: replace-cross Abstract: Generating dense physical fields from sparse measurements is a fundamental question in sampling, signal processing, and many other applications.
arXiv:2606. 27354v1 Announce Type: cross Abstract: Neural surrogate models offer fast approximate mappings from PDE parameters to solutions, but they typically treat solving as a purely statistical task: once trained, they struggle to correct their own constraint violations and extrapolate beyond the training distribution.
Gen-PINNs introduces a deterministic residual-adversarial framework that combines Generative Adversarial Networks with Physics-Informed Neural Networks to solve partial differential equations. The method addresses limitations of standard PINNs—such as spectral bias, loss imbalance, and optimizer stagnation—by using a generator that learns the PDE solution with dynamically weighted physics-informed losses and discriminators that assess residuals against zero-residual states. Experiments on nonlinear and higher-order PDEs (Burgers, Allen‑Cahn, Kuramoto‑Sivashinsky) show significant gains in accuracy and convergence, especially for sharp-front, stiff, and high-order problems.
arXiv:2606. 17460v1 Announce Type: new Abstract: Neural operators are widely used as surrogate solution maps for partial differential equations (PDEs), but full-size models can be costly to store, deploy, and evaluate in many-query scientific workflows.
The paper introduces beignet, a neural field architecture that replaces the random Fourier feature embedding in physics-informed neural networks with a trainable multi‑resolution Fourier feature pyramid. By using Fourier interpolation and spectral derivatives, beignet efficiently computes spatial derivatives and scales accuracy through the feature pyramid rather than the neural network size. Experiments show that beignet achieves more accurate PDE solutions with fewer parameters than existing PINN methods and can reach machine‑precision residuals on the inviscid Burgers blowup problem using the Adam optimizer.
arXiv:2605. 31027v2 Announce Type: replace Abstract: We propose a novel neural network architecture, termed Multi-Scale Separable Fourier Neural Networks (MS-SFNN), for the accurate and efficient solution of linear and nonlinear high-frequency partial differential equations (PDEs).