Sparse approximation of triangular transports. I: The finite-dimensional case
DOI10.1007/s00365-022-09569-2OpenAlexW3183498204MaRDI QIDQ2672289
Publication date: 8 June 2022
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.06994
samplingneural networkssparse approximationuncertainty quantificationdomains of holomorphytransport maps
Sampling theory, sample surveys (62D05) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15) Domains of holomorphy (32D05) Optimality conditions for problems involving randomness (49K45) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Inverse problems in optimal control (49N45) Optimal transportation (49Q22)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On tensor product approximation of analytic functions
- High-dimensional adaptive sparse polynomial interpolation and applications to parametric PDEs
- Bayesian inference with optimal maps
- An upper estimate of integral points in real simplices with an application to singularity theory
- Analyticity in infinite dimensional spaces
- Numerical integration using sparse grids
- On a generalization of the preconditioned Crank-Nicolson metropolis algorithm
- Statistical and computational inverse problems.
- Approximation properties of a multilayered feedforward artificial neural network
- Exponential convergence of the deep neural network approximation for analytic functions
- Exponential ReLU DNN expression of holomorphic maps in high dimension
- On the convergence of the Laplace approximation and noise-level-robustness of Laplace-based Monte Carlo methods for Bayesian inverse problems
- Higher order quasi-Monte Carlo integration for Bayesian PDE inversion
- Localization for MCMC: sampling high-dimensional posterior distributions with local structure
- Error bounds for approximations with deep ReLU networks
- Approximation and sampling of multivariate probability distributions in the tensor train decomposition
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Dimension-independent likelihood-informed MCMC
- The Wasserstein distances between pushed-forward measures with applications to uncertainty quantification
- Polynomial approximation of anisotropic analytic functions of several variables
- Adaptive Sparse Grid Model Order Reduction for Fast Bayesian Estimation and Inversion
- Sparse, adaptive Smolyak quadratures for Bayesian inverse problems
- Sparse deterministic approximation of Bayesian inverse problems
- Inverse problems: A Bayesian perspective
- Scaling limits in computational Bayesian inversion
- Sparse Tensor Discretization of Elliptic sPDEs
- Transport Map Accelerated Markov Chain Monte Carlo
- Multilevel Sequential Monte Carlo with Dimension-Independent Likelihood-Informed Proposals
- MALA-within-Gibbs Samplers for High-Dimensional Distributions with Sparse Conditional Structure
- Improving Approximate Bayesian Computation via Quasi-Monte Carlo
- Estimating Smooth Monotone Functions
- Shape Holomorphy of the Stationary Navier--Stokes Equations
- Scaling Limit of the Stein Variational Gradient Descent: The Mean Field Regime
- Higher Order Quasi--Monte Carlo Integration for Holomorphic, Parametric Operator Equations
- On Choosing and Bounding Probability Metrics
- On the Well-posedness of Bayesian Inverse Problems
- Convergence rates of high dimensional Smolyak quadrature
- Better Approximations of High Dimensional Smooth Functions by Deep Neural Networks with Rectified Power Units
- Well-Posed Bayesian Inverse Problems: Priors with Exponential Tails
- Quasi-Monte Carlo and Multilevel Monte Carlo Methods for Computing Posterior Expectations in Elliptic Inverse Problems
- Triangular transformations of measures
- Remarks on a Multivariate Transformation
- Optimal Transport
- MCMC methods for functions: modifying old algorithms to make them faster