arXiv AI

Spectral-Informed Neural Networks Outperform Spectral Methods in High-dimensional PDEs

arXiv:2607. 13566v1 Announce Type: cross Abstract: For low-dimensional problems ($d\leq3$), spectral methods can achieve exceptionally high accuracy.

arXiv Machine Learning
Aug 27

When Does Frequency Decomposition Benefit Physics-Informed Neural Networks? A Preliminary Ablation Study

The paper investigates when frequency decomposition aids Physics-Informed Neural Networks (PINNs) by introducing a dual‑branch, spectrally‑gated architecture (DBSG‑PINN) that separates low‑ and high‑frequency components. Experiments on five one‑dimensional PDE benchmarks show that frequency decomposition significantly reduces error—up to 59.2% on a multimodal wave problem—when the target solution is spectrally complex, but offers little improvement on smoother problems and can even worsen performance on a simple 1D wave benchmark. The adaptive gate’s effectiveness scales with the spectral richness of the solution, suggesting it exploits frequency structure rather than adding noise.

By Shubham Rai
arXiv AI
Jun 3

Physics-informed diffusion models in spectral space

arXiv:2602. 09708v2 Announce Type: replace-cross Abstract: We propose physics-informed spectral diffusion (PISD), a methodology that combines generative latent diffusion models with physics-informed machine learning to generate solutions of partial differential equations (PDEs) conditioned on partial observations, which includes, in particular, forward and inverse PDE problems.

By Davide Gallon, Philippe von Wurstemberger, Patrick Cheridito, Arnulf Jentzen
arXiv Machine Learning
Sep 3

Learning Spectral-Like Mesh-Free Discretisations

The paper introduces Spectral-like Neural Discretisation (SpeND), a mesh‑free method that learns stencil weights via a neural network to approximate the modal response of a spectral operator across a specified band of wavenumbers. By projecting the network output onto the space of polynomial‑consistent weights, SpeND ensures exact consistency while minimizing dispersion and dissipation errors in a self‑supervised, physics‑agnostic manner. Experiments on disordered 2‑D node sets demonstrate that the learned fourth‑order operator matches the exact spectral response over a wider band than traditional LABFM or structured‑grid finite differences, and retains fourth‑order convergence upon refinement.

By Lucas Gerken Starepravo, Henry Broadley, Steven Lind, Jack R. C. King
Hugging Face Trending Papers
Jul 7

Physics-Informed Neural Embeddings of PDE Solution Families

We introduce a physics-informed framework for learning finite-dimensional embeddings of solution families of partial differential equations. The method uses a multihead Physics-Informed Neural Network in which a shared body learns a latent manifold representing the solution space, while linear heads reconstruct individual solutions associated with different initial conditions.

arXiv Machine Learning
5d ago

NEXT: Physics-Informed Neuro-Spectral Exponential Time Differencing Architectures

The paper introduces NEXT, a new physics-informed neural architecture that combines Neuro‑Spectral Architectures with high‑order exponential time‑differencing integrators. NEXT integrates the stiff linear part of PDEs exactly via matrix exponentials while a neural network models the remaining nonlinear dynamics, thereby overcoming spectral bias, causality issues, and numerical instability seen in previous PINNs and NeuSAs. Benchmark tests on stiff PDEs show NEXT remains stable and accurate, and it can also solve inverse problems by learning unknown parameters or boundary conditions from sparse data.

By M\'arcio Marques, Leonardo Mendon\c{c}a, Leonardo M. Moreira, Christian J\'unior de Oliveira, Vitor Balestro, Tiago Novello, Daniel Yukimura, Pavel Petrov, Lucas Nissenbaum
arXiv Machine Learning
Jun 17

A Convex Quasilinearization Method for Solving Nonlinear PDEs with Physics-Informed Neural Networks

arXiv:2606. 18175v1 Announce Type: cross Abstract: We present a numerical method for the forward solution of nonlinear partial differential equations (PDEs) in which Bellman-Kalaba quasilinearization reduces the nonlinear problem to a sequence of linear subproblems, each discretized by collocation onto a trial space that is linear in its parameters and solved by a single direct linear least-squares QR factorization.

By Gbenga T. Awojinrin, Abdul-Akeem Olawoyin, Rami M. Younis