The paper characterizes the worst-case query complexity of sampling from smooth non-log-concave distributions as exponential in dimension, with matching lower and upper bounds.
An introduction to MCMC for machine learning
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the query complexity of sampling from non-log-concave distributions
The paper characterizes the worst-case query complexity of sampling from smooth non-log-concave distributions as exponential in dimension, with matching lower and upper bounds.