Loading [MathJax]/jax/output/HTML-CSS/jax.js

Research reports

Expression Rates of Neural Operators for Linear Elliptic PDEs in Polytopes

by C. Marcati and Ch. Schwab

(Report number 2024-23)

Abstract
We study the approximation rates of a class of deep neural network approximations of operators, which arise as data-to-solution maps G of linear elliptic partial differential equations (PDEs), and act between pairs X,Y of suitable infinite-dimensional spaces. We prove expression rate bounds for approximate neural operators G with the structure G=RAE, with linear encoders E and decoders R. The constructive proofs are via a recurrent NN structure obtained by unrolling exponentially convergent, self-consistent iterations. We bound the operator approximation error with respect to the linear Kolmogorov N-widths of the data and solution sets and in terms of the size of the approximation network. We derive expression rates for full neural operators for elliptic PDEs set in d-dimensional polytopes, with d{2,3}, and with Dirichlet-, Neumann- or mixed boundary conditions. Exploiting the regularity of the solutions sets of elliptic PDEs in polytopes, we show algebraic rates of expression for problems with data with finite regularity, and exponential operator expression rates for analytic data.

Keywords: Neural Operators, Approximation Theory, Deep Neural Networks, Elliptic PDEs, Kolmogorov $N$-widths

BibTeX
@Techreport{MS24_1105,
  author = {C. Marcati and Ch. Schwab},
  title = {Expression Rates of Neural Operators
for Linear Elliptic PDEs in Polytopes},
  institution = {Seminar for Applied Mathematics, ETH Z{\"u}rich},
  number = {2024-23},
  address = {Switzerland},
  url = {https://www.sam.math.ethz.ch/sam_reports/reports_final/reports2024/2024-23.pdf },
  year = {2024}
}

Disclaimer
© Copyright for documents on this server remains with the authors. Copies of these documents made by electronic or mechanical means including information storage and retrieval systems, may only be employed for personal use. The administrators respectfully request that authors inform them when any paper is published to avoid copyright infringement. Note that unauthorised copying of copyright material is illegal and may lead to prosecution. Neither the administrators nor the Seminar for Applied Mathematics (SAM) accept any liability in this respect. The most recent version of a SAM report may differ in formatting and style from published journal version. Do reference the published version if possible (see SAM Publications).