Elliptic PDE learning is provably data-efficient
File(s)Elliptic PDE learning is provably data-efficient.pdf (5.53 MB)
Published version
Author(s)
Boullé, Nicolas
Halikias, Diana
Townsend, Alex
Type
Journal Article
Abstract
Partial differential equations (PDE) learning is an emerging field that combines physics and machine learning to recover unknown physical systems from experimental data. While deep learning models traditionally require copious amounts of training data, recent PDE learning techniques achieve spectacular results with limited data availability. Still, these results are empirical. Our work provides theoretical guarantees on the number of input-output training pairs required in PDE learning. Specifically, we exploit randomized numerical linear algebra and PDE theory to derive a provably data-efficient algorithm that recovers solution operators of three-dimensional uniformly elliptic PDEs from input-output data and achieves an exponential convergence rate of the error with respect to the size of the training dataset with an exceptionally high probability of success.
Date Issued
2023-09-26
Date Acceptance
2023-07-21
Citation
Proceedings of the National Academy of Sciences of USA, 2023, 120 (39)
ISSN
0027-8424
Publisher
National Academy of Sciences
Journal / Book Title
Proceedings of the National Academy of Sciences of USA
Volume
120
Issue
39
Copyright Statement
Copyright © 2023 the Author(s). Published by PNAS. This open access article is distributed under Creative Commons Attribution-NonCommercial-NoDerivatives License 4.0 (CC BY-NC-ND).
Identifier
https://www.ncbi.nlm.nih.gov/pubmed/37722063
Subjects
deep learning
inverse problems
neural operators
sample complexity
Publication Status
Published
Coverage Spatial
United States
Article Number
ARTN e2303904120