Cover Image

From Minimax Optimal Importance Sampling to Uniformly Ergodic Importance-tempered MCMC

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Zhou, Quan
Format:	Preprint
Published:	2025
Subjects:	Computation Probability Machine Learning 65C05, 60J25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Importance is Important: Generalized Markov Chain Importance Sampling Methods
by: Li, Guanxun, et al.
Published: (2023)

Polynomial Mixing Times of Simulated Tempering for Mixture Targets by Conductance Decomposition
by: Zhou, Quan
Published: (2025)

Piecewise deterministic sampling with splitting schemes
by: Bertazzi, Andrea, et al.
Published: (2023)

Diffusive Scaling Limits of Forward Event-Chain Monte Carlo: Provably Efficient Exploration with Partial Refreshment
by: Shiba, Hirofumi, et al.
Published: (2026)

Discretization of the Ergodic Functional Central Limit Theorem
by: Pagès, Gilles, et al.
Published: (2018)

On couplings for kinetic Langevin diffusions
by: Bou-Rabee, Nawaf, et al.
Published: (2026)

Reflection coupling for unadjusted generalized Hamiltonian Monte Carlo in the nonconvex stochastic gradient case
by: Chak, Martin, et al.
Published: (2023)

Unadjusted Hamiltonian MCMC with Stratified Monte Carlo Time Integration
by: Bou-Rabee, Nawaf, et al.
Published: (2022)

Central Limit Theorem for ergodic averages of Markov chains \& the comparison of sampling algorithms for heavy-tailed distributions
by: Brešar, Miha, et al.
Published: (2025)

Rapid convergence of tempering chains to multimodal Gibbs measures
by: Son, Seungjae
Published: (2026)

Concentration analysis of multivariate elliptic diffusion processes
by: Aeckerle-Willems, Cathrine, et al.
Published: (2022)

The No-Underrun Sampler: A Locally-Adaptive, Gradient-Free MCMC Method
by: Bou-Rabee, Nawaf, et al.
Published: (2025)

Parallel MCMC Algorithms: Theoretical Foundations, Algorithm Design, Case Studies
by: Glatt-Holtz, Nathan E., et al.
Published: (2022)

The random timestep Euler method and its continuous dynamics
by: Latz, Jonas
Published: (2024)

Dimension-Free Multimodal Sampling via Preconditioned Annealed Langevin Dynamics
by: Baldassari, Lorenzo, et al.
Published: (2026)

Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures
by: Baldassari, Lorenzo, et al.
Published: (2026)

Numerical solution to the Neumann problem in a Lipschitz domain, based on random walks
by: Lupascu-Stamate, Oana, et al.
Published: (2024)

Ensemble-Based Annealed Importance Sampling
by: Chen, Haoxuan, et al.
Published: (2024)

Accelerate Langevin Sampling with Birth-Death Process and Exploration Component
by: Tan, Lezhi, et al.
Published: (2023)

Solving Poisson's equation for Wasserstein contractive Markov chains
by: Hofstadler, Julian
Published: (2026)

Sampling on Discrete Spaces with Temporal Point Processes
by: Stewart, Cameron A., et al.
Published: (2026)

Simulation of elliptic and hypo-elliptic conditional diffusions
by: Bierkens, Joris, et al.
Published: (2018)

A geometric approach to informed MCMC sampling
by: Roy, Vivekananda
Published: (2024)

An invitation to adaptive Markov chain Monte Carlo convergence theory
by: Laitinen, Pietari, et al.
Published: (2024)

Cylindrical Projections of Occupied Diffusions
by: Tissot-Daguette, Valentin, et al.
Published: (2026)

Spectral Gap of Metropolis Algorithms for Non-smooth Distributions under Isoperimetry
by: Liu, Shuigen, et al.
Published: (2026)

Efficient Importance Sampling for Wrong Exit Probabilities over Combinatorially Many Rare Regions
by: Song, Yanglei, et al.
Published: (2025)

Nonparametric learning of stochastic differential equations from sparse and noisy data
by: Ganguly, Arnab, et al.
Published: (2025)

Yaglom limits of continuous-state branching processes in Brownian random environment
by: Li, Pei-Sen, et al.
Published: (2026)

Divergence-Kernel method for scores of random systems
by: Ni, Angxiu
Published: (2025)

Randomized Runge-Kutta-Nyström Methods for Unadjusted Hamiltonian and Kinetic Langevin Monte Carlo
by: Bou-Rabee, Nawaf, et al.
Published: (2023)

Piecewise Deterministic Sampling for Constrained Distributions
by: Demano, Joël Tatang, et al.
Published: (2025)

Weak Poincaré inequality comparisons for ideal and hybrid slice sampling
by: Power, Sam, et al.
Published: (2024)

On sample complexity for covariance estimation via the unadjusted Langevin algorithm
by: Nakakita, Shogo
Published: (2026)

Spectral Gap for the Stochastic Exchange Model
by: Carlen, Eric A., et al.
Published: (2025)

Fluid limit and gelation in the frozen Erdős-Rényi random graph
by: Haas, Bénédicte, et al.
Published: (2025)

Convergence of kinetic Langevin samplers for non-convex potentials
by: Schuh, Katharina, et al.
Published: (2024)

Optimal convergence rates of MCMC integration for functions with unbounded second moment
by: Hofstadler, Julian
Published: (2024)

Distributional Computational Graphs: Error Bounds
by: Elias, Olof Hallqvist, et al.
Published: (2026)

Convergence of stochastic gradient descent schemes for Lojasiewicz-landscapes
by: Dereich, Steffen, et al.
Published: (2021)