The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Error estimates for DeepONets: a deep learning framework in infinite dimensions
Open accessAbstract
DeepONets have recently been proposed as a framework for learning nonlinear operators mapping between infinite-dimensional Banach spaces. We analyze DeepONets and prove estimates on the resulting approximation and generalization errors. In particular, we extend the universal approximation property of DeepONets to include measurable mappings in non-compact spaces. By a decomposition of the error into encoding, approximation and reconstruction errors, we prove both lower and upper bounds on the total error, relating it to the spectral decay properties of the covariance operators, associated with the underlying measures. We derive almost optimal error bounds with very general affine reconstructors and with random sensor locations as well as bounds on the generalization error, using covering number arguments. We illustrate our general framework with four prototypical examples of nonlinear operators, namely those arising in a nonlinear forced ordinary differential equation, an elliptic partial differential equation (PDE) with variable coefficients and nonlinear parabolic and hyperbolic PDEs. While the approximation of arbitrary Lipschitz operators by DeepONets to accuracy $\epsilon $ is argued to suffer from a ‘curse of dimensionality’ (requiring a neural networks of exponential size in $1/\epsilon $), in contrast, for all the above concrete examples of interest, we rigorously prove that DeepONets can break this curse of dimensionality (achieving accuracy $\epsilon $ with neural networks of size that can grow algebraically in $1/\epsilon $).Thus, we demonstrate the efficient approximation of a potentially large class of operators with this machine learning framework.
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
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
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
Raissi, M., Perdikaris, P., & Karniadakis, G. E. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.10.045 · Cited by 20,384
Self-citationChen, T., & Chen, H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.392253 · Cited by 1,230
Zhu, Y., & Zabaras, N. (2018) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.04.018 · Cited by 704
Cited by
Physics-informed machine learning
Karniadakis, G. E., Kevrekidis, I. G., Lu, L., Perdikaris, P., Wang, S., & Yang, L. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00314-5 · Cited by 8,718
Self-citationLu, L., Meng, X., Cai, S., Mao, Z., Goswami, S., Zhang, Z., & Karniadakis, G. E. (2022) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2022.114778 · Cited by 514
Self-citationNeural operators for accelerating scientific simulations and design
Azizzadenesheli, K., Kovachki, N., Li, Z., Liu-Schiaffini, M., Kossaifi, J., & Anandkumar, A. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00712-5 · Cited by 314
Neural Operators for Bypassing Gain and Control Computations in PDE Backstepping
Bhan, L., Shi, Y., & Krstic, M. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3347499 · Cited by 58
Nonlocality and Nonlinearity Implies Universality in Operator Learning
Lanthaler, S., Li, Z., & Stuart, A. M. (2023) · arXiv · doi:10.48550/arxiv.2304.13221 · Cited by 25
Self-citation
Metadata
- Authors
- Lanthaler, S., Mishra, S., & Karniadakis, G. E.
- Venue
- Transactions of Mathematics and Its Applications
- Publisher
- Oxford University Press (OUP)
- Published
- 2022-01
- Volume
- 6
- Issue
- 1
- ISSN
- 2398-4945 (ISSN-L)
- OpenAlex
- W3133338006
- Cited by
- 173
- References
- 5
- FWCI
- 12.66
- Type
- journal article
- Language
- en
- Open access
- gold
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
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.