A proximal gradient sampler for composite log-concave distributions achieves near-optimal iteration complexity of order kappa sqrt(d) log^4(1/epsilon) in total variation distance under strong convexity and smoothness.
citation dossier
Nonasymptotic convergence analysis for the unadjusted
1Pith papers citing it
1reference links
math.STtop field · 1 papers
UNVERDICTEDtop verdict bucket · 1 papers
why this work matters in Pith
Pith has found this work in 1 reviewed paper. Its strongest current cluster is math.ST (1 papers). The largest review-status bucket among citing papers is UNVERDICTED (1 papers). For highly cited works, this page shows a dossier first and a bounded explorer second; it never tries to render every citing paper at once.
fields
math.ST 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A proximal gradient algorithm for composite log-concave sampling
A proximal gradient sampler for composite log-concave distributions achieves near-optimal iteration complexity of order kappa sqrt(d) log^4(1/epsilon) in total variation distance under strong convexity and smoothness.