Algorithms for Kullback--Leibler Approximation of Probability Measures in Infinite Dimensions
Publication:3454461
DOI10.1137/14098171XzbMath1348.60033arXiv1408.1920MaRDI QIDQ3454461
No author found.
Publication date: 25 November 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.1920
algorithmsrelative entropyinverse problemsGaussian distributionselliptic PDEsconditioned diffusion processKullback-Leibler approximationMonte Carlo-Markov chain sampling
Gaussian processes (60G15) Nonparametric estimation (62G05) Central limit and other weak theorems (60F05) Monte Carlo methods (65C05) Inverse problems for PDEs (35R30) Diffusion processes (60J60)
Related Items (24)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions
- Bayesian inference with optimal maps
- Sample size selection in optimization methods for machine learning
- On the ergodicity properties of some adaptive MCMC algorithms
- Stochastic spectral methods for efficient Bayesian solution of inverse problems
- On H-valued Robbins-Monro processes
- Stochastic approximation revisited
- Convergence and robustness of the Robbins-Monro algorithm truncated at randomly varying bounds
- Computing a nearest symmetric positive semidefinite matrix
- Invariant measures of stochastic partial differential equations and conditioned diffusions
- Stochastic simulation: Algorithms and analysis
- Inverse problems: A Bayesian perspective
- A Stochastic Newton MCMC Method for Large-Scale Statistical Inverse Problems with Application to Seismic Inversion
- Fast Algorithms for Bayesian Uncertainty Quantification in Large-Scale Linear Inverse Problems Based on Low-Rank Partial Hessian Approximations
- Kullback--Leibler Approximation for Probability Measures on Infinite Dimensional Spaces
- Optimal Low-rank Approximations of Bayesian Linear Inverse Problems
- Algorithms for Kullback--Leibler Approximation of Probability Measures in Infinite Dimensions
- Optimization with PDE Constraints
- Riemann Manifold Langevin and Hamiltonian Monte Carlo Methods
- The stochastic root-finding problem
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- A Stochastic Approximation Method
- Approximation Methods which Converge with Probability one
- An adaptive Metropolis algorithm
- MCMC methods for functions: modifying old algorithms to make them faster
This page was built for publication: Algorithms for Kullback--Leibler Approximation of Probability Measures in Infinite Dimensions