Pith. sign in

REVIEW 2 major objections 4 minor 1 cited by

Sampling and Integration of Logconcave Functions by Algorithmic Diffusion

T0 review · 2 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Arbitrary logconcave sampling, rounding, and integration can be performed at query complexities matching uniform convex bodies, via a lifted exponential diffusion sampler.

desk verdict First real improvement in nearly two decades for general logconcave sampling, rounding, and integration—the sampling half is solid, the rounding half has a patchable spectral-gap gap. read the letter →

arxiv 2411.13462 v1 pith:GW4USATJ submitted 2024-11-20 cs.DS cs.LGmath.STstat.MLstat.TH

Yunbum Kook , Santosh S. Vempala This is my paper · ORCID
classification cs.DScs.LGmath.STstat.MLstat.TH MSC 68W2060J2265C0552A23
keywords logconcavesamplingproximalsamplerRényidivergencelog-SobolevinequalityisotropicroundingintegrationGaussiancoolingexponentialreduction
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that sampling, rounding, and integrating arbitrary logconcave functions can all be sped up, for the first time in nearly two decades, by lifting each target density to an exponential distribution in one higher dimension and then running a diffusion-based proximal sampler. From a warm start, the paper proves an $R_q$-mixing rate governed by the operator norm of the covariance rather than its trace; without a warm start, its tilted Gaussian cooling generates an $R_\infty$-warm start in $\widetilde{O}(n^2(R^2\vee n))$ queries; and the same machinery gives 1.01-isotropic rounding in $\widetilde{O}(n^{3.5})$ queries and $(1+\varepsilon)$-multiplicative integration in $\widetilde{O}(n^3/\varepsilon^2)$ queries for well-rounded functions. If the claims are right, general logconcave densities inherit the best-known query complexities that were previously available only for uniform distributions over convex bodies. The paper also argues that the stronger Rényi-divergence guarantees simplify the statistical analysis of dependent samples in the integration routine.

What carries the argument

The central object is the lifted exponential distribution $\pi(x,t)\propto e^{-nt}$ restricted to the convex epigraph-type set $K=\{(x,t):V(x)\le nt\}$. This reduction linearizes the potential and makes the conditional law of $X$ given $T$ uniform on a level set of $V$. The proximal sampler $\mathrm{PS}_{\mathrm{exp}}$ carries the argument: one step draws $y\sim \mathcal{N}(z,hI_{n+1})$ (forward heat flow) and then draws $z\sim \mathcal{N}(y-h\alpha,hI_{n+1})|_K$ (the time-reversed backward step), implemented by rejection sampling with a threshold. The mixing analysis uses Poincaré and log-Sobolev contraction, while $R_\infty$ guarantees come from uniform ergodicity of the chain. Tilted Gaussian Cooling then anneals through measures $\mu_{\sigma^2,\rho}\propto \exp(-\|x\|^2/(2\sigma^2)-\rho t)|_{\overline K}$, whose log-Sobolev constant is bounded by $\sigma^2\vee l^2$ via the Bakry-Émery criterion and the preservation of that constant under convex truncation.

What would settle it

Estimate numerically the log-Sobolev constant of $\mu_{\sigma^2,\rho}\propto \exp(-\|x\|^2/(2\sigma^2)-\rho t)$ restricted to a long, thin convex cylinder $\overline K$ with fixed $\sigma^2$ but growing aspect ratio; if the constant grows superlinearly in the aspect ratio rather than staying $O(\sigma^2\vee l^2)$, the query bounds of Theorems 1.6 and 1.8 collapse.

Watch

Extended reading notes

Core claim

The central discovery is that general logconcave sampling can be handled without smoothness or gradient-Lipschitz assumptions. The paper reduces the target $\pi_X\propto e^{-V}$ to the exponential distribution $\pi(x,t)\propto e^{-nt}\mathbf{1}[V(x)\le nt]$ on $\mathbb{R}^{n+1}$, whose $X$-marginal is exactly $\pi_X$. A proximal sampler alternating forward Gaussian heat flow and backward truncated-Gaussian sampling mixes at a rate controlled by the Poincaré constant of the target; a tilted Gaussian cooling schedule over these lifted distributions produces an $O(1)$-warm start; and covariance estimation with dependent samples turns the sampling guarantee into isotropic rounding. The resulting complexity bounds match the best-known rates for uniform distributions over convex bodies and, for well-rounded functions, the integration bound is $\widetilde{O}(n^3/\varepsilon^2)$.

