Know a great AI tool or AI news source? Submit it to AiByts
2 min read

Towards the Query Complexity of Sampling under Strong Log-Concavity and Log-Sobolev Inequalities

We study the query complexity of sampling from smooth distributions on $\mathbb R^d$ using first-order oracles. For $d$-dimensional strongly log-concave targets with condition number $\kappa=2$, we prove that any randomized sampler requires $\exp({\Omega(\log^{1/3} d)})$ queries even from a…

By Huanjian Zhou, Taiji SuzukiarXiv - stat.ML

Read the full story

Originally published by arXiv - stat.ML on Nov 5, 2026.

Read on arXiv - stat.ML(opens in a new tab)

Comments

Sign in to join the discussion.

No comments yet — be the first to share your thoughts.