Elliptic PDE learning is provably data-efficient

DOI10.1073/PNAS.2303904120MaRDI QIDQ7017404zbMATH OpenFDO

Authors Nicolas Boullé, Diana Halikias, Alex Townsend

Publication date 6 March 2025

Published in Proceedings of the National Academy of Sciences of the United States of America (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1073/PNAS.2303904120

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Inverse problems for PDEs (35R30) Artificial neural networks and deep learning (68T07)

Cited in

(5)

• Randomized Nyström approximation of non-negative self-adjoint operators
• Deep learning for PDE-based inverse problems. Abstracts from the workshop held October 27 -- November 1, 2024
• An operator learning perspective on parameter-to-observable maps
• Fixed-sparsity matrix approximation from matrix-vector products
• Quasi-optimal hierarchically semi-separable matrix approximation

This page was built for publication: Elliptic PDE learning is provably data-efficient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7017404)