Load-bearing premise

The load-bearing premise is that truncating a tilted Gaussian measure to a convex set does not degrade its log-Sobolev constant by a factor tied to the set's aspect ratio; if convex truncation introduces such a factor, the annealing and integration query bounds no longer follow.

Editorial extensions

If this is right

  • Any logconcave distribution can be sampled to $R_\infty$ error in $\widetilde{O}(n^2(R^2\vee n))$ evaluation queries, matching the uniform convex-body rate.
  • Warm-start sampling mixes with a rate depending on $\|\mathrm{Cov}\pi_X\|$ instead of $\mathrm{tr}(\mathrm{Cov}\pi_X)$, making the sampler faster on elongated targets.
  • The $\widetilde{O}(n^{3.5})$ rounding algorithm removes the polynomial dependence on the ambient radius $R$, leaving only polylogarithmic factors.
  • Integration of a well-rounded logconcave function costs $\widetilde{O}(n^3/\varepsilon^2)$ queries, improving the prior $\widetilde{O}(n^4/\varepsilon^2)$ bound.
  • The strong $R_\infty$ and $R_q$ output guarantees let the integration analysis replace delicate coupling arguments with simple $\beta$-mixing bounds.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • An extension the paper leaves implicit is that the same lifting trick may apply to other non-smooth, non-gradient settings, since the reduction requires only convexity of $V$, not any smoothness of the sampler's drift.
  • Because the sampler provides $R_\infty$ guarantees directly, it is a natural candidate for differentially private logconcave sampling at essentially the same query cost, a connection not developed here.
  • A testable consequence of the improved mixing rate is that on long, thin logconcave targets the number of oracle calls should scale with the largest variance direction rather than the total variance; an empirical comparison against hit-and-run-style samplers would make the improvement visible.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper studies the query complexity of sampling, warm-start generation, isotropic rounding, and integration for arbitrary logconcave densities proportional to e^{-V}, given an evaluation oracle for the convex potential V. The authors lift the target to an exponential distribution π(x,t) ∝ e^{-nt} on the epigraph K = {(x,t) : V(x) ≤ nt}, whose x-marginal is exactly the original target. They analyze a Proximal Sampler for this lifted distribution, proving Rényi and Rényi-infinity mixing in terms of isoperimetric constants, then combine it with a tilted Gaussian cooling scheme for warm-start generation. The resulting sampler is applied to covariance-estimation-based isotropic rounding and to an annealing-based integration algorithm with a β-mixing analysis of dependent samples. The stated results are Theorems 1.5-1.8, claiming ~O(n^2(R^2∨n) polylog(1/(ηε))) queries for warm-start sampling, ~O(n^{3.5} polylog R) for rounding, and ~O(n^3/ε^2) for integration of well-rounded functions, matching the best known rates for uniform distributions over convex bodies.

Significance. If fully established, this would be a substantial advance: it would give the first complexity improvements in nearly two decades for general logconcave sampling, rounding, and integration, and would match the best-known rates for the uniform case while providing stronger Rényi-infinity output guarantees. The diffusion-based reduction to an exponential distribution is elegant, the parameter schedules are explicit, and the streamlined handling of dependent samples is a genuine methodological contribution. The paper also builds transparently on the authors' own prior work and on Klartag's isoperimetric bounds. However, two load-bearing proof points are not yet fully supported: the spectral-gap claim in the rounding algorithm is not implied by the stated step sizes and the paper's own isoperimetric bounds, and the extension of the heat-flow lemma to unbounded support is asserted rather than proved. These issues affect the rounding and integration theorems as written, although the natural repairs appear compatible with the stated ~O complexity claims.

