Near-Linear Accuracy Bounds for Moreau--Yosida Unadjusted Langevin Sampling
cs.LG
Submitted: 2026-09-30
Updated: 2026-09-30
Terminology
Sources
- Analysis of Langevin Monte Carlo from Poincar'e to Log-Sobolev
- Wasserstein mixing time of the unadjusted Langevin algorithm
- Comparison between $W_2$ distance and $\dot{H}^{-1}$ norm, and localisation of Wasserstein distance
- Active-Trace Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling
- Poisson-Corrector Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks