Cover Image

Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liang, Jiaming, 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

Fast Convergence of $Φ$-Divergence Along the Unadjusted Langevin Algorithm and Proximal Sampler
by: Mitra, Siddharth, et al.
Published: (2024)

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

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

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

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

On the Convergence of Min-Max Langevin Dynamics and Algorithm
by: Cai, Yang, 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)

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

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

On the Nonasymptotic Scaling Guarantee of Hyperparameter Estimation in Inhomogeneous, Weakly-Dependent Complex Network Dynamical Systems
by: Yu, Yi, et al.
Published: (2026)

The Sample Complexity of Distributed Simple Binary Hypothesis Testing under Information Constraints
by: Kazemi, Hadi, et al.
Published: (2025)

Breaking AR's Sampling Bottleneck: Provable Acceleration via Diffusion Language Models
by: Li, Gen, et al.
Published: (2025)

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

Adaptation to Intrinsic Dependence in Diffusion Language Models
by: Zhao, Yunxiao, et al.
Published: (2026)

Agnostic Sample Compression Schemes for Regression
by: Attias, Idan, et al.
Published: (2018)

Contraction of Locally Differentially Private Mechanisms
by: Asoodeh, Shahab, et al.
Published: (2022)

The Sample Complexity of Simple Binary Hypothesis Testing
by: Pensia, Ankit, et al.
Published: (2024)

Breaking the Finite-Sample Barrier in Entropy Coupling
by: Asoodeh, Shahab, et al.
Published: (2026)

On the Sample Complexity of Robust Binary Hypothesis Testing
by: Vallinayagam, Shankar, et al.
Published: (2026)

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

Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
by: Dmitriev, Daniil, et al.
Published: (2026)

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

Sample efficient inductive matrix completion with noise and inexact side information
by: Yang, Yuepeng, et al.
Published: (2026)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
by: Lau, Ivan, et al.
Published: (2025)

Distributed Nonparametric Estimation: from Sparse to Dense Samples per Terminal
by: Yuan, Deheng, et al.
Published: (2025)

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

Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
by: Chen, Fan, et al.
Published: (2024)

Accurate Estimation of Mutual Information in High Dimensional Data
by: Abdelaleem, Eslam, et al.
Published: (2025)

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

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

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

Online Clustering of Data Sequences with Bandit Information
by: Chandran, G Dhinesh, et al.
Published: (2025)

Optimal training-conditional regret for online conformal prediction
by: Liang, Jiadong, et al.
Published: (2026)

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

Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs
by: Huang, Dong, et al.
Published: (2024)

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

Variational Representations of Annealing Paths: Bregman Information under Monotonic Embedding
by: Brekelmans, Rob, et al.
Published: (2022)

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

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