Tight Sampling Complexity with stochastic gradient oracles in Fixed Dimensions

2026-09-11

AI Summary

研究使用随机梯度oracle在固定维度下采样平滑强对数凹分布的复杂度，给出同时适应于条件数和精度的紧致复杂度边界。

Abstract

We investigate the stochastic-gradient query complexity of sampling smooth strongly log-concave distributions in any fixed Euclidean dimension. The potential is $μ$-strongly convex and $L$-smooth, with an unknown mode in the ball of radius $μ^{-1/2}$ about the origin. We have access to unbiased stochastic oracles with the variance at most $σ^2$. For every $σ^2\ge0$ and total variation (TV) accuracy $0<\varepsilon\le1/10$, we prove that the tight complexity of sampling a distribution within $ε$-TV distance from the target distribution is \[ N^\star_{\text{TV}}=Θ\!\left(\log(1+κ)+ \frac{σ^2}{με}\right), \] where $κ:=\frac Lμ$ is the condition number. Note that this complexity bound is simultaneously tight for the condition number $κ$ and accuracy $ε$. Besides, our tight complexity bound is adaptive to noiseless setting $σ=0$, which is $ N^\star_{\text{TV}}=Θ\!\left(\log(1+κ)\right)$.

Problem

• stochastic gradient
• query complexity
• log-concave distributions
• total variation accuracy
• condition number

Innovation

• stochastic gradient
• log-concave distributions
• query complexity
• total variation accuracy
• condition number