major comments (2)
  1. [§4.1, Proposition 4.7] Proposition 4.7 asserts that PS^{N_i}(µ_i,·,h_i) with N_i ≍ r_i^{-2} n^3 log n and h_i ≍ r_i^2 (n^2 log(r_i n))^{-1} has spectral gap at least 0.99, and Lemma 4.5 is then invoked for the covariance estimator in Line 5. This is not supported by the paper's own mixing bounds. Lemma 2.9 gives per-step χ² contraction by (1+h/CPI(π))^{-2}; for a reversible chain this certifies an L² contraction factor at most (1+h/CPI)^{-N} over the N composed steps. The paper's stated isoperimetric bound CPI(µ_i) ≤ C∥Σ_i∥ log n (Section 1.1 and [Kla23]), together with Assumption 4.4 and Lemma 4.8, allows CPI(µ_i) as large as C n log n. Substituting the displayed h_i and N_i gives N_i h_i/CPI ≲ (r_i^{-2} n^3 log n) · r_i^2/(n^3 log^2 n) = O(1/log n), so the argument certifies only a spectral gap of order 1/log n, not 0.99. Therefore Lemma 4.5, which explicitly requires λ ≥ 0.99, cannot be applied as written, and the covariance estimates underlying Theorem 1.7 and the general case of Theorem 1.8 are not established. Increasing N_i by a polylog factor appears to repair this within the stated ~O bounds, but the current proof is incomplete.
  2. [§2.2.1, Lemma 2.8] The text extends [KVZ24, Lemma 22] from bounded to unbounded support in a single sentence, citing [Fol99, Theorem 8.15] for almost sure pointwise convergence of π*N(0,εI) to π. Pointwise convergence of the mollified density does not by itself establish the existence of the forward/backward heat-flow solutions on (0,h] or the lower-semicontinuity step lim_{t↓0} Rq(µ←_{h-t}∥πP_t) ≥ Rq(µ←_h∥π) that Lemma 2.9 needs on the unbounded epigraph K = {V ≤ nt}. Since Lemma 2.9 is the basis for the PS^exp mixing theorem (Theorem 2.15) and hence for the warm-start, rounding, and integration results, this extension should be proved in detail or replaced with a precise reference.
minor comments (4)
  1. [§4, Algorithm 4, Line 4] Line 4 uses the notation δ_{Z0} as the initial distribution although the preceding line only guarantees R∞(law(Z0)∥µ) ≤ log 2; the initial law should be written as law(Z0), not a point mass.
  2. [§3.2.2, Lemma 3.9] In the display labeled (v), the factor (1 − d_{σ²})^{-1} refers to a quantity d_{σ²} that is never defined; please define it or remove it.
  3. [§3.2.1, Lemma 3.3] The assertion that convex truncation of a strongly logconcave measure preserves the log-Sobolev constant is cited to [Wan13, Theorem 3.3.2]; since this is a nonsmooth setting, please state the quoted theorem explicitly and note that ar K is bounded, so no aspect-ratio dependence enters.
  4. [§2.2.2, Lemma 2.12] The notation K_δ for the δ-blow-up is defined in Lemma 2.12 but used earlier in Lemma 2.13 without a definition; add a sentence defining K_δ = {x : d(x,K) ≤ δ} before its first use.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the exponential reduction is verified by direct integration, and the complexity bounds are derived from stated isoperimetric constants and independent prior results rather than from fitted inputs or self-referential definitions.

full rationale

