Thin-shell stability of Gaussian cooling: logconcave sampling with sesteric complexity from a cold start
Published 15 Sept 2026arXiv:2609.15884
Updated 29 h ago · first seen 15 Sept 2026
paper_01M2JK0CZ41XBBYVZ45QJ1QWTY
Abstract
We show that logconcave probability measures along the Gaussian cooling path have thin-shell stability, generalizing the thin-shell theorem. This result leads to improved complexity for the fundamental problem of sampling an arbitrary logconcave distribution from a cold start. For (near-)isotropic logconcave distributions, the complexity is nearly $n^{2.5}$, improving the previous bound of $n^{2.75}$, and matching the complexity of the abstract Speedy walk.
Organizations
Organizations 0
No organization stated. arXiv metadata does not carry affiliations; an organization is linked only when a model card or lab page cites the paper.
Models
Models introduced or described 0
Inbound described_by relations from model cards and documentation.
No model links this paper yet
Datasets
Datasets used 0
No dataset relation recorded.
Benchmarks
Benchmarks used 0
No benchmark relation recorded.
Code
Repositories & frameworks 0
No repository linked.
Timeline
Timeline 1
- New paperPaperThin-shell stability of Gaussian cooling: logconcave sampling with sesteric complexity from a cold start
New paper: Thin-shell stability of Gaussian cooling: logconcave sampling with sesteric complexity from a cold start
arxiv
Sources
Sources 1
Tier 1 = official/primary, 2 = quality secondary, 3 = community, 4 = unverified. Every snapshot is archived; see all sources and the methodology.