The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A Theoretical Analysis of Deep Neural Networks and Parametric PDEs
Open accessAbstract
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 neural network approximation results. Concretely, we use the existence of a small reduced basis to construct, for a large variety of parametric partial differential equations, neural networks that yield approximations of the parametric solution maps in such a way that the sizes of these networks essentially only depend on the size of the reduced basis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Why and when can deep-but not shallow-networks avoid the curse of dimensionality: A review
Poggio, T., Mhaskar, H., Rosasco, L., Miranda, B., & Liao, Q. (2017) · International Journal of Automation and Computing · doi:10.1007/s11633-017-1054-2 · Cited by 559
Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
Lubich, C., Rohwedder, T., Schneider, R., & Vandereycken, B. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120885723 · Cited by 163
Self-citation
Cited by
Model Reduction And Neural Networks For Parametric PDEs
Bhattacharya, K., Hosseini, B., Kovachki, N. B., & Stuart, A. M. (2021) · The SMAI Journal of computational mathematics · doi:10.5802/smai-jcm.74 · Cited by 329
Fresca, S., Dede’, L., & Manzoni, A. (2021) · Journal of Scientific Computing · doi:10.1007/s10915-021-01462-7 · Cited by 309
Numerical Solution of the Parametric Diffusion Equation by Deep Neural Networks
Geist, M., Petersen, P., Raslan, M., Schneider, R., & Kutyniok, G. (2021) · Journal of Scientific Computing · doi:10.1007/s10915-021-01532-w · Cited by 57
Self-citation
Metadata
- Authors
- Kutyniok, G., Petersen, P., Raslan, M., & Schneider, R.
- Venue
- Constructive Approximation
- Published
- 2021-06-02
- Volume
- 55
- Issue
- 1
- Pages
- 73-125
- ISSN
- 0176-4276 (ISSN-L)
- 1432-0940
- OpenAlex
- W2933916181
- Cited by
- 163
- References
- 8
- FWCI
- 11.89
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Theoretical Analysis of Deep Neural Networks and Parametric PDEs. https://app.cochat.ai/papers/10.1007/s00365-021-09551-4
- The paper
- Kutyniok, G., Petersen, P., Raslan, M., & Schneider, R. (2022). A Theoretical Analysis of Deep Neural Networks and Parametric PDEs. Constructive Approximation. https://doi.org/10.1007/s00365-021-09551-4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.