The paper's load-bearing claims are not circular. The reduction to the lifted exponential distribution is proved in Proposition 2.3 by directly integrating the t-coordinate, so the statement that the X-marginal equals exp(-V) is a derived identity, not an input assumption. The sampling complexity (Theorem 2.15) follows from the Proximal Sampler contraction in Lemma 2.9, which is based on the published [CCSW22] result, combined with the paper's own bounds on the lifted covariance (Lemma 2.5); no quantity is fitted from the data whose prediction is then reported. The warm-start and integration arguments use annealing schedules whose variance and R∞-closeness are proven from the explicit update rules and the external Bakry-Émery/Holley-Stroock and [Wan13] facts cited in Lemma 3.3; these are independent geometric inputs, not restatements of the target theorems. The integration estimator E_i = (1/m)Σ f_{i+1}(Z_i)/f_i(Z_i) has expectation F_{i+1}/F_i by the definition of conditional expectation, but this identity is the algorithm's estimator, not a disguised prediction. The rounding analysis cites self-authored prior work ([KZ24], [KVZ24], [KZ25]) for general covariance-estimation and uniform-ergodicity lemmas; those lemmas are stated with their own assumptions and have independent proofs, and the central claims do not reduce to those citations alone. The skeptical spectral-gap objection concerns the correctness of a constant-factor claim in Proposition 4.7; even if it were valid, it would be a quantitative error, not a circular reduction of a prediction to an input. No self-definitional, fitted-input-called-prediction, renaming, or uniqueness-imported-from-authors pattern was found.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The central claims rest on accepted theorems in logconcave geometry and on several recent co-authored results, KVZ24, KZ25, and KZ24. The paper introduces no physical entities; the lifted exponential distribution is an algorithmic construct, not a postulated object.

assumptions (6)
  • domain assumption The target density πX proportional to e^{-V} is logconcave, integrable, and V is accessible via an evaluation oracle; B1(x0) is contained in the ground set and Eπ||X||²≤R².
    Section 1.3 and Problem 2.1; the entire complexity model is defined by these oracle and regularity assumptions.
  • standard math Known isoperimetric bounds for logconcave measures: CPI(π) is O(L log n) where L is the largest eigenvalue of the covariance, and CLSI is O(D) for support diameter D.
    Used in Theorem 2.15 and Lemma 3.6 to convert Poincaré and log-Sobolev constants into mixing rate bounds.
  • standard math Functional inequalities: the Bakry-Émery criterion, the Holley-Stroock bounded perturbation principle, and convex truncation preserves the log-Sobolev constant.
    Lemma 3.3 and Section 3.2; the annealing measures have bounded LSI only if these properties hold with the stated constants.
  • standard math Logconcave geometry tools: reverse Hölder inequality, exponential tail bounds, Paouris theorem, and the technical lemmas A.6 through A.11 from Lovász-Vempala.
    Used throughout for covariance bounds, tail bounds, and lower regularity of level sets and grounded distributions.
  • standard math Heat-flow representation and uniform ergodicity estimates for the proximal kernel from KVZ24 and KZ25, including an extension to unbounded support.
    The contraction in Rényi divergence under PI and LSI is inherited from these results; the unbounded support extension is asserted in a remark rather than fully proved.
  • standard math Dependent-sample covariance estimation results of KZ24, Theorem 8, stating that a reversible chain with spectral gap 0.99 yields accurate covariance estimates.
    Used in Section 4.1 to justify covariance estimation with dependent samples; the source is an unpublished preprint by co-authors.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Sampling and Integration of Logconcave Functions by Algorithmic Diffusion." pith.science (2026). https://pith.science/paper/GW4USATJ

@misc{pith2026241113462,
  author       = {Pith},
  title        = {Pith review of: Sampling and Integration of Logconcave Functions by Algorithmic Diffusion},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GW4USATJ}},
  note         = {Machine review of arXiv:2411.13462}
}
read the original abstract

We study the complexity of sampling, rounding, and integrating arbitrary logconcave functions. Our new approach provides the first complexity improvements in nearly two decades for general logconcave functions for all three problems, and matches the best-known complexities for the special case of uniform distributions on convex bodies. For the sampling problem, our output guarantees are significantly stronger than previously known, and lead to a streamlined analysis of statistical estimation based on dependent random samples.

Figures

Figures reproduced from arXiv: 2411.13462 by the authors.

