Improved query complexity bounds for logconcave sampling, warm-start generation, isotropic rounding, and integration, with Rényi-infinity guarantees.
Gaussian C ooling and O^ * (n^3) algorithms for volume and G aussian volume
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
Improved query complexity bounds for logconcave sampling, warm-start generation, isotropic rounding, and integration, with Rényi-infinity guarantees.