Quasi-Random Physics-informed Neural Networks
arXiv:2507.08121 · doi:10.1016/j.neucom.2026.132913
Abstract
Physics-informed neural networks have shown promise in solving partial differential equations (PDEs) by integrating physical constraints into neural network training, but their performance is sensitive to the sampling of points. Based on the impressive performance of quasi Monte-Carlo methods in high dimensional problems, this paper proposes Quasi-Random Physics-Informed Neural Networks (QRPINNs), which use low-discrepancy sequences for sampling instead of random points directly from the domain. Theoretically, QRPINNs have been proven to have a better convergence rate than PINNs. Empirically, experiments demonstrate that QRPINNs significantly outperform PINNs and some representative adaptive sampling methods, especially in high-dimensional PDEs. Furthermore, combining QRPINNs with adaptive sampling can further improve the performance.
References in corpus (11)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Deep Potential Molecular Dynamics: a scalable model with the accuracy of quantum mechanics
- NSFnets (Navier-Stokes Flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations
- Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backward stochastic differential equations
- A comprehensive study of non-adaptive and residual-based adaptive sampling for physics-informed neural networks
- Efficient training of physics-informed neural networks via importance sampling
- Machine learning approximation algorithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations
- Tackling the Curse of Dimensionality with Physics-Informed Neural Networks
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
- Error in Monte Carlo, quasi-error in Quasi-Monte Carlo
- Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces