Data-driven discovery of Green's functions
<p>Discovering hidden partial differential equations (PDEs) and operators from data is an important topic at the frontier between machine learning and numerical analysis. Theoretical results and deep learning algorithms are introduced to learn Green's functions associated with linear part...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2022
|
| Subjects: |
| _version_ | 1797108246816751616 |
|---|---|
| author | Boullé, N |
| author2 | Farrell, P |
| author_facet | Farrell, P Boullé, N |
| author_sort | Boullé, N |
| collection | OXFORD |
| description | <p>Discovering hidden partial differential equations (PDEs) and operators from data is an important topic at the frontier between machine learning and numerical analysis. Theoretical results and deep learning algorithms are introduced to learn Green's functions associated with linear partial differential equations and rigorously justify PDE learning techniques.</p>
<p>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.</p>
<p>Rational neural networks (NNs) are introduced and consist of neural networks with trainable rational activation functions. The highly compositional structure of these networks, combined with rational approximation theory, implies that rational functions have higher approximation power than standard activation functions. In addition, rational NNs may have poles and take arbitrarily large values, which is ideal for approximating functions with singularities such as Green's functions.</p>
<p>Finally, theoretical results on Green's functions and rational NNs are combined to design a human-understandable deep learning method for discovering Green's functions from data. This approach complements state-of-the-art PDE learning techniques, as a wide range of physics can be captured from the learned Green's functions such as dominant modes, symmetries, and singularity locations.</p> |
| first_indexed | 2024-03-07T07:26:29Z |
| format | Thesis |
| id | oxford-uuid:ec01bbea-17dd-4980-9a58-bfea848fa4dc |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T07:26:29Z |
| publishDate | 2022 |
| record_format | dspace |
| spelling | oxford-uuid:ec01bbea-17dd-4980-9a58-bfea848fa4dc2022-11-14T15:21:06ZData-driven discovery of Green's functionsThesishttp://purl.org/coar/resource_type/c_db06uuid:ec01bbea-17dd-4980-9a58-bfea848fa4dcDeep learning (Machine learning)Numerical analysisEnglishHyrax Deposit2022Boullé, NFarrell, PRognes, MTownsend, A<p>Discovering hidden partial differential equations (PDEs) and operators from data is an important topic at the frontier between machine learning and numerical analysis. Theoretical results and deep learning algorithms are introduced to learn Green's functions associated with linear partial differential equations and rigorously justify PDE learning techniques.</p> <p>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.</p> <p>Rational neural networks (NNs) are introduced and consist of neural networks with trainable rational activation functions. The highly compositional structure of these networks, combined with rational approximation theory, implies that rational functions have higher approximation power than standard activation functions. In addition, rational NNs may have poles and take arbitrarily large values, which is ideal for approximating functions with singularities such as Green's functions.</p> <p>Finally, theoretical results on Green's functions and rational NNs are combined to design a human-understandable deep learning method for discovering Green's functions from data. This approach complements state-of-the-art PDE learning techniques, as a wide range of physics can be captured from the learned Green's functions such as dominant modes, symmetries, and singularity locations.</p> |
| spellingShingle | Deep learning (Machine learning) Numerical analysis Boullé, N Data-driven discovery of Green's functions |
| title | Data-driven discovery of Green's functions |
| title_full | Data-driven discovery of Green's functions |
| title_fullStr | Data-driven discovery of Green's functions |
| title_full_unstemmed | Data-driven discovery of Green's functions |
| title_short | Data-driven discovery of Green's functions |
| title_sort | data driven discovery of green s functions |
| topic | Deep learning (Machine learning) Numerical analysis |
| work_keys_str_mv | AT boullen datadrivendiscoveryofgreensfunctions |