Name
Abstract | ||
|---|---|---|
We derive upper bounds on the complexity of ReLU neural networks approximating the solution maps of parametric partial differential equations. In particular, without any knowledge of its concrete shape, we use the inherent low-dimensionality of the solution manifold to obtain approximation rates which are significantly superior to those provided by classical approximation results. We use this low dimensionality to guarantee the existence of a reduced basis. Then, for a large variety of parametric partial differential equations, we construct neural networks that yield approximations of the parametric maps not suffering from a curse of dimension and essentially only depending on the size of the reduced basis. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Numerical Analysis | Journal |
Volume | Citations | PageRank |
abs/1904.00377 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gitta Kutyniok | 1 | 325 | 34.77 |
| Philipp Petersen | 2 | 0 | 0.68 |
| Mones Raslan | 3 | 0 | 0.34 |
| Reinhold Schneider | 4 | 91 | 7.63 |