We study the complexity of approximating high-dimensional second-order elliptic PDEs with homogeneous boundary conditions on the unit hypercube using Barron spaces. Under suitable Barron assumptions on the coefficients and forcing term, we prove that the solutions can be approximated to any prescribed accuracy \varepsilon>0 by two-layer neural networks whose widths and relevant parameters are bounded by O\bigl(d^{C|\log\varepsilon|}\bigr). Consequently, we identify a class of elliptic PDEs that can be approximated by shallow neural networks without suffering from the curse of dimensionality.
Barron Space Representations for Elliptic PDEs with Homogeneous Boundary Conditions
We study the complexity of approximating high-dimensional second-order elliptic PDEs with homogeneous boundary conditions on the unit hypercube using Barron spaces. Under suitable Barron assumptions on the coefficients and forcing term, we prove that the solutions can be…
- Preview

- Year
- 2025
- Hosting
- Abstract onlyARXIV-DEFAULT
Cite
Notes
Only stored in your browser.
Attribution
- Abstract & full text
- arxiv.org/abs/2508.07559ARXIV-DEFAULT
- TL;DR
- Semantic Scholar