Kernel methods are competitive for operator learning
We present a general kernel-based framework for learning operators between Banach
spaces along with a priori error analysis and comprehensive numerical comparisons with …
spaces along with a priori error analysis and comprehensive numerical comparisons with …
Stochastic finite element methods for partial differential equations with random input data
MD Gunzburger, CG Webster, G Zhang - Acta Numerica, 2014 - cambridge.org
The quantification of probabilistic uncertainties in the outputs of physical, biological, and
social systems governed by partial differential equations with random inputs require, in …
social systems governed by partial differential equations with random inputs require, in …
Approximation of high-dimensional parametric PDEs
A Cohen, R DeVore - Acta Numerica, 2015 - cambridge.org
Parametrized families of PDEs arise in various contexts such as inverse problems, control
and optimization, risk assessment, and uncertainty quantification. In most of these …
and optimization, risk assessment, and uncertainty quantification. In most of these …
High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
We consider the problem of Lagrange polynomial interpolation in high or countably infinite
dimension, motivated by the fast computation of solutions to partial differential equations …
dimension, motivated by the fast computation of solutions to partial differential equations …
Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks
Learning approximations to smooth target functions of many variables from finite sets of
pointwise samples is an important task in scientific computing and its many applications in …
pointwise samples is an important task in scientific computing and its many applications in …
Enhancing ℓ1-minimization estimates of polynomial chaos expansions using basis selection
JD Jakeman, MS Eldred, K Sargsyan - Journal of Computational Physics, 2015 - Elsevier
In this paper we present a basis selection method that can be used with ℓ 1-minimization to
adaptively determine the large coefficients of polynomial chaos expansions (PCE). The …
adaptively determine the large coefficients of polynomial chaos expansions (PCE). The …
The gap between theory and practice in function approximation with deep neural networks
Deep learning (DL) is transforming whole industries as complicated decision-making
processes are being automated by deep neural networks (DNNs) trained on real-world data …
processes are being automated by deep neural networks (DNNs) trained on real-world data …
A weighted ℓ1-minimization approach for sparse polynomial chaos expansions
This work proposes a method for sparse polynomial chaos (PC) approximation of high-
dimensional stochastic functions based on non-adapted random sampling. We modify the …
dimensional stochastic functions based on non-adapted random sampling. We modify the …
Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
M Bachmayr, R Schneider, A Uschmajew - Foundations of Computational …, 2016 - Springer
Hierarchical tensors can be regarded as a generalisation, preserving many crucial features,
of the singular value decomposition to higher-order tensors. For a given tensor product …
of the singular value decomposition to higher-order tensors. For a given tensor product …
Fast estimation of expected information gains for Bayesian experimental designs based on Laplace approximations
Shannon-type expected information gain can be used to evaluate the relevance of a
proposed experiment subjected to uncertainty. The estimation of such gain, however, relies …
proposed experiment subjected to uncertainty. The estimation of such gain, however, relies …