arXiv Machine Learning

Learning solution operators of PDEs with sparse approximation methods

arXiv:2606. 06046v1 Announce Type: cross Abstract: We investigate the approximation of solution operators for partial differential equations (PDEs) using sparse high-dimensional techniques.

arXiv Machine Learning
Jun 3

Correcting Neural Operator Spectral Bias via Diffusion Posterior Sampling with Sparse Observations

arXiv:2606. 03936v1 Announce Type: new Abstract: Neural operator surrogates (NO) approximate PDE solutions orders of magnitude faster than numerical solvers, but suffer from spectral bias: high-frequency content is systematically attenuated, limiting reliability where fine-scale structure matters.

By Niccol\`o Perrone, Fanny Lehmann, Stefania Fresca, Filippo Gatti
Hugging Face Trending Papers
Jun 2

Correcting Neural Operator Spectral Bias via Diffusion Posterior Sampling with Sparse Observations

Neural operator surrogates (NO) approximate PDE solutions orders of magnitude faster than numerical solvers, but suffer from spectral bias: high-frequency content is systematically attenuated, limiting reliability where fine-scale structure matters. Sparse sensor measurements of the field are often available too, offering pointwise accuracy without spectral distortion but covering only a small fraction of the domain.

arXiv Machine Learning
Jun 10

Learning Doubly Sparse Explicitly Conditioned Transforms

arXiv:2606. 10975v1 Announce Type: new Abstract: Finding convenient spaces in which certain hypotheses regarding an assumed sparse structure of natural signals hold true has become a desirable result in recent research, its implications being reflected in areas such as data compression, noise reduction and feature extraction.

By Tudor Pistol
Hugging Face Trending Papers
Aug 6

Alternating Levenberg-Marquardt Training of Physics-Informed Neural Networks with Fourier-Enhanced Features

Physics-informed neural networks (PINNs) often fail to accurately resolve partial differential equations (PDEs) with high-frequency or multi-scale solutions, as well as strongly nonlinear problems. Two factors underlie this difficulty: spectral bias, the tendency of neural networks to underfit high-frequency features; and representation-coefficient coupling, the entanglement of representation learning and coefficient fitting within a single nonconvex optimization objective.