Elliptic PDE learning is provably data-efficient

Nicolas Boullé, Diana Halikias, Alex Townsend
2/24/2023
cs.LGcs.AImath.NA

No official code found. Best implementation: NBoulle/pde-learning (7 stars, MIT, last commit 2024-11-20).

Abstract

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 3D 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.

View on arXivView PDF

Code Implementations(1)

MIT
70MATLAB, PythonFeb 22, 20231 years agoMIT

Similar Papers

Cite this paper

@article{boull2023elliptic,
  title  = {Elliptic PDE learning is provably data-efficient},
  author = {Nicolas Boullé and Diana Halikias and Alex Townsend},
  year   = {2023},
  eprint = {2302.12888},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.12888v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.12888.svg)](https://codeofpaper.com/paper/2302.12888)

Discussion