Cover Image

Fast Convergence of $Φ$-Divergence Along the Unadjusted Langevin Algorithm and Proximal Sampler

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mitra, Siddharth, Wibisono, Andre
Format:	Preprint
Published:	2024
Subjects:	Statistics Theory Information Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information
by: Liang, Jiaming, et al.
Published: (2024)

Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
by: Wibisono, Andre
Published: (2025)

Tail-Sensitive KL and Rényi Convergence of Unadjusted Hamiltonian Monte Carlo via One-Shot Couplings
by: Bou-Rabee, Nawaf, et al.
Published: (2026)

Convergence of the Inexact Langevin Algorithm in KL Divergence with Application to Score-based Generative Models
by: Yang, Kaylee Yingxi, et al.
Published: (2022)

On the Convergence of Min-Max Langevin Dynamics and Algorithm
by: Cai, Yang, et al.
Published: (2024)

High-accuracy sampling from constrained spaces with the Metropolis-adjusted Preconditioned Langevin Algorithm
by: Srinivasan, Vishwak, et al.
Published: (2024)

Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
by: Srinivasan, Vishwak, et al.
Published: (2023)

Relationship between Hölder Divergence and Functional Density Power Divergence: Intersection and Generalization
by: Kobayashi, Masahiro
Published: (2025)

Riemannian Proximal Sampler for High-accuracy Sampling on Manifolds
by: Guan, Yunrui, et al.
Published: (2025)

Unbiased Estimating Equation on Inverse Divergence and Its Conditions
by: Kobayashi, Masahiro, et al.
Published: (2024)

A Unified Representation of Density-Power-Based Divergences Reducible to M-Estimation
by: Kobayashi, Masahiro
Published: (2025)

Optimal score estimation via empirical Bayes smoothing
by: Wibisono, Andre, et al.
Published: (2024)

Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models
by: Li, Gen, et al.
Published: (2023)

Wasserstein Convergence of Critically Damped Langevin Diffusions
by: Strasman, Stanislas, et al.
Published: (2025)

A Separation in Heavy-Tailed Sampling: Gaussian vs. Stable Oracles for Proximal Samplers
by: He, Ye, et al.
Published: (2024)

Complexity of Non-Log-Concave Sampling in Fisher Information
by: Chewi, Sinho, et al.
Published: (2026)

The Geometry of Efficient Nonconvex Sampling
by: Vempala, Santosh S., et al.
Published: (2026)

On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025)

Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)

Federated PCA and Estimation for Spiked Covariance Matrices: Optimal Rates and Efficient Algorithm
by: Li, Jingyang, et al.
Published: (2024)

Orthogonal Approximate Message Passing Algorithms for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
by: Chen, Haohua, et al.
Published: (2026)

Estimating Generalization Performance Along the Trajectory of Proximal SGD in Robust Regression
by: Tan, Kai, et al.
Published: (2024)

On the Exponential Convergence for Offline RLHF with Pairwise Comparisons
by: Chen, Zhirui, et al.
Published: (2024)

An Algorithm for Streaming Differentially Private Data
by: Kumar, Girish, et al.
Published: (2024)

Unifying AMP Algorithms for Rotationally-Invariant Models
by: Liu, Songbin, et al.
Published: (2024)

On Universality of Non-Separable Approximate Message Passing Algorithms
by: Lovig, Max, et al.
Published: (2025)

Are First-Order Diffusion Samplers Really Slower? A Fast Forward-Value Approach
by: Jiao, Yuchen, et al.
Published: (2025)

Concentration of the Langevin Algorithm's Stationary Distribution
by: Altschuler, Jason M., et al.
Published: (2022)

Optimality of Approximate Message Passing Algorithms for Spiked Matrix Models with Rotationally Invariant Noise
by: Dudeja, Rishabh, et al.
Published: (2024)

An Iterative Algorithm for Differentially Private $k$-PCA with Adaptive Noise
by: Düngler, Johanna, et al.
Published: (2025)

Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
by: Zhao, Qingyue, et al.
Published: (2026)

Variance Reduction for the Independent Metropolis Sampler
by: Liu, Siran, et al.
Published: (2024)

Fast and Efficient Parallel Sampling Using Higher Order Langevin Dynamics
by: Mahajan, Jaideep, et al.
Published: (2025)

Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
by: Kim, Gilhan
Published: (2026)

Fine-Grained Uncertainty Quantification via Collisions
by: Friedbaum, Jesse, et al.
Published: (2024)

Efficient Unbiased Sparsification
by: Barnes, Leighton, et al.
Published: (2024)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)

Top-$K$ ranking with a monotone adversary
by: Yang, Yuepeng, et al.
Published: (2024)

Representatividad Muestral en la Incertidumbre Simétrica Multivariada para la Selección de Atributos
by: Sosa-Cabrera, Gustavo
Published: (2024)

On the best approximation by finite Gaussian mixtures
by: Ma, Yun, et al.
Published: (2024)