Data-driven discovery of Green's functions
Nicolas Boull\'e

TL;DR
This paper develops deep learning algorithms and theoretical insights to discover Green's functions of linear PDEs from data, connecting PDE learning with numerical linear algebra and rational neural networks.
Contribution
It introduces a rigorous algorithm for learning Green's functions, extends randomized SVD to Hilbert--Schmidt operators, and proposes rational neural networks for approximating singular functions.
Findings
Derived a learning rate for Green's functions of elliptic PDEs
Extended randomized SVD to non-standard Gaussian vectors and Hilbert--Schmidt operators
Designed rational neural networks with higher approximation power for singular functions
Abstract
Discovering hidden partial differential equations (PDEs) and operators from data is an important topic at the frontier between machine learning and numerical analysis. This doctoral thesis introduces theoretical results and deep learning algorithms to learn Green's functions associated with linear partial differential equations and rigorously justify PDE learning techniques. A theoretically rigorous algorithm is derived to obtain a learning rate, which characterizes the amount of training data needed to approximately learn Green's functions associated with elliptic PDEs. The construction connects the fields of PDE learning and numerical linear algebra by extending the randomized singular value decomposition to non-standard Gaussian vectors and Hilbert--Schmidt operators, and exploiting the low-rank hierarchical structure of Green's functions using hierarchical matrices. Rational neural…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks
