canonical setting

Convex body + membership oracle

π=unif(K)\pi=\operatorname{unif}(K), B(0,1)KB(0,1)\subseteq K, membership queries; Λ=Cov(π)op\Lambda=\lVert\operatorname{Cov}(\pi)\rVert_{\rm op}.

Upper and lower bounds

Comparison table

4 scoped results. Tildes suppress logarithmic factors.

Edit table
Best-known and comparison results for Convex body + membership oracle
ResultAlgorithm or modelComplexityGuaranteeOracle / startAssumptions and notesReviewSources
best upperProximal / In-and-Out with restartO~(qd2Λlog6(1/ε))\widetilde O(qd^2\Lambda\log^6(1/\varepsilon))Rqε\mathcal R_q\le\varepsilonMembershipqq-Rényi warm start, Mq10M_q\le10Finite Rényi order and covariance scale as defined in the paper.Provisional transcription of the current finite-qq frontier.Citedpreprint
lower unknownGeneral sampling lower boundUnknownMembership-query sampling in matching divergenceMembershipWarm or end-to-end must be specifiedNo matching general lower bound located.The cited obstruction is not a general oracle lower bound.Unverifiedno primary source
upperRényi-preserving annealingO~(qd2R3/2Λ1/4+qd2Λlog7(1/ε))\widetilde O(qd^2R^{3/2}\Lambda^{1/4}+qd^2\Lambda\log^7(1/\varepsilon))Rqε\mathcal R_q\le\varepsilonMembershipEnd-to-end / cold annealingR2=EπX2R^2=\mathbb E_\pi\lVert X\rVert^2.In isotropic position this is roughly d11/4d^{11/4} up to logarithms.Citedpreprint
upperConstrained proximal samplerO~(d3polylog(1/ε))\widetilde O(d^3\,\operatorname{polylog}(1/\varepsilon))Rε\mathcal R_\infty\le\varepsilonMembershipPaper's end-to-end setupStronger infinite-Rényi target; compare separately from finite qq.Published comparator with a stronger divergence guarantee.Checkedpublished

Scope

This page concerns sampling, not volume estimation. It records finite-qq Rényi and RR_\infty guarantees separately, and it keeps warm-start and annealed cold-start costs distinct.

Lower bounds

The familiar Ω~(d2)\widetilde\Omega(d^2) membership-query bound in the monograph is for volume estimation, not sampling. It is therefore not placed in this table. The paper on zeroth-order log-concave sampling proves a Gaussian-annealing obstruction, but not a general membership-oracle sampling lower bound.