Optimal approximation of infinite-dimensional holomorphic functions
From MaRDI portal
Abstract: Over the last decade, approximating functions in infinite dimensions from samples has gained increasing attention in computational science and engineering, especially in computational uncertainty quantification. This is primarily due to the relevance of functions that are solutions to parametric differential equations in various fields, e.g. chemistry, economics, engineering, and physics. While acquiring accurate and reliable approximations of such functions is inherently difficult, current benchmark methods exploit the fact that such functions often belong to certain classes of holomorphic functions to get algebraic convergence rates in infinite dimensions with respect to the number of (potentially adaptive) samples . Our work focuses on providing theoretical approximation guarantees for the class of -holomorphic functions, demonstrating that these algebraic rates are the best possible for Banach-valued functions in infinite dimensions. We establish lower bounds using a reduction to a discrete problem in combination with the theory of -widths, Gelfand widths and Kolmogorov widths. We study two cases, known and unknown anisotropy, in which the relative importance of the variables is known and unknown, respectively. A key conclusion of our paper is that in the latter setting, approximation from finite samples is impossible without some inherent ordering of the variables, even if the samples are chosen adaptively. Finally, in both cases, we demonstrate near-optimal, non-adaptive (random) sampling and recovery strategies which achieve close to same rates as the lower bounds.
Recommendations
- On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples
- Polynomial approximation of anisotropic analytic functions of several variables
- Hyperbolic cross approximation in infinite dimensions
- On the approximability and curse of dimensionality of certain classes of high-dimensional functions
Cites work
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- scientific article; zbMATH DE number 3238721 (Why is no real title available?)
- A mathematical introduction to compressive sensing
- A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs
- An introduction to measure theory
- Analytic regularity and collocation approximation for elliptic PDEs with random domain deformations
- Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
- Approximation of high-dimensional parametric PDEs
- Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence
- Approximation theory and approximation practice
- Better approximations of high dimensional smooth functions by deep neural networks with rectified power units
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
- Constructive deep ReLU neural network approximation
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Deep ReLU neural networks in high-dimensional approximation
- Deep learning in high dimension: ReLU neural network expression for Bayesian PDE inversion
- Deep learning in high dimension: neural network expression rates for generalized polynomial chaos expansions in UQ
- Deterministic and stochastic error bounds in numerical analysis
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
- Domain uncertainty quantification in computational electromagnetics
- Exponential ReLU DNN expression of holomorphic maps in high dimension
- Introduction to uncertainty quantification
- Kolmogorov widths and low-rank approximations of parametric elliptic PDEs
- On optimal recovery in L₂
- On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods
- Optimal nonlinear approximation
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- Recovery of high order accuracy in radial basis function approximations of discontinuous problems
- Regularity and generalized polynomial chaos approximation of parametric and random second-order hyperbolic partial differential equations
- Shape holomorphy of the stationary Navier-Stokes equations
- Sparse Polynomial Approximation of High-Dimensional Functions
- Sparse adaptive approximation of high dimensional parametric initial value problems
- Sparse tensor discretization of elliptic SPDEs
- Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs
- Spectral Methods for Uncertainty Quantification
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Stochastic finite element methods for partial differential equations with random input data
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- Wavelets and other orthogonal systems.
Cited in
(5)- Optimal approximation of infinite-dimensional holomorphic functions. II: Recovery from i.i.d. pointwise samples
- Operator learning using random features: a tool for scientific computing
- On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples
- An operator learning perspective on parameter-to-observable maps
- Optimal sampling for least-squares approximation
This page was built for publication: Optimal approximation of infinite-dimensional holomorphic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151536)
