Global convergence of optimized adaptive importance samplers
Not on the map. Why?
Abstract (arXiv)
We analyze the optimized adaptive importance sampler (OAIS) for performing Monte Carlo integration with general proposals. We leverage a classical result which shows that the bias and the mean-squared error (MSE) of the importance sampling scales with the chi2-divergence between the target and the proposal and develop a scheme which performs global optimization of chi2-divergence. While it is known that this quantity is convex for exponential family proposals, the case of the general proposals has been an open problem. We close this gap by utilizing the nonasymptotic bounds for stochastic gradient Langevin dynamics (SGLD) for the global optimization of chi2-divergence and derive nonasymptotic bounds for the MSE by leveraging recent results from non-convex optimization literature. The resulting AIS schemes have explicit theoretical guarantees that are uniform-in-time.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 21 of its 60 references that are in the map. First posted on arXiv 2 Jan 2022.
Builds on
21 of 60 references.
References · 21
- 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
- 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
- 2018Neural Importance Samplingcited by 154
- 2017Global Convergence of Langevin Dynamics Based Algorithms for Nonconvex Optimizationcited by 96
- 2018The promises and pitfalls of Stochastic Gradient Langevin Dynamicscited by 56
- 2018Global Non-convex Optimization with Discretized Diffusionscited by 44
- 2018Variance reduction properties of the reparameterization trickcited by 41
- 2019Nonasymptotic estimates for Stochastic Gradient Langevin Dynamics under local conditions in nonconvex optimizationcited by 38
- 2020Faster Convergence of Stochastic Gradient Langevin Dynamics for Non-Log-Concave Samplingcited by 32
- 2018Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Non-Convex Stochastic Optimization: Non-Asymptotic Performance Bounds and Momentum-Based Accelerationcited by 31
- 2021Variational Refinement for Importance Sampling Using the Forward Kullback-Leibler Divergencecited by 29
- 2015Adaptive importance sampling for control and inferencecited by 23
9 more
- 2015Layered Adaptive Importance Samplingcited by 18
- 2020Nonasymptotic analysis of Stochastic Gradient Hamiltonian Monte Carlo under local conditions for nonconvex optimizationcited by 13
- 2019Convergence rates for optimised adaptive importance samplerscited by 11
- 2021Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networkscited by 11
- 2021Non-asymptotic estimates for TUSLA algorithm for non-convex learning with applications to neural networks with ReLU activation functioncited by 10
- 2018Asymptotic optimality of adaptive importance samplingcited by 9
- 2016Langevin Incremental Mixture Importance Samplingcited by 5
- 2014Adaptive Importance Sampling via Stochastic Convex Programmingcited by 3
- 2021MCMC-driven importance samplerscited by 3
Built on by
Citing papers per year: 2022: 1; 2023: 1.
2 papers.