Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 38 min ago
PreprintarXiv licencearXiv

Dimension-free regimes for unadjusted Langevin in ridge-separable models: A subspace robust Wasserstein analysis

Abstract

The Unadjusted Langevin Algorithm (ULA) is widely used for high-dimensional Bayesian inference. Classical analyses in Wasserstein-2 distance predict an asymptotic bias and a mixing time that grow with dimension, but this metric is stronger than necessary for many statistical tasks. We instead analyze the bias in subspace robust Wasserstein distance, which controls the mean and arbitrary low-dimensional marginals and is therefore well suited to observables typically estimated in practice. For ridge-separable potentials formed with i.i.d. data, we prove high-probability bounds showing a bell-shaped mixing profile as the number of data points N varies relative to the dimension d. In the overparameterized regime, the effective dimension is the rank N of the data-dependent perturbation, leading to complexity depending on N rather than d. In the large-sample regime, Gaussian-perturbation estimates yield dimension-free complexity once N is sufficiently large. In contrast, near the proportional regime asymp d, we prove that dimension-free guarantees are impossible in general.

Related

  1. The Tamed Subgradient Unadjusted Langevin Algorithm beyond Convexity
    Iosif Lytras, Nikolaos Makras, Sotirios Sabanis
    arXivPreprintCC BY 4.0Full textOptimisation & controlProbabilityarXiv
  2. Wasserstein Bounds for Euler and Randomized Midpoint Langevin Sampling with Noisy Gradients
    Yifei Xiong, Vinayak Rao
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingStatisticsarXiv
  3. Local Algebraic Stability of Wasserstein Gradient Descent-Ascent and Mean Field Langevin Dynamics without Spectral Gap
    Jing An, Lihan Wang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsOptimisation & controlarXiv
  4. A CONSTRAINED WASSERSTEIN GRADIENT FLOW FOR MEAN-FIELD LANGEVIN DYNAMICS
    Mohamed Alfaki Aboubacrine Assadek
    HALPreprintCC BY 4.0Full textAnalysis & PDEsMathematical physicsHALarXiv
  5. Semi-discrete quadratic Wasserstein energy and state-dependent Langevin exploration
    Ran Gu, Gaoyue Guo, Kelvin Shuangjian Zhang
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingOptimisation & controlarXiv
BibTeX
@misc{chen2026dimensionfree,
  title = {{Dimension-free regimes for unadjusted Langevin in ridge-separable models: A subspace robust Wasserstein analysis}},
  author = {Yuansi Chen and Francesco Pedrotti and Peter A. Whalley},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.31431},
  eprint = {2610.31431},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.31431},
}
RIS
TY  - UNPB
TI  - Dimension-free regimes for unadjusted Langevin in ridge-separable models: A subspace robust Wasserstein analysis
AU  - Yuansi Chen
AU  - Francesco Pedrotti
AU  - Peter A. Whalley
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.31431
UR  - https://arxiv.org/abs/2610.31431
AB  - The Unadjusted Langevin Algorithm (ULA) is widely used for high-dimensional Bayesian inference. Classical analyses in Wasserstein-2 distance predict an asymptotic bias and a mixing time that grow with dimension, but this metric is stronger than necessary for many statistical tasks. We instead analyze the bias in subspace robust Wasserstein distance, which controls the mean and arbitrary low-dimensional marginals and is therefore well suited to observables typically estimated in practice. For ridge-separable potentials formed with i.i.d. data, we prove high-probability bounds showing a bell-shaped mixing profile as the number of data points N varies relative to the dimension d. In the overparameterized regime, the effective dimension is the rank N of the data-dependent perturbation, leading to complexity depending on N rather than d. In the large-sample regime, Gaussian-perturbation estimates yield dimension-free complexity once N is sufficiently large. In contrast, near the proportional regime asymp d, we prove that dimension-free guarantees are impossible in general.
ER  -