Figure 1.1
Figure 1.1. Reduction to an exponential distribution and sampling via the [PITH_FULL_IMAGE:figures/full_fig_p006_1_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Rapid Bayesian Computation and Estimation for Neural Networks via Log-Concave Coupling

    math.ST 2024-11 conditional novelty 5.0 of 10

    A neural-network posterior can be written as a log-concave mixture when the parameter count is large, making sampling tractable, with separate risk guarantees of N^{-1/4} and N^{-1/3} for a discrete-prior variant.

Reference graph

Works this paper leans on

42 extracted references · 38 canonical work pages · cited by 1 Pith paper

  1. [1]

    Sampling and integration of near log-concave functions

    David Applegate and Ravi Kannan. Sampling and integration of near log-concave functions. In Symposium on Theory of Computing (STOC) , pages 156--163, 1991

    work page 1991

  2. [2]

    Analysis and geometry of M arkov diffusion operators , volume 103

    Dominique Bakry, Ivan Gentil, and Michel Ledoux. Analysis and geometry of M arkov diffusion operators , volume 103. Springer, 2014

    2014

  3. [3]

    Improved analysis for a proximal algorithm for sampling

    Yongxin Chen, Sinho Chewi, Adil Salim, and Andre Wibisono. Improved analysis for a proximal algorithm for sampling. In Conference on Learning Theory (COLT) , pages 2984--3014. PMLR, 2022

    work page 2022

  4. [4]

    Analysis of L angevin Monte Carlo from P oincar \'e to l og-Sobolev

    Sinho Chewi, Murat A Erdogdu, Mufan Li, Ruoqi Shen, and Shunshi Zhang. Analysis of L angevin Monte Carlo from P oincar \'e to l og-Sobolev . In Conference on Learning Theory (COLT) , pages 1--2. PMLR, 2022

    work page 2022

  5. [5]

    Entropies, convexity, and functional inequalities, on -entropies and -sobolev inequalities

    Djalil Chafa \"i . Entropies, convexity, and functional inequalities, on -entropies and -sobolev inequalities. Journal of Mathematics of Kyoto University , 44(2):325--363, 2004

    work page 2004

  6. [6]

    Log-concave sampling

    Sinho Chewi. Log-concave sampling . Book draft available at https://chewisinho.github.io, 2024

    work page 2024

  7. [7]

    Gaussian C ooling and O^ * (n^3) algorithms for volume and G aussian volume

    Ben Cousins and Santosh S Vempala. Gaussian C ooling and O^ * (n^3) algorithms for volume and G aussian volume. SIAM Journal on Computing (SICOMP) , 47(3):1237--1273, 2018

    work page 2018

  8. [8]

    Convergence of distributions generated by stationary stochastic processes

    Yu A Davydov. Convergence of distributions generated by stationary stochastic processes. Theory of Probability & Its Applications , 13(4):691--696, 1968

    work page 1968

Show all 42 references
  1. [9]

    Mixing conditions for M arkov chains

    Yu A Davydov. Mixing conditions for M arkov chains. Theory of Probability & Its Applications , 18(2):312--328, 1974

    1974

  2. [10]

    A random polynomial-time algorithm for approximating the volume of convex bodies

    Martin Dyer, Alan Frieze, and Ravi Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM (JACM) , 38(1):1--17, 1991

    1991

  3. [11]

    On contraction properties of M arkov kernels

    Pierre Del Moral, Michel Ledoux, and Laurent Miclo. On contraction properties of M arkov kernels. Probability Theory and Related Fields , 126(3):395--420, 2003

    2003

  4. [12]

    Mixing: properties and examples , volume 85

    Paul Doukhan. Mixing: properties and examples , volume 85. Springer Science & Business Media, 2012

    2012

  5. [13]

    Real analysis: modern techniques and their applications , volume 40

    Gerald B Folland. Real analysis: modern techniques and their applications , volume 40. John Wiley & Sons, 1999

    1999

  6. [14]

    Logarithmic S obolev inequalities and stochastic I sing models

    Richard Holley and Daniel W Stroock. Logarithmic S obolev inequalities and stochastic I sing models. Journal of Statistical Physics , 46(5/6):1159--1194, 1987

    1987

  7. [15]

    Reducing isotropy and volume to KLS : an O^*(n^3 ^2) volume algorithm

    He Jia, Aditi Laddha, Yin Tat Lee, and Santosh S Vempala. Reducing isotropy and volume to KLS : an O^*(n^3 ^2) volume algorithm. In Symposium on Theory of Computing (STOC) , pages 961--974, 2021

    2021

  8. [16]

    Reducing isotropy and volume to KLS : F aster rounding and volume algorithms

    He Jia, Aditi Laddha, Yin Tat Lee, and Santosh S Vempala. Reducing isotropy and volume to KLS : F aster rounding and volume algorithms. arXiv preprint arXiv:2008.02146 , 2024

    2008 arXiv

  9. [17]

    Logarithmic bounds for isoperimetry and slices of convex sets

    Bo\'az Klartag. Logarithmic bounds for isoperimetry and slices of convex sets. Ars Inveniendi Analytica , 2023

    2023

  10. [18]

    Random walks and an O^*(n^5) volume algorithm for convex bodies

    Ravi Kannan, L \'a szl \'o Lov \'a sz, and Mikl \'o s Simonovits. Random walks and an O^*(n^5) volume algorithm for convex bodies. Random Structures & Algorithms (RS&A) , 11(1):1--50, 1997

    1997

  11. [19]

    Sampling with R iemannian H amiltonian M onte C arlo in a constrained space

    Yunbum Kook, Yin Tat Lee, Ruoqi Shen, and Santosh S Vempala. Sampling with R iemannian H amiltonian M onte C arlo in a constrained space. In Advances in Neural Information Processing Systems (NeurIPS) , volume 35, pages 31684--31696, 2022

    2022

  12. [20]

    On strong mixing conditions for stationary G aussian processes

    Andrei Nikolaevich Kolmogorov and Yu A Rozanov. On strong mixing conditions for stationary G aussian processes. Theory of Probability & Its Applications , 5(2):204--208, 1960

    1960

  13. [21]

    Simulated annealing for convex optimization

    Adam Tauman Kalai and Santosh S Vempala. Simulated annealing for convex optimization. Mathematics of Operations Research , 31(2):253--266, 2006

    2006

  14. [22]

    Gaussian cooling and D ikin walks: T he interior-point method for logconcave sampling

    Yunbum Kook and Santosh S Vempala. Gaussian cooling and D ikin walks: T he interior-point method for logconcave sampling. In Conference on Learning Theory (COLT) , pages 3137--3240. PMLR, 2024

    2024

  15. [23]

    In-and- O ut: A lgorithmic diffusion for sampling convex bodies

    Yunbum Kook, Santosh S Vempala, and Matthew S Zhang. In-and- O ut: A lgorithmic diffusion for sampling convex bodies. In To appear in Advances in Neural Information Processing Systems (NeurIPS) , 2024

    2024

  16. [24]

    Covariance estimation using M arkov chain M onte C arlo

    Yunbum Kook and Matthew S Zhang. Covariance estimation using M arkov chain M onte C arlo. arXiv preprint arXiv:2410.17147 , 2024

    2024 arXiv

  17. [25]

    R \'e nyi-infinity constrained sampling with d^3 membership queries

    Yunbum Kook and Matthew S Zhang. R \'e nyi-infinity constrained sampling with d^3 membership queries. In To appear in Symposium on Discrete Algorithms (SODA) , 2025

    2025

  18. [26]

    A simple analytic proof of an inequality by P

    Michel Ledoux. A simple analytic proof of an inequality by P . B user. Proceedings of the American Mathematical Society , 121(3):951--959, 1994

    1994

  19. [27]

    How to compute the volume? DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, 1991

    L \'a szl \'o Lov \'a sz. How to compute the volume? DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, 1991

    1991

  20. [28]

    The mixing rate of M arkov chains, an isoperimetric inequality, and computing the volume

    L \'a szl \'o Lov \'a sz and Mikl \'o s Simonovits. The mixing rate of M arkov chains, an isoperimetric inequality, and computing the volume. In Symposium on Foundations of Computer Science (FOCS) , pages 346--354. IEEE, 1990

    1990

  21. [29]

    Random walks in a convex body and an improved volume algorithm

    L \'a szl \'o Lov \'a sz and Mikl \'o s Simonovits. Random walks in a convex body and an improved volume algorithm. Random Structures & Algorithms (RS&A) , 4(4):359--412, 1993

    1993

  22. [30]

    Structured logconcave sampling with a restricted G aussian oracle

    Yin Tat Lee, Ruoqi Shen, and Kevin Tian. Structured logconcave sampling with a restricted G aussian oracle. In Conference on Learning Theory (COLT) , pages 2993--3050. PMLR, 2021

    2021

  23. [31]

    Fast algorithms for logconcave functions: S ampling, rounding, integration and optimization

    L \'a szl \'o Lov \'a sz and Santosh S Vempala. Fast algorithms for logconcave functions: S ampling, rounding, integration and optimization. In Symposium on Foundations of Computer Science (FOCS) , pages 57--68. IEEE, 2006

    2006

  24. [32]

    Hit-and-run from a corner

    L \'a szl \'o Lov \'a sz and Santosh S Vempala. Hit-and-run from a corner. SIAM Journal on Computing (SICOMP) , 35(4):985--1005, 2006

    2006

  25. [33]

    Simulated annealing in convex bodies and an O ^ * (n^ 4 ) volume algorithm

    L \'a szl \'o Lov \'a sz and Santosh S Vempala. Simulated annealing in convex bodies and an O ^ * (n^ 4 ) volume algorithm. Journal of Computer and System Sciences (JCSS) , 72(2):392--417, 2006

    2006

  26. [34]

    The geometry of logconcave functions and sampling algorithms

    L \'a szl \'o Lov \'a sz and Santosh S Vempala. The geometry of logconcave functions and sampling algorithms. Random Structures & Algorithms (RS&A) , 30(3):307--358, 2007

    2007

  27. [35]

    Eldan's stochastic localization and the KLS conjecture: I soperimetry, concentration and mixing

    Yin Tat Lee and Santosh S Vempala. Eldan's stochastic localization and the KLS conjecture: I soperimetry, concentration and mixing. Annals of Mathematics , 199(3):1043--1092, 2024

    2024

  28. [36]

    On the role of convexity in isoperimetry, spectral gap and concentration

    Emanuel Milman. On the role of convexity in isoperimetry, spectral gap and concentration. Inventiones Mathematicae , 177(1):1--43, 2009

    2009

  29. [37]

    Concentration of mass on convex bodies

    Grigoris Paouris. Concentration of mass on convex bodies. Geometric and Functional Analysis (GAFA) , 16(5):1021--1049, 2006

    2006

  30. [38]

    A central limit theorem and a strong mixing condition

    Murray Rosenblatt. A central limit theorem and a strong mixing condition. Proceedings of the National Academy of Sciences (PNAS) , 42(1):43--47, 1956

    1956

  31. [39]

    Study of a class of regularizations of 1/|x| using G aussian integrals

    Mary Beth Ruskai and Elisabeth Werner. Study of a class of regularizations of 1/|x| using G aussian integrals. SIAM Journal on Mathematical Analysis (SIMA) , 32(2):435--463, 2000

    2000

  32. [40]

    R \'e nyi divergence and K ullback- L eibler divergence

    Tim Van Erven and Peter Harremos. R \'e nyi divergence and K ullback- L eibler divergence. IEEE Transactions on Information Theory , 60(7):3797--3820, 2014

    2014

  33. [41]

    Rapid convergence of the unadjusted L angevin algorithm: I soperimetry suffices

    Santosh S Vempala and Andre Wibisono. Rapid convergence of the unadjusted L angevin algorithm: I soperimetry suffices. Advances in Neural Information Processing Systems (NeurIPS) , 32, 2019

    2019

  34. [42]

    Analysis for diffusion processes on R iemannian manifolds , volume 18

    Feng-Yu Wang. Analysis for diffusion processes on R iemannian manifolds , volume 18. World Scientific, 2013

    2013

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.