Beyond the $d^{2.5}$-mixing bound for Dikin walks on polytopes

Yunbum Kook

REVIEW 1 major objections 3 minor 204 references

Beyond the $d^{2.5}$-mixing bound for Dikin walks on polytopes

T0 review · 1 major / 3 minor · reviewed 2026-08-02 · deepseek-v4-flash

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

Pith's one-line read Dikin walks on polytopes now mix in d^2.25 iterations, improving the previous d^2.5 bound.

desk verdict The claimed d^{2.25} mixing bound relies on a factor-of-d error in Lemma 3.3; the proof as written recovers only the old d^{2.5}. read the letter →

arxiv 2607.13943 v1 pith:YUXVEBRV submitted 2026-07-15 cs.DS cs.LGmath.OC

Yunbum Kook This is my paper · ORCID

classification cs.DScs.LGmath.OC MSC 68W2060J2090C25

keywords averageself-concordanceDikinwalkLee-SidfordmetricLewisweightspolytopesamplingMarkovchainmixinginterior-pointmethodsWienerchaos

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 improves the warm-start mixing time of the Dikin walk for sampling from a polytope from O~(d^{2.5}) to O~(d^{2.25}) iterations, breaking a bound that had stood for about a decade and moving closer to the conjectured d^2. The engine is a sharper average self-concordance estimate for the Lee–Sidford metric: the unscaled metric now enjoys the required property at radius Θ~(d^{-1/8}) rather than the previously implicit d^{-1/4}, allowing the metric to be scaled by d^{1/4} instead of d^{1/2}. The improved estimate follows from a new higher-order calculus for Lewis weights, built from a moving orthonormal frame and a selective expansion of the few bottleneck terms, with the resulting Gaussian polynomials controlled by Wiener-chaos decompositions. A corollary improves the cold-start (no warm start) complexity from d^{23/8} to d^{41/16}.

What carries the argument

Average self-concordance (ASC) is the condition that a random Dikin proposal at radius r changes the squared local length, when measured at the proposal instead of the base point, by O(εr^2/d) with probability 1−ε; it is the property that keeps the Metropolis acceptance probability high. The paper proves ASC for the Lee–Sidford metric at radius d^{-1/8} by expanding the path function F(t) = h^T g0(x+th) h along a Gaussian direction h, but only through a recursively defined chain of bottleneck terms H_k(t) = q_t^T N_t^{(k−1)} v_t. The higher derivatives of the Lewis-weight matrix N_t are controlled via a moving orthonormal frame for the column space of a half of the metric, which removes irre

What would settle it

Compute the operator norms of N'''(t) along the Dikin proposal path for a concrete polytope with explicit Lewis weights, for instance the d-dimensional simplex or the hypercube, at the claimed radius d^{−1/8}. If ∥N'''∥ exceeds d^{3/2}·poly(d^{1/8}) for a nontrivial fraction of directions, the terminal term H_4 contributes more than O(ε) and the ASC radius d^{−1/8} fails; equivalently, simulate the fluctuation |F(η)−F(0)| at r = d^{−1/8} and check it exceeds the ASC threshold 2εr^2/d with probability larger than ε.

Watch

Extended reading notes

Core claim

The paper's central claim is that the unscaled Lee–Sidford metric satisfies average self-concordance at radius Θ~(d^{-1/8}): for any base point in the polytope, a random Dikin proposal at that radius changes the squared local length by at most 2εr^2/d with probability at least 1−ε. Scaling a metric by L multiplies the symmetry parameter by L while converting a radius-r proposal into a radius-r/√L proposal for the unscaled metric, so this ASC radius translates into constant-radius ASC for the d^{1/4}-scaled metric with symmetry parameter O~(d^{5/4}). Plugging these into the standard Dikin-walk mixing lemma yields the d^{9/4} warm-start iteration bound. The path to the sharper ASC radius runs

Load-bearing premise

The whole proof rests on the good-event estimates of Lemma 3.3: along a random proposal path of length η = r/√d, the coordinate-wise slack bounds stay O(1) and the first, second, and third derivatives of the Lewis-weight derivative matrix stay within O(d^{1/2}), O(d), and O(d^{3/2}) respectively, all on one event of probability 1−ε/20.

Editorial extensions

If this is right

Warm-start exponential sampling from any bounded full-dimensional polytope now runs in O~(d^{9/4}) Dikin-walk iterations, improving the previous O~(d^{5/2}) and shrinking the gap to the conjectured d^2.
Cold-start sampling via the annealing framework improves to O~(d^{41/16}) ≈ d^{2.56} iterations, the best known for this problem.
The sharper ASC radius for the unscaled Lee–Sidford metric is a stand-alone geometric fact: any future sampler whose analysis reduces to ASC will inherit this improvement.
The paper isolates the two estimates that remain to reach d^2—control of the j-th derivative of N_t pathwise and of the j-th base-point Gaussian polynomial for all j—and pushes both to j=3, making the remaining obstacle precise.
The higher-order Lewis-weight calculus (moving-frame derivatives up to third order and the Wiener-chaos tensor bounds) is reusable machinery for other barrier-based algorithms.

Reading between the lines

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

The recursion the paper exhibits suggests that if the pathwise estimate could be extended to ∥N_t^{(j)}∥ ≲ d^{j/2} and the base-point L2 estimate to ∥q^T N_x^{(j)} v_x∥_{L2} ≲ d^{(j+1)/2} for arbitrarily large j, the mixing time would approach d^{2+1/(j+1)}; reaching the exact d^2 likely needs a fundamentally different argument rather than longer expansions, since the j-terms grow with j.
The moving-frame calculus for Lewis weights may also benefit interior-point method analysis beyond sampling, where third- and higher-order barrier derivatives are typically avoided.
The cold-start exponent d^{41/16} emerges from a generic annealing schedule; a schedule tuned to the improved self-concordance constants could plausibly push it closer to d^{9/4}, the warm-start rate.
A natural test case for the sharper ASC radius is the d-dimensional simplex or hypercube, where the Lewis weights are explicit and the higher-order derivatives can be computed symbolically to verify the d^{-1/8} radius does not hide a larger constant.

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.

Desk Editor's Note

read the letter

Short version: the d^{2.25} claim does not survive contact with Lemma 3.3. There's an arithmetic error in the proof of that lemma—the bound on ∥Φ'''_t∥_F^2 is internally inconsistent with the paper's own equation (3.12)—and when you fix it, the bottleneck term H_4 contributes r^4 d instead of r^4 d^{1/2}, so the ASC radius drops to d^{-1/4} and you're back to the old d^{2.5} mixing. That said, the paper is not sloppy: it gives a clean framework, is candid about prior gaps in LLV20 and GKM+24, and the higher-order calculus and Wiener-chaos machinery are genuinely interesting. But the main theorem rests on this lemma, and the lemma is wrong as written.

The specifics: in the proof of Lemma 3.3, after deriving (3.12), ∥u'_{t,i}∥^2 ≲ d w_{t,i}, the paper bounds Σ_i ∥u'∥^6 / w_i^2 by d^3. But each term is ≲ (d w_i)^3 / w_i^2 = d^3 w_i, and Σ_i w_i = d (trace of the projection), so the sum is Θ(d^4). The same style of error affects the third sum if you use the natural row-wise second-derivative bound. Consequently ∥Φ'''∥_F ≲ d^2 rather than d^{3/2}, and through (3.7) ∥N'''_t∥ ≲ d^2. Then |H_4(t)| ≤ ∥q_t∥ ∥N'''_t∥ ∥v_t∥ ≲ d^{1/2} · d^2 · d^{1/2} = d^3, which enters (3.2) as η^4 d^3 = r^4 d. To keep this O(ε) you need r ≲ d^{-1/4}, which after scaling L ~ d^{1/2} gives exactly the old d^{2.5} bound. The d^{2.25} and d^{41/16} results do not follow.

The rest of the paper—Proposition 2.3, the bottleneck-chain decomposition, the MSI/Hermite estimates for H_2(0) and H_3(0)—looks careful, and I believe the framework could lead to a real improvement if the pathwise calculus can be repaired. But as it stands, the main technical contribution is unproven. I'd send it to review, because the problem matters and the author may be able to fix it. I would not cite it as a proven bound in the meantime.

Referee Report

1 major / 3 minor

Summary. The paper studies the Dikin walk for sampling from a bounded full-dimensional polytope with an exponential target distribution. It proves that, using the Lee–Sidford metric scaled by a factor L = Θ~(d^{1/4}), the Dikin walk mixes from a warm start in Θ~(d^{9/4} polylog m log(χ^2_0/ε)) iterations, improving the previous Θ~(d^{5/2}) bound and making progress toward the conjectured d^2 mixing time. The improvement rests on a sharper average self-concordance (ASC) estimate for the unscaled LS metric at radius r = Θ~(d^{-1/8}). The proof isolates a recursive bottleneck chain H_k, develops higher-order Lewis-weight calculus via a moving orthonormal frame, and controls the base-point Gaussian polynomials by Wiener-chaos decompositions and multiple stochastic integrals. A cold-start corollary gives d^{41/16} iterations.

Significance. If correct, this is the first improvement over the d^{2.5} bound of CDWY18 in nearly a decade, and a substantial step toward the d^2 conjecture. The technical machinery introduced—selective expansion of bottleneck terms, moving-frame higher-order calculus for Lewis weights, and MSI-based tensor-norm estimates for Gaussian polynomials—is likely to be useful for future analyses of Dikin-type walks. The proof is detailed and self-contained modulo the cited black boxes, and it is explicit about the remaining barriers to the d^2 conjecture. My independent checks of the exponent arithmetic, the scaling chain, and the main bottleneck estimates all pass.

major comments (1)

[§3.2 / Lemma 3.3] I explicitly checked the apparent inconsistency with (3.12) raised in the stress-test note. A termwise substitution of ||u'_i||^2 ≲ d w_i into Σ_i ||u'_i||^6 / w_i^2 would give d^4, but this ignores the global budget Σ_i ||u'_i||^2 = ||U'_t||_F^2 ≲ d. Writing x_i = ||u'_i||^2 / w_i, one has x_i ≲ d and Σ_i x_i w_i = ||U'_t||_F^2 ≲ d, so Σ_i ||u'_i||^6 / w_i^2 = Σ_i x_i^3 w_i ≲ d^2 Σ_i x_i w_i ≲ d^3. Hence the displayed bound ||Φ'''_t||_F^2 ≲ d^3 is consistent with (3.12), and consequently ||N'''_t|| ≲ d^{3/2} holds. The H4 bottleneck remains η^4 d^{5/2} = r^4 d^{1/2}, supporting the claimed r = Θ~(d^{-1/8}) ASC radius. The stress-test concern therefore does not land.

minor comments (3)

[§3, Proposition 3.1] The statement 'choose R_ε = Θ~(d^{-1/8})' is imprecise with respect to ε: the displayed condition R_ε + R_ε^2 + R_ε^4 d^{1/2} ≤ ε/polylog(m/ε) requires a constant factor ε^{1/4} in R_ε (i.e. R_ε = Θ~(ε^{1/4} d^{-1/8})). Since Theorem 1.1 uses a fixed ASC accuracy, this does not affect the main result, but the proposition should be stated precisely.
[§3.2–3.3] The notation B is overloaded: \widehat B_t = W_t^β A_t in Lemma 3.3, while B = W^{1/2}_x A_x in §3.3. These are different matrices and using the same letter in close proximity is confusing. Also P_t denotes both the original Lewis-weight projector and U_t U_t^T; a consistent renaming would improve readability.
[Lemma 3.3 proof] The bound on Σ_i ||u'_i||^6 / w_i^2 is compressed into a single chain. Adding the two-line argument with x_i = ||u'_i||^2/w_i and the global budget ||U'_t||_F^2 ≲ d would remove a likely source of confusion and preempt the apparent d^4 issue.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the new ASC radius and mixing bound are derived from internal estimates, not from fitted or self-defined targets.

full rationale

The paper's central claim, Theorem 1.1, is a genuine derivation: Proposition 3.1 proves an average self-concordance radius r = Θ~(d^{-1/8}) for the unscaled Lee-Sidford metric using an explicit selective expansion (Equation 3.2), pathwise estimates (Lemmas 3.3-3.4), and Gaussian-polynomial concentration via Wiener chaos. The bottleneck contribution η^4 d^{5/2} = r^4 d^{1/2} is computed from those estimates and directly determines the allowed radius, rather than being imposed to match the desired d^{2.25} bound. The mixing-time conclusion then follows by the standard scaling observation (Proposition 2.3) and the prior published mixing framework [KV24, Theorem 1], which is cited as external machinery and not redefined in terms of the result. The paper does not fit any parameter to a subset of data and then rename it a prediction; it does not invoke a uniqueness theorem from its own prior work; and it does not smuggle an ansatz through a self-citation. The skeptical concern about the ∥N'''_t∥ bound (whether it should be d^2 rather than d^{3/2}) is a potential proof error or computational gap in Lemma 3.3, not a circularity: it challenges whether the claimed estimates are true, but does not show that the conclusion is equivalent to an input by construction or to a self-citation chain. The derivation remains self-contained given its explicit assumptions and prior cited lemmas.

Assumptions & free parameters 3 free parameters · 7 assumptions · 0 invented entities

The paper's contribution is a proof, not a model: the only 'parameters' are existential scale constants (r, L, p) whose values are dictated by the analysis rather than fitted to data. All polytope and Lewis-weight geometry is inherited from prior work ([LS19], [LLV20]), and the mixing and annealing frameworks are imported from [KV24] as published facts. The genuinely new content is the ASC derivation chain (Lemma 3.3 and Section 3.3), which is where the load-bearing axioms concentrate. No new physical or mathematical entities are postulated; the bottleneck chain, moving frame, and chaos decompositions are bookkeeping devices.

free parameters (3)

Dikin radius r = Theta(1), any sufficiently small constant
Theorem 1.1 takes r as a sufficiently small Theta(1) radius; existence follows from the scaling argument of Proposition 2.3. An existential constant, not fitted to data.
Metric scaling factor L = C d^{1/4} polylog(md)
Chosen to convert the d^{-1/8} ASC radius of the unscaled metric into constant radius; it sets the symmetry parameter to d^{5/4} and hence the d^{9/4} mixing time. Determined by the proof, not fitted.
Lewis-weight exponent p = Theta(polylog m)
Taken as Theta(polylog m) throughout; all polylog(m) factors are suppressed in the O-tilde notation. A design choice inherited from Lee-Sidford theory, not fitted.

assumptions (7)

domain assumption Lewis-weight calculus of [LS19] (Lemmas 2.4-2.7): derivative formula W'_x,h = -Diag(W^{1/2} N W^{1/2} s), the closeness bound (Lemma 2.7), and the N-matrix bounds (Lemma 2.6)
The foundational toolkit for Dikin-walk-with-Lewis-weights analysis; taken as prior literature, not re-proven.
domain assumption SSC, LTSC, and bar-nu = O~(d) symmetry of the standard LS metric, equivalently containment D_g(x,1) subset of K for radius-1 Dikin proposals
Inherited from [LLV20, Lemmas 4.2 and 4.3]; used to keep the proposal path inside K (Lemma 3.3) and to apply the mixing theorem. Prior published result.
domain assumption Mixing framework of [KV24] (Lemma 2.2: SSC + LTSC + ASC + bar-nu-symmetric implies O(d bar-nu) warm-start mixing) and the annealing framework of [KV24, Theorem 2] for cold starts
Used as black boxes. The author is a co-author of [KV24], so this is a self-citation, but the framework is an independently published theorem and the new ASC work is an input to it, not derived from it.
standard math Gaussian polynomial concentration (Lemma 3.2): P(|P(h)| >= t ||P||_{L2}) <= exp(- n t^{2/n} / 2e)
Stated and used to convert L2 bounds on base-point Gaussian polynomials into high-probability bounds.
standard math Wiener chaos / multiple stochastic integral facts from [Nua06]: isometry (3.13), product formula (Lemma 3.7), chaos expansion (Theorem 3.8), and tensor-MSI lemmas 3.9-3.12
The formal backbone of Sections 3.3.3-3.3.4 for computing L2 norms of quartic and quintic Gaussian polynomials; imported from the cited monograph.
standard math Existence of a smooth orthonormal frame with U^T U' = 0 via a matrix ODE (Lemma B.2) and its multi-parameter analogue (Lemma B.3)
Underpins the moving-frame calculus and hence all higher-derivative bounds on N_t in Lemma 3.3. Elementary differential-geometric linear algebra, but it is the least battle-tested new ingredient and is acknowledged as LLM-assisted.
domain assumption Path containment: for good directions, the segment x + t h stays in int K for t in [0, eta]
Guaranteed via bar-nu-symmetry (Dikin ellipsoid of radius 1 inside K) once r is small enough; used throughout Lemma 3.3 to differentiate Lewis weights along the path.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Beyond the $d^{2.5}$-mixing bound for Dikin walks on polytopes." pith.science (2026). https://pith.science/paper/YUXVEBRV

@misc{pith2026260713943,
  author       = {Pith},
  title        = {Pith review of: Beyond the $d^2.5$-mixing bound for Dikin walks on polytopes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YUXVEBRV}},
  note         = {Machine review of arXiv:2607.13943}
}

abstract

Inspired by interior-point methods (IPM) for structured convex optimization, Kannan and Narayanan introduced the Dikin walk for sampling uniformly from polytopes in 2009. As in IPMs, the Dikin walk is affine-invariant, and its convergence is governed by the barrier geometry used to define its local proposal. They showed that the Dikin walk with the logarithmic barrier for a polytope in $\mathbb{R}^{d}$ with $m$ linear inequalities mixes in $md$ iterations. In 2017, Chen, Dwivedi, Wainwright, and Yu improved this to $d^{2.5}$ using a Lewis-weight barrier, and conjectured that the correct mixing time should be $d^{2}$. We make progress toward this conjecture by improving the previous $d^{2.5}$-mixing bound. For exponential sampling over a polytope, we prove that the Dikin walk with a scaled Lee--Sidford metric mixes from a warm start in $d^{2.25}$ iterations. This also yields an improved cold-start complexity via a known annealing framework. The main technical ingredient is improved average self-concordance of the Lee--Sidford metric, which gives high acceptance probability for the Metropolis filter along a random Dikin proposal. While previous analyses were effectively limited to second-order control due to technical difficulties, we develop a principled higher-order analysis. The proof combines a selective higher-order expansion of recursive bottleneck terms, a moving orthonormal-frame calculus for higher derivatives of the Lewis weights, and Wiener-chaos decompositions via multiple stochastic integrals to control the resulting Gaussian polynomials.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

204 extracted references · 56 canonical work pages

[1]

, title =

Vempala, Santosh S. , title =
[2]

Random walks on polytopes and an affine interior point method for linear programming , year =

Kannan, Ravi and Narayanan, Hariharan , booktitle =. Random walks on polytopes and an affine interior point method for linear programming , year =
[3]

Path finding methods for linear programming: solving linear programs in

Yin Tat Lee and Aaron Sidford , booktitle =. Path finding methods for linear programming: solving linear programs in
[4]

Self-concordant functions and polynomial time methods in convex programming

Nesterov, Yurii and Nemirovskii, Arkadii , journal =. Self-concordant functions and polynomial time methods in convex programming. preprint, central economic & mathematical institute, ussr acad , volume =
[5]

Iterative solution of problems of linear and quadratic programming , volume =

Dikin, Iliya Iosiphovich , booktitle =. Iterative solution of problems of linear and quadratic programming , volume =
[6]

A polynomial-time algorithm, based on

Renegar, James , journal =. A polynomial-time algorithm, based on
[7]

A new polynomial-time algorithm for linear programming , year =

Karmarkar, Narendra , booktitle =. A new polynomial-time algorithm for linear programming , year =
[8]

and Johnson, Alan W

Henderson, Darrall and Jacobson, Sheldon H. and Johnson, Alan W. , pages =. The theory and practice of simulated annealing , year =

Show all 204 references

[9]

Daniel and Vecchi, Mario P

Kirkpatrick, Scott and Gelatt Jr, C. Daniel and Vecchi, Mario P. , journal =. Optimization by simulated annealing , volume =
[10]

Pierre-Antoine Absil and Robert Mahony and Rodolphe Sepulchre , publisher =
[11]

Malliavin calculus and normal approximations , year =

Nualart, David , publisher =. Malliavin calculus and normal approximations , year =
[12]

Nualart, David , date-added =. The
[14]

High-Dimensional Probability: An Introduction with Applications in Data Science , url =

Vershynin, Roman , date-added =. High-Dimensional Probability: An Introduction with Applications in Data Science , url =. 2018 , bdsk-url-1 =. doi:10.1017/9781108231596 , isbn =

2018 doi
[15]

Introductory Lectures on Convex Optimization , url =

Nesterov, Yurii , date-added =. Introductory Lectures on Convex Optimization , url =. Applied Optimization , publisher =. 2004 , bdsk-url-1 =. doi:10.1007/978-1-4419-8853-9 , isbn =

2004 doi
[16]

Mirrored

Hsieh, Ya-Ping and Kavis, Ali and Rolland, Paul and Cevher, Volkan , booktitle =. Mirrored. 2018 , bdsk-url-1 =

2018
[17]

Functional Stochastic Localization , year =

Anming Gu and Bobby Shi and Kevin Tian , date-added =. Functional Stochastic Localization , year =. arXiv preprint arXiv:2602.03999 , keywords =
[18]

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified

Gu, Yuzhou and Kuang, Nikki Lijing and Ma, Yi-An and Song, Zhao and Zhang, Lichen , booktitle =. Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified. 2024 , bdsk-url-1 =. doi:10.52202/079017-2212 , pages =

2024 doi
[19]

, booktitle =

Mangoubi, Oren and Vishnoi, Nisheeth K. , booktitle =. Sampling from Structured Log-Concave Distributions via a Soft-Threshold. 2023 , bdsk-url-1 =

2023
[20]

arXiv preprint arXiv:1910.08033 , title =

Lee, Yin Tat and Sidford, Aaron , date-added =. arXiv preprint arXiv:1910.08033 , title =

1910 arXiv
[21]

and Chewi, Sinho and Erdogdu, Murat A

Kook, Yunbum and Zhang, Matthew S. and Chewi, Sinho and Erdogdu, Murat A. and Li, Mufan (Bill) , booktitle =. Sampling from the mean-field stationary distribution , url =. 2024 , bdsk-url-1 =

2024
[22]

Tyrrell , date-added =

Rockafellar, R. Tyrrell , date-added =. Monotone Operators and the Proximal Point Algorithm , url =. SIAM Journal on Control and Optimization , number =. 1976 , bdsk-url-1 =. doi:10.1137/0314056 , eprint =

1976 doi
[23]

Understanding

Ahn, Kwangjun and Zhang, Zhiyu and Kook, Yunbum and Dai, Yan , booktitle =. Understanding. 2024 , bdsk-url-1 =

2024
[24]

Affirmative resolution of

Klartag, Bo'az and Lehec, Joseph , date-added =. Affirmative resolution of. Geometric and Functional Analysis , mrclass =. 2025 , bdsk-url-1 =. doi:10.1007/s00039-025-00718-w , fjournal =

2025 doi
[25]

, date-added =

Vaidya, Pravin M. , date-added =. A new algorithm for minimizing convex functions over convex sets , url =. Mathematical Programming , mrclass =. 1996 , bdsk-url-1 =. doi:10.1016/0025-5610(92)00021-S , fjournal =

1996 doi
[26]

Isoperimetric inequalities in high-dimensional convex sets , url =

Klartag, Bo'az and Lehec, Joseph , date-added =. Isoperimetric inequalities in high-dimensional convex sets , url =. Bulletin of the American Mathematical Society , mrclass =. 2025 , bdsk-url-1 =. doi:10.1090/bull/1869 , fjournal =

2025 doi
[27]

Regularized

Jiang, Minhui and Chen, Yuansi , booktitle =. Regularized. 2025 , bdsk-url-1 =

2025
[28]

Mixing time of the proximal sampler in relative

Wibisono, Andre , booktitle =. Mixing time of the proximal sampler in relative. 2025 , bdsk-url-1 =

2025
[29]

Tyrrell , date-added =

Rockafellar, R. Tyrrell , date-added =. Convex analysis , year =
[30]

Lectures on Convex Optimization , url =

Nesterov, Yurii , date-added =. Lectures on Convex Optimization , url =. Springer Optimization and Its Applications , publisher =. 2018 , bdsk-url-1 =. doi:10.1007/978-3-319-91578-4 , isbn =

2018 doi
[31]

, date-added =

Nesterov, Yurii and Todd, Michael J. , date-added =. On the. Foundations of Computational Mathematics , month = oct, number =. 2002 , bdsk-url-1 =. doi:10.1007/s102080010032 , issn =

2002 doi
[32]

Interior-point polynomial algorithms in convex programming , url =

Nesterov, Yurii and Nemirovskii, Arkadii , date-added =. Interior-point polynomial algorithms in convex programming , url =. 1994 , bdsk-url-1 =. doi:10.1137/1.9781611970791 , isbn =

1994 doi
[33]

and Neudecker, Heinz , date-added =

Magnus, Jan R. and Neudecker, Heinz , date-added =. The elimination matrix: some lemmas and applications , url =. SIAM Journal on Algebraic Discrete Methods , month = dec, number =. 1980 , bdsk-url-1 =. doi:10.1137/0601049 , issn =

1980 doi
[34]

Universal barrier is n -self-concordant , url =

Lee, Yin Tat and Yue, Man--Chung , date-added =. Universal barrier is n -self-concordant , url =. Mathematics of Operations Research , month = aug, number =. 2021 , bdsk-url-1 =. doi:10.1287/moor.2020.1113 , fjournal =

2021
[35]

, date-added =

Lee, Yin Tat and Vempala, Santosh S. , date-added =. Geodesic. SIAM Journal on Computing , month = apr, number =. 2022 , bdsk-url-1 =. doi:10.1137/17m1145999 , issn =

2022 doi
[36]

Powers of tensors and fast matrix multiplication , url =

Le Gall, Fran. Powers of tensors and fast matrix multiplication , url =. International Symposium on Symbolic and Algebraic Computation , collection =. 2014 , bdsk-url-1 =. doi:10.1145/2608628.2608664 , month = jul, pages =

2014
[37]

Hyperbolic polynomials and interior point methods for convex programming , url =

G. Hyperbolic polynomials and interior point methods for convex programming , url =. Mathematics of Operations Research , month = may, number =. 1997 , bdsk-url-1 =. doi:10.1287/moor.22.2.350 , fjournal =

1997 doi
[38]

The entropic barrier is n -self-concordant , url =

Chewi, Sinho , booktitle =. The entropic barrier is n -self-concordant , url =. 2023 , bdsk-url-1 =. doi:10.1007/978-3-031-26300-2_6 , isbn =

2023 doi
[39]

The entropic barrier: a simple and optimal universal self-concordant barrier , url =

Bubeck, S\'ebastien and Eldan, Ronen , booktitle =. The entropic barrier: a simple and optimal universal self-concordant barrier , url =. 2015 , bdsk-url-1 =

2015
[40]

, date-added =

Anstreicher, Kurt M. , date-added =. Volumetric path following algorithms for linear programming , url =. Mathematical Programming , month =. 1997 , bdsk-url-1 =. doi:10.1007/BF02614386 , issn =

1997 doi
[41]

Jia, He and Laddha, Aditi and Lee, Yin Tat and Vempala, Santosh , title =. J. ACM , month = apr, articleno =. 2026 , issue_date =. doi:10.1145/3795687 , abstract =

2026 doi
[42]

and Zhang, Matthew S

Kook, Yunbum and Vempala, Santosh S. and Zhang, Matthew S. , date-added =. In-and-. Random Structures & Algorithms , number =. 2026 , bdsk-url-1 =. doi:https://doi.org/10.1002/rsa.70061 , eprint =

2026 doi
[43]

, date-added =

Kook, Yunbum and Vempala, Santosh S. , date-added =. The localization method for high-dimensional inequalities , year =. arXiv preprint arXiv:2512.10848 , keywords =
[44]

, booktitle =

Kook, Yunbum and Vempala, Santosh S. , booktitle =. Faster logconcave sampling from a cold start in high dimension , year =. doi:10.1109/FOCS63196.2025.00052 , pages =

2025
[45]

Hit-and-run mixing via localization schemes , url =

Chen, Yuansi and Eldan, Ronen , date-added =. Hit-and-run mixing via localization schemes , url =. Discrete & Computational Geometry , month =. 2025 , bdsk-url-1 =. doi:10.1007/s00454-025-00808-4 , issn =

2025 doi
[46]

On the log-

Bizeul, Pierre , date-added =. On the log-. Journal of Functional Analysis , month = may, number =. 2026 , bdsk-url-1 =. doi:10.1016/j.jfa.2026.111368 , issn =

2026
[47]

, booktitle =

Laddha, Aditi and Lee, Yin Tat and Vempala, Santosh S. , booktitle =. Strong self-concordance and sampling , url =. 2020 , bdsk-url-1 =. doi:10.1145/3357713.3384272 , month = jun, pages =

2020
[48]

Localization schemes: a framework for proving mixing bounds for

Chen, Yuansi and Eldan, Ronen , booktitle =. Localization schemes: a framework for proving mixing bounds for
[49]

Sampling from the

El Alaoui, Ahmed and Montanari, Andrea and Sellke, Mark , booktitle =. Sampling from the
[50]

An information-theoretic view of stochastic localization , url =

El Alaoui, Ahmed and Montanari, Andrea , date-added =. An information-theoretic view of stochastic localization , url =. IEEE Transactions on Information Theory , mrclass =. 2022 , bdsk-url-1 =. doi:10.1109/tit.2022.3180298 , fjournal =

2022
[51]

The isotropic constant in the theory of high-dimensional convex bodies , year =

Giannopoulos, Apostolos and Pafis, Minas and Tziotziou, Natalia , date-added =. The isotropic constant in the theory of high-dimensional convex bodies , year =. To appear in Bull. Amer. Math. Soc. , keywords =
[52]

Geometry of isotropic convex bodies , url =

Brazitikos, Silouanos and Giannopoulos, Apostolos and Valettas, Petros and Vritsiou, Beatrice-Helen , date-added =. Geometry of isotropic convex bodies , url =. 2014 , bdsk-url-1 =. doi:10.1090/surv/196 , isbn =

2014 doi
[53]

Convex measures on locally convex spaces , url =

Borell, Christer , date =. Convex measures on locally convex spaces , url =. Arkiv f. 1974 , bdsk-url-1 =. doi:10.1007/BF02384761 , id =

1974 doi
[54]

Klartag, Bo'az , date-added =. On. Lecture notes prepared for a winter school at the
[55]

, booktitle =

Klartag, Bo'az and Milman, Vitali D. , booktitle =. The slicing problem by. 2022 , bdsk-url-1 =. doi:10.1007/978-3-031-05331-3\_9 , isbn =

2022 doi
[56]

Fast Tensor Completion via Approximate

Ghadiri, Mehrdad and Fahrbach, Matthew and Kook, Yunbum and Jadbabaie, Ali , booktitle =. Fast Tensor Completion via Approximate. 2025 , bdsk-url-1 =

2025
[57]

A convex/log-concave correlation inequality for

Harg\'e, Gilles , date-added =. A convex/log-concave correlation inequality for. Probability Theory and Related Fields , mrclass =. 2004 , bdsk-url-1 =. doi:10.1007/s00440-004-0365-8 , fjournal =

2004 doi
[58]

Thin-shell bounds via parallel coupling , year =

Klartag, Bo'az and Lehec, Joseph , date-added =. Thin-shell bounds via parallel coupling , year =. arXiv preprint arXiv:2507.15495 , keywords =
[59]

Stam, A. J. , date-added =. Some inequalities satisfied by the quantities of information of. Information and Control , mrclass =
[60]

arXiv preprint arXiv:2507.18021 , keywords =

Zeroth-order Logconcave Sampling , url =. arXiv preprint arXiv:2507.18021 , keywords =. doi:10.48550/arXiv.2507.18021 , eprint =

doi
[61]

, booktitle =

Kook, Yunbum and Vempala, Santosh S. , booktitle =. Sampling and integration of logconcave functions by algorithmic diffusion , url =. 2025 , bdsk-url-1 =. doi:10.1145/3717823.3718202 , isbn =

2025
[62]

On a class of

Yuan, Bo and Fan, Jiaojiao and Liang, Jiaming and Wibisono, Andre and Chen, Yongxin , booktitle =. On a class of. 2023 , bdsk-url-1 =

2023
[63]

Optimal transport , url =

Villani, C\'edric , date-added =. Optimal transport , url =. 2009 , bdsk-url-1 =. doi:10.1007/978-3-540-71050-9 , isbn =

2009 doi
[64]

, booktitle =

Vempala, Santosh S. , booktitle =. Geometric random walks: a survey , volume =
[65]

Liu, Yuan , date-added =. The. Electronic Journal of Probability , mrclass =. 2020 , bdsk-url-1 =. doi:10.1214/19-ejp403 , fjournal =

2020 doi
[66]

Blocking conductance and mixing in random walks , url =

Kannan, Ravi and Lov\'. Blocking conductance and mixing in random walks , url =. Combinatorics, Probability and Computing , mrclass =. 2006 , bdsk-url-1 =. doi:10.1017/S0963548306007504 , fjournal =

2006 doi
[67]

Analysis of

Durmus, Alain and Majewski, Szymon and Miasojedow, B. Analysis of. Journal of Machine Learning Research , mrclass =
[68]

and Tsybakov, Alexandre B

Dalalyan, Arnak S. and Tsybakov, Alexandre B. , date-added =. Sparse regression learning by aggregation and. Journal of Computer and System Sciences , mrclass =. 2012 , bdsk-url-1 =. doi:10.1016/j.jcss.2011.12.023 , fjournal =

2012 doi
[69]

Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent , url =

Dalalyan, Arnak , booktitle =. Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent , url =. 2017 , bdsk-url-1 =

2017
[70]

Heat flow and a faster algorithm to compute the surface area of a convex body , url =

Belkin, Mikhail and Narayanan, Hariharan and Niyogi, Partha , date-added =. Heat flow and a faster algorithm to compute the surface area of a convex body , url =. Random Structures & Algorithms , mrclass =. 2013 , bdsk-url-1 =. doi:10.1002/rsa.20513 , fjournal =

2013 doi
[71]

Gradient flows in metric spaces and in the space of probability measures , year =

Ambrosio, Luigi and Gigli, Nicola and Savar\'e, Giuseppe , date-added =. Gradient flows in metric spaces and in the space of probability measures , year =
[72]

A note on the spectral gap for log-concave probability measures on convex bodies , url =

Bonnefont, Michel and Joulin, Ald\'eric , date-added =. A note on the spectral gap for log-concave probability measures on convex bodies , url =. International Mathematics Research Notices , mrclass =. 2024 , bdsk-url-1 =. doi:10.1093/imrn/rnae256 , fjournal =

2024 doi
[73]

Klartag, Bo'az , date-added =. A. Probability Theory and Related Fields , mrclass =. 2009 , bdsk-url-1 =. doi:10.1007/s00440-008-0158-6 , fjournal =

2009 doi
[74]

Probability in high dimension , volume =

Van Handel, Ramon , date-added =. Probability in high dimension , volume =. Lecture Notes (Princeton University) , number =
[75]

Logarithmic

Gross, Leonard , date-added =. Logarithmic. American Journal of Mathematics , mrclass =. 1975 , bdsk-url-1 =. doi:10.2307/2373688 , fjournal =

1975 doi
[76]

Polyrun: a

Krzysztof Ciomek and Mi. Polyrun: a. SoftwareX , pages =. 2021 , bdsk-url-1 =. doi:https://doi.org/10.1016/j.softx.2021.100659 , issn =

2021
[77]

Andy Yu Zhu Yao and David Kane , date-added =. walkr:. 2017 , bdsk-url-1 =. doi:10.21105/joss.00061 , journal =

2017 doi
[78]

volesti: volume approximation and sampling for convex polytopes in

Chalkis, Apostolos and Fisikopoulos, Vissarion , date-added =. volesti: volume approximation and sampling for convex polytopes in. The R Journal , pages =
[79]

arXiv preprint arXiv:2412.06629 , keywords =

Sun, Benny and Chen, Yuansi , date-added =. arXiv preprint arXiv:2412.06629 , keywords =

arXiv
[80]

, booktitle =

Kook, Yunbum and Lee, Yin Tat and Shen, Ruoqi and Vempala, Santosh S. , booktitle =. Condition-number-independent convergence rate of. 2023 , bdsk-url-1 =

2023
[81]

John's walk , url =

Gustafson, Adam and Narayanan, Hariharan , date-added =. John's walk , url =. Advances in Applied Probability , mrclass =. 2023 , bdsk-url-1 =. doi:10.1017/apr.2022.34 , fjournal =

2023 doi
[82]

Randomized interior point methods for sampling and optimization , url =

Narayanan, Hariharan , date-added =. Randomized interior point methods for sampling and optimization , url =. The Annals of Applied Probability , mrclass =. 2016 , bdsk-url-1 =. doi:10.1214/15-AAP1104 , fjournal =

2016 doi
[83]

A geometric inequality and the complexity of computing volume , url =

Elekes, Gy\"orgy , date-added =. A geometric inequality and the complexity of computing volume , url =. Discrete & Computational Geometry , mrclass =. 1986 , bdsk-url-1 =. doi:10.1007/BF02187701 , fjournal =

1986 doi
[84]

Computing the volume is difficult , url =

B\'ar\'any, Imre and F\"uredi, Zolt\'an , date-added =. Computing the volume is difficult , url =. Discrete & Computational Geometry , mrclass =. 1987 , bdsk-url-1 =. doi:10.1007/BF02187886 , fjournal =

1987 doi
[85]

On the _0 isoperimetric coefficient of measurable sets , year =

Fernandez, Manuel V , date-added =. On the _0 isoperimetric coefficient of measurable sets , year =. arXiv preprint arXiv:2312.00015 , keywords =

arXiv
[86]

Sampling from convex sets with a cold start using multiscale decompositions , url =

Narayanan, Hariharan and Rajaraman, Amit and Srivastava, Piyush , date-added =. Sampling from convex sets with a cold start using multiscale decompositions , url =. Probability Theory and Related Fields , mrclass =. 2025 , bdsk-url-1 =. doi:10.1007/s00440-024-01341-w , fjournal =

2025 doi
[87]

On the mixing time of coordinate

Narayanan, Hariharan and Srivastava, Piyush , date-added =. On the mixing time of coordinate. Combinatorics, Probability and Computing , mrclass =. 2022 , bdsk-url-1 =. doi:10.1017/s0963548321000328 , fjournal =

2022 doi
[88]

, date-added =

Laddha, Aditi and Vempala, Santosh S. , date-added =. Convergence of. Discrete & Computational Geometry , mrclass =. 2023 , bdsk-url-1 =. doi:10.1007/s00454-023-00497-x , fjournal =

2023 doi
[89]

, date-added =

Gromov, Mikhael and Milman, Vitali D. , date-added =. A topological application of the isoperimetric inequality , url =. American Journal of Mathematics , mrclass =. 1983 , bdsk-url-1 =. doi:10.2307/2374298 , fjournal =

1983 doi
[90]

and Utev, Sergey A

Borovkov, Aleksandr A. and Utev, Sergey A. , date-added =. An inequality and a characterization of the normal distribution connected with it , volume =. Teoriya Veroyatnoste i\ i ee Primeneniya , mrclass =
[91]

, date-added =

Bobkov, Sergey G. , date-added =. Isoperimetric and analytic inequalities for log-concave probability measures , url =. The Annals of Probability , mrclass =. 1999 , bdsk-url-1 =. doi:10.1214/aop/1022874820 , fjournal =

1999
[92]

When does

Chen, Yuansi and Gatmiry, Khashayar , date-added =. When does. arXiv preprint arXiv:2304.04724 , keywords =
[93]

A simple proof of the mixing of

Chen, Yuansi and Gatmiry, Khashayar , date-added =. A simple proof of the mixing of. arXiv preprint arXiv:2304.04095 , keywords =

arXiv
[94]

and Yu, Bin , date-added =

Chen, Yuansi and Dwivedi, Raaz and Wainwright, Martin J. and Yu, Bin , date-added =. Fast mixing of metropolized. Journal of Machine Learning Research , mrclass =
[95]

Log-concave sampling , year =

Chewi, Sinho , date-added =. Log-concave sampling , year =
[96]

, date-added =

Chen, Zongchen and Vempala, Santosh S. , date-added =. Optimal convergence rate of. Theory of Computing , mrclass =
[97]

Minimax mixing time of the metropolis-adjusted

Wu, Keru and Schmidler, Scott and Chen, Yuansi , date-added =. Minimax mixing time of the metropolis-adjusted. Journal of Machine Learning Research , mrclass =
[98]

Penalized overdamped and underdamped

G\"urb\"uzbalaban, Mert and Hu, Yuanhan and Zhu, Lingjiong , date-added =. Penalized overdamped and underdamped. Journal of Machine Learning Research , mrclass =
[99]

Lehec, Joseph , date-added =. The. The Annals of Applied Probability , mrclass =. 2023 , bdsk-url-1 =. doi:10.1214/23-aap1935 , fjournal =

2023 doi
[100]

Sampling from a log-concave distribution with projected

Bubeck, S\'ebastien and Eldan, Ronen and Lehec, Joseph , date-added =. Sampling from a log-concave distribution with projected. Discrete & Computational Geometry , mrclass =. 2018 , bdsk-url-1 =. doi:10.1007/s00454-018-9992-1 , fjournal =

2018 doi
[101]

High-accuracy sampling from constrained spaces with the

Srinivasan, Vishwak and Wibisono, Andre and Wilson, Ashia , booktitle =. High-accuracy sampling from constrained spaces with the. 2025 , bdsk-url-1 =

2025
[102]

Fast sampling from constrained spaces using the

Srinivasan, Vishwak and Wibisono, Andre and Wilson, Ashia , booktitle =. Fast sampling from constrained spaces using the. 2024 , bdsk-url-1 =

2024
[103]

and Wibisono, Andre , booktitle =

Li, Ruilin and Tao, Molei and Vempala, Santosh S. and Wibisono, Andre , booktitle =. The mirror. 2022 , bdsk-url-1 =

2022
[104]

Efficient constrained sampling via the mirror-

Ahn, Kwangjun and Chewi, Sinho , booktitle =. Efficient constrained sampling via the mirror-. 2021 , bdsk-url-1 =

2021
[105]

Jiang, Qijia , booktitle =. Mirror. 2021 , bdsk-url-1 =

2021
[106]

Wasserstein control of mirror

Zhang, Kelvin Shuangjian and Peyr\'e, Gabriel and Fadili, Jalal and Pereyra, Marcelo , booktitle =. Wasserstein control of mirror. 2020 , bdsk-url-1 =

2020
[107]

, booktitle =

Gatmiry, Khashayar and Kelner, Jonathan and Vempala, Santosh S. , booktitle =. Sampling polytopes with. 2024 , bdsk-url-1 =

2024
[108]

, date-added =

Li, Mufan and Erdogdu, Murat A. , date-added =. Riemannian. Bernoulli , mrclass =. 2023 , bdsk-url-1 =. doi:10.3150/22-bej1576 , fjournal =

2023 doi
[109]

, booktitle =

Lee, Yin Tat and Vempala, Santosh S. , booktitle =. Convergence rate of. 2018 , bdsk-url-1 =. doi:10.1145/3188745.3188774 , isbn =

2018
[110]

Riemann manifold

Girolami, Mark and Calderhead, Ben , date-added =. Riemann manifold. Journal of the Royal Statistical Society. Series B. Statistical Methodology , mrclass =. 2011 , bdsk-url-1 =. doi:10.1111/j.1467-9868.2010.00765.x , fjournal =

2011
[111]

Algorithmic aspects of the log-

Gopi, Sivakanth and Lee, Yin Tat and Liu, Daogao and Shen, Ruoqi and Tian, Kevin , booktitle =. Algorithmic aspects of the log-. 2023 , bdsk-url-1 =

2023
[112]

and Yu, Bin , date-added =

Chen, Yuansi and Dwivedi, Raaz and Wainwright, Martin J. and Yu, Bin , date-added =. Fast. Journal of Machine Learning Research , mrclass =
[113]

, date-added =

Sachdeva, Sushant and Vishnoi, Nisheeth K. , date-added =. The mixing time of the. Operations Research Letters , mrclass =. 2016 , bdsk-url-1 =. doi:10.1016/j.orl.2016.07.005 , fjournal =

2016 doi
[114]

Random walks on polytopes and an affine interior point method for linear programming , url =

Kannan, Ravi and Narayanan, Hariharan , date-added =. Random walks on polytopes and an affine interior point method for linear programming , url =. Mathematics of Operations Research , mrclass =. 2012 , bdsk-url-1 =. doi:10.1287/moor.1110.0519 , fjournal =

2012 arXiv
[115]

, date-added =

Kook, Yunbum and Zhang, Matthew S. , date-added =. Covariance estimation using. arXiv preprint arXiv:2410.17147 , keywords =

arXiv
[116]

Log-concave sampling on compact supports: a versatile proximal framework , year =

Yu, Lu , date-added =. Log-concave sampling on compact supports: a versatile proximal framework , year =. arXiv preprint arXiv:2405.15379 , keywords =

arXiv
[117]

and Chewi, Sinho , date-added =

Altschuler, Jason M. and Chewi, Sinho , date-added =. Faster high-accuracy log-concave sampling via algorithmic warm starts , volume =. Journal of the ACM , mrclass =
[118]

Optimal dimension dependence of the

Chewi, Sinho and Lu, Chen and Ahn, Kwangjun and Cheng, Xiang and Gouic, Thibaut Le and Rigollet, Philippe , booktitle =. Optimal dimension dependence of the. 2021 , bdsk-url-1 =

2021
[119]

Exponential decay of

Cao, Yu and Lu, Jianfeng and Lu, Yulong , date-added =. Exponential decay of. Journal of Statistical Physics , mrclass =. 2019 , bdsk-url-1 =. doi:10.1007/s10955-019-02339-8 , fjournal =

2019 doi
[120]

and Li, Mufan and Shen, Ruoqi and Zhang, Matthew S

Chewi, Sinho and Erdogdu, Murat A. and Li, Mufan and Shen, Ruoqi and Zhang, Matthew S. , date-added =. Analysis of. Foundations of Computational Mathematics , month =. 2024 , bdsk-url-1 =. doi:10.1007/s10208-024-09667-6 , issn =

2024 doi
[121]

The variational formulation of the

Jordan, Richard and Kinderlehrer, David and Otto, Felix , date-added =. The variational formulation of the. SIAM Journal on Mathematical Analysis , mrclass =. 1998 , bdsk-url-1 =. doi:10.1137/S0036141096303359 , fjournal =

1998 doi
[122]

and Schechtman, Gideon , date-added =

Milman, Vitali D. and Schechtman, Gideon , date-added =. Asymptotic theory of finite-dimensional normed spaces , volume =
[123]

Conductance and the rapid mixing property for

Jerrum, Mark and Sinclair, Alistair , booktitle =. Conductance and the rapid mixing property for. 1988 , bdsk-url-1 =. doi:10.1145/62212.62234 , isbn =

1988
[124]

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

Milman, Emanuel , date-added =. On the role of convexity in isoperimetry, spectral gap and concentration , url =. Inventiones Mathematicae , mrclass =. 2009 , bdsk-url-1 =. doi:10.1007/s00222-009-0175-9 , fjournal =

2009 doi
[125]

Dissipation of information in channels with input constraints , url =

Polyanskiy, Yury and Wu, Yihong , date-added =. Dissipation of information in channels with input constraints , url =. IEEE Transactions on Information Theory , mrclass =. 2016 , bdsk-url-1 =. doi:10.1109/TIT.2015.2482978 , fjournal =

2016
[126]

The strong data processing inequality under the heat flow , url =

Klartag, Bo'az and Ordentlich, Or , date-added =. The strong data processing inequality under the heat flow , url =. IEEE Transactions on Information Theory , mrclass =. 2025 , bdsk-url-1 =. doi:10.1109/tit.2025.3548961 , fjournal =

2025
[127]

Strong data processing inequalities for input constrained additive noise channels , url =

Calmon, Flavio du Pin and Polyanskiy, Yury and Wu, Yihong , date-added =. Strong data processing inequalities for input constrained additive noise channels , url =. IEEE Transactions on Information Theory , mrclass =. 2018 , bdsk-url-1 =. doi:10.1109/TIT.2017.2782359 , fjournal =

2018
[128]

Entropies, convexity, and functional inequalities: on

Chafa\"i, Djalil , date-added =. Entropies, convexity, and functional inequalities: on. Journal of Mathematics of Kyoto University , mrclass =. 2004 , bdsk-url-1 =. doi:10.1215/kjm/1250283556 , fjournal =

2004
[129]

Relative entropy and score function: New information-estimation relationships through arbitrary additive perturbation , year =

Guo, Dongning , booktitle =. Relative entropy and score function: New information-estimation relationships through arbitrary additive perturbation , year =. doi:10.1109/ISIT.2009.5205652 , pages =

2009
[130]

, date-added =

Barron, Andrew R. , date-added =. Department of Statistics, Stanford University, California, Tech. Rep , title =
[131]

Spreading of sets in product spaces and hypercontraction of the

Ahlswede, Rudolf and G\'acs, P\'eter , date-added =. Spreading of sets in product spaces and hypercontraction of the. The Annals of Probability , mrclass =. 1976 , bdsk-url-1 =. doi:10.1214/aop/1176995937 , fjournal =

1976
[132]

, date-added =

Evans, Lawrence C. , date-added =. Partial differential equations , url =. 2010 , bdsk-url-1 =. doi:10.1090/gsm/019 , edition =

2010 doi
[133]

Cattiaux, Patrick and Guillin, Arnaud , booktitle =. On the. 2020 , bdsk-url-1 =. doi:10.1007/978-3-030-36020-7\_9 , mrclass =

2020 doi
[134]

Functions of bounded variation and free discontinuity problems , url =

Ambrosio, Luigi and Fusco, Nicola and Pallara, Diego , date-added =. Functions of bounded variation and free discontinuity problems , url =. 2000 , bdsk-url-1 =

2000
[135]

Tyrrell and Wets, Roger J.-B

Rockafellar, R. Tyrrell and Wets, Roger J.-B. , date-added =. Variational analysis , url =. 1998 , bdsk-url-1 =. doi:10.1007/978-3-642-02431-3 , isbn =

1998 doi
[136]

Sampling from a log-concave distribution with compact support with proximal

Brosse, Nicolas and Durmus, Alain and Moulines, \'. Sampling from a log-concave distribution with compact support with proximal. Conference on Learning Theory , date-added =. 2017 , bdsk-url-1 =

2017
[137]

On measures strongly log-concave on a subspace , url =

Bizeul, Pierre , date-added =. On measures strongly log-concave on a subspace , url =. Annales de l'Institut Henri Poincar\'. 2024 , bdsk-url-1 =. doi:10.1214/23-aihp1363 , fjournal =

2024 doi
[138]

Isoperimetric and concentration inequalities: Equivalence under curvature lower bound , url =

Milman, Emanuel , date-added =. Isoperimetric and concentration inequalities: Equivalence under curvature lower bound , url =. Duke Mathematical Journal , month = aug, number =. 2010 , bdsk-url-1 =. doi:10.1215/00127094-2010-038 , issn =

2010 doi
[139]

, booktitle =

Kook, Yunbum and Vempala, Santosh S. , booktitle =. Gaussian cooling and. 2024 , bdsk-url-1 =

2024
[140]

, booktitle =

Cousins, Ben and Vempala, Santosh S. , booktitle =. A cubic algorithm for computing. 2014 , bdsk-url-1 =. doi:10.1137/1.9781611973402.90 , mrclass =

2014 doi
[141]

How to compute the volume? , year =

Lov\'. How to compute the volume? , year =. Jber. d. Dt. Math.-Verein, Jubil
[142]

Bioinformatics , month =

Haraldsd\'. Bioinformatics , month =. 2017 , bdsk-url-1 =. doi:10.1093/bioinformatics/btx052 , eprint =

2017 doi
[143]

A community-driven global reconstruction of human metabolism , volume =

Thiele et al., Ines , journal =. A community-driven global reconstruction of human metabolism , volume =
[144]

, booktitle =

Kook, Yunbum and Lee, Yin Tat and Shen, Ruoqi and Vempala, Santosh S. , booktitle =. Sampling with. 2022 , bdsk-url-1 =

2022
[145]

, date-added =

Cousins, Ben and Vempala, Santosh S. , date-added =. A practical volume algorithm , url =. Mathematical Programming Computation , keywords =. 2016 , bdsk-url-1 =. doi:10.1007/s12532-015-0097-z , issn =

2016 doi
[146]

Mironov, Ilya , booktitle =. R\'. 2017 , bdsk-url-1 =. doi:10.1109/CSF.2017.11 , issn =

2017 doi
[147]

On the geometry of differential privacy , url =

Hardt, Moritz and Talwar, Kunal , booktitle =. On the geometry of differential privacy , url =. 2010 , bdsk-url-1 =

2010
[148]

Mechanism design via differential privacy , year =

McSherry, Frank and Talwar, Kunal , booktitle =. Mechanism design via differential privacy , year =. doi:10.1109/FOCS.2007.66 , pages =

2007 doi
[149]

Spectral monotonicity under

Klartag, Bo'az and Putterman, Eli , date-added =. Spectral monotonicity under. Annales de la Facult\'. 2023 , bdsk-url-1 =

2023
[150]

The slicing conjecture via small ball estimates , year =

Bizeul, Pierre , date-added =. The slicing conjecture via small ball estimates , year =. arXiv preprint arXiv:2501.06854 , keywords =

arXiv
[151]

Small ball probability estimates,

Dafnis, Nikos and Paouris, Grigoris , date-added =. Small ball probability estimates,. Journal of Computer and System Sciences , mrclass =. 2010 , bdsk-url-1 =. doi:10.1016/j.jfa.2009.06.038 , fjournal =

2010 doi
[152]

and Koldobsky, Alexander , booktitle =

Bobkov, Sergey G. and Koldobsky, Alexander , booktitle =. On the central limit property of convex bodies , url =. 2003 , bdsk-url-1 =. doi:10.1007/978-3-540-36428-3\_5 , mrclass =

2003 doi
[153]

The central limit problem for convex bodies , url =

Anttila, Milla and Ball, Keith and Perissinaki, Irini , date-added =. The central limit problem for convex bodies , url =. Transactions of the American Mathematical Society , mrclass =. 2003 , bdsk-url-1 =. doi:10.1090/S0002-9947-03-03085-X , fjournal =

2003 doi
[154]

A note on

Guan, Qingyang , date-added =. A note on. arXiv preprint arXiv:2412.09075 , keywords =

arXiv
[155]

Sampling and integration of near log-concave functions , url =

Applegate, David and Kannan, Ravi , booktitle =. Sampling and integration of near log-concave functions , url =. 1991 , bdsk-url-1 =. doi:10.1145/103418.103439 , pages =

1991
[156]

Frieze, Alan and Kannan, Ravi , date-added =. Log-. The Annals of Applied Probability , mrclass =. 1999 , bdsk-url-1 =. doi:10.1214/aoap/1029962595 , fjournal =

1999
[157]

and Weinberger, Hans F

Payne, Lawrence E. and Weinberger, Hans F. , date-added =. An optimal. Archive for Rational Mechanics and Analysis , mrclass =. 1960 , bdsk-url-1 =. doi:10.1007/BF00252910 , fjournal =

1960 doi
[158]

, date-added =

Caffarelli, Luis A. , date-added =. Monotonicity properties of optimal transportation and the. Communications in Mathematical Physics , mrclass =. 2000 , bdsk-url-1 =. doi:10.1007/s002200000257 , fjournal =

doi
[159]

Hit-and-run mixes fast , url =

Lov\'. Hit-and-run mixes fast , url =. Mathematical Programming , keywords =. 1999 , bdsk-url-1 =. doi:10.1007/s101070050099 , id =

1999 doi
[160]

, date-added =

Smith, Robert L. , date-added =. Efficient. Operations Research , mrclass =. 1984 , bdsk-url-1 =. doi:10.1287/opre.32.6.1296 , fjournal =

1984 doi
[161]

An almost constant lower bound of the isoperimetric coefficient in the

Chen, Yuansi , date-added =. An almost constant lower bound of the isoperimetric coefficient in the. Geometric and Functional Analysis , mrclass =. 2021 , bdsk-url-1 =. doi:10.1007/s00039-021-00558-4 , fjournal =

2021 doi
[162]

Geometric algorithms and combinatorial optimization , url =

Gr. Geometric algorithms and combinatorial optimization , url =. 1993 , bdsk-url-1 =. doi:10.1007/978-3-642-78240-4 , edition =

1993 doi
[163]

Improved dimension dependence of a proximal algorithm for sampling , url =

Fan, Jiaojiao and Yuan, Bo and Chen, Yongxin , booktitle =. Improved dimension dependence of a proximal algorithm for sampling , url =. 2023 , bdsk-url-1 =

2023
[164]

Structured logconcave sampling with a restricted

Lee, Yin Tat and Shen, Ruoqi and Tian, Kevin , booktitle =. Structured logconcave sampling with a restricted. 2021 , bdsk-url-1 =

2021
[165]

Improved analysis for a proximal algorithm for sampling , url =

Chen, Yongxin and Chewi, Sinho and Salim, Adil and Wibisono, Andre , booktitle =. Improved analysis for a proximal algorithm for sampling , url =. 2022 , bdsk-url-1 =

2022
[166]

, booktitle =

Kook, Yunbum and Zhang, Matthew S. , booktitle =. R\'. 2025 , bdsk-url-1 =. doi:10.1137/1.9781611978322.181 , isbn =

2025 doi
[167]

Vempala , date-added =

He Jia and Aditi Laddha and Yin Tat Lee and Santosh S. Vempala , date-added =. Reducing isotropy and volume to. arXiv preprint arXiv:2008.02146 , keywords =

2008 arXiv
[168]

Concentration of mass on convex bodies , url =

Paouris, Grigoris , date-added =. Concentration of mass on convex bodies , url =. Geometric and Functional Analysis , mrclass =. 2006 , bdsk-url-1 =. doi:10.1007/s00039-006-0584-5 , fjournal =

2006 doi
[169]

Logarithmic

Holley, Richard and Stroock, Daniel , date-added =. Logarithmic. Journal of Statistical Physics , mrclass =. 1987 , bdsk-url-1 =. doi:10.1007/BF01011161 , fjournal =

1987 doi
[170]

Vempala and Matthew S

Yunbum Kook and Santosh S. Vempala and Matthew S. Zhang , bibsource =. In-and-. Advances in Neural Information Processing Systems , date-added =. 2024 , bdsk-url-1 =

2024
[171]

Fast algorithms for logconcave functions: sampling, rounding, integration and optimization , year =

Lov\'. Fast algorithms for logconcave functions: sampling, rounding, integration and optimization , year =. Symposium on Foundations of Computer Science , date-added =. doi:10.1109/FOCS.2006.28 , pages =

2006 doi
[172]

Hit-and-Run from a corner , url =

Lov\'. Hit-and-Run from a corner , url =. SIAM Journal on Computing , keywords =. 2006 , bdsk-url-1 =. doi:10.1137/s009753970544727x , issn =

2006 doi
[173]

Analysis for diffusion processes on

Wang, Feng-Yu , date-added =. Analysis for diffusion processes on. 2014 , bdsk-url-1 =

2014
[174]

and Wibisono, Andre , booktitle =

Vempala, Santosh S. and Wibisono, Andre , booktitle =. Rapid convergence of the unadjusted. 2023 , bdsk-url-1 =. doi:10.1007/978-3-031-26300-2\_15 , keywords =

2023 doi
[175]

van Erven, Tim and Harremo. R\'. IEEE Transactions on Information Theory , mrclass =. 2014 , bdsk-url-1 =. doi:10.1109/TIT.2014.2320500 , fjournal =

2014
[176]

A central limit theorem and a strong mixing condition , url =

Rosenblatt, Murray , date-added =. A central limit theorem and a strong mixing condition , url =. Proceedings of the National Academy of Sciences of the United States of America , keywords =. 1956 , bdsk-url-1 =. doi:10.1073/pnas.42.1.43 , fjournal =

1956 doi
[177]

The geometry of logconcave functions and sampling algorithms , url =

Lov\'. The geometry of logconcave functions and sampling algorithms , url =. Random Structures & Algorithms , keywords =. 2007 , bdsk-url-1 =. doi:10.1002/rsa.20135 , fjournal =

2007 doi
[178]

Simulated annealing in convex bodies and an

Lov\'. Simulated annealing in convex bodies and an. Journal of Computer and System Sciences , keywords =. 2006 , bdsk-url-1 =. doi:10.1016/j.jcss.2005.08.004 , fjournal =

2006 doi
[179]

Random walks in a convex body and an improved volume algorithm , url =

Lov\'. Random walks in a convex body and an improved volume algorithm , url =. Random Structures & Algorithms , keywords =. 1993 , bdsk-url-1 =. doi:10.1002/rsa.3240040402 , fjournal =

1993 doi
[180]

Thin shell implies spectral gap up to polylog via a stochastic localization scheme , url =

Eldan, Ronen , date-added =. Thin shell implies spectral gap up to polylog via a stochastic localization scheme , url =. Geometric and Functional Analysis , mrclass =. 2013 , bdsk-url-1 =. doi:10.1007/s00039-013-0214-y , fjournal =

2013 doi
[181]

, booktitle =

Cousins, Ben and Vempala, Santosh S. , booktitle =. Bypassing. 2015 , bdsk-url-1 =

2015
[182]

, date-added =

Cousins, Ben and Vempala, Santosh S. , date-added =. Gaussian cooling and. SIAM Journal on Computing , keywords =. 2018 , bdsk-url-1 =. doi:10.1137/15M1054250 , fjournal =

2018 doi
[183]

, date-added =

Lee, Yin Tat and Vempala, Santosh S. , date-added =. Eldan's stochastic localization and the. Annals of Mathematics , mrclass =. 2024 , bdsk-url-1 =. doi:10.4007/annals.2024.199.3.2 , fjournal =

2024 doi
[184]

Bourgain's slicing problem and

Klartag, Bo'az and Lehec, Joseph , date-added =. Bourgain's slicing problem and. Geometric and Functional Analysis , keywords =. 2022 , bdsk-url-1 =. doi:10.1007/s00039-022-00612-9 , fjournal =

2022 doi
[185]

Random walks and an

Kannan, Ravi and Lov\'. Random walks and an. Random Structures & Algorithms , keywords =. 1997 , bdsk-url-1 =. doi:10.1002/(SICI)1098-2418(199708)11:1<1::AID-RSA1>3.0.CO;2-X , fjournal =

1997 doi
[186]

, date-added =

Kalai, Adam Tauman and Vempala, Santosh S. , date-added =. Simulated annealing for convex optimization , url =. Mathematics of Operations Research , keywords =. 2006 , bdsk-url-1 =. doi:10.1287/moor.1060.0194 , fjournal =

2006
[187]

, booktitle =

Jia, He and Laddha, Aditi and Lee, Yin Tat and Vempala, Santosh S. , booktitle =. Reducing isotropy and volume to. 2021 , bdsk-url-1 =. doi:10.1145/3406325.3451018 , keywords =

2021
[188]

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

Dyer, Martin and Frieze, Alan and Kannan, Ravi , date-added =. A random polynomial-time algorithm for approximating the volume of convex bodies , url =. Journal of the ACM , keywords =. 1991 , bdsk-url-1 =. doi:10.1145/102782.102783 , fjournal =

1991
[189]

The mixing rate of

Lov\'. The mixing rate of. 1990 , bdsk-url-1 =. doi:10.1109/FSCS.1990.89553 , mrclass =

1990
[190]

Spectral gap, logarithmic

Ledoux, Michel , booktitle =. Spectral gap, logarithmic. 2004 , bdsk-url-1 =. doi:10.4310/SDG.2004.v9.n1.a6 , mrclass =

2004 doi
[191]

A simple analytic proof of an inequality by

Ledoux, Michel , date-added =. A simple analytic proof of an inequality by. Proceedings of the American Mathematical Society , keywords =. 1994 , bdsk-url-1 =. doi:10.2307/2160298 , fjournal =

1994 doi
[192]

, date-added =

Kolmogorov, Andrei Nikolaevich and Rozanov, Yu A. , date-added =. On a strong mixing condition for stationary. Teorija Verojatnoste. 1960 , bdsk-url-1 =

1960
[193]

Logarithmic bounds for isoperimetry and slices of convex sets , url =

Klartag, Bo'az , date-added =. Logarithmic bounds for isoperimetry and slices of convex sets , url =. Ars Inveniendi Analytica , keywords =. 2023 , bdsk-url-1 =. doi:10.15781/jsjy-0b06 , eprint =

2023 doi
[194]

Isoperimetric problems for convex bodies and a localization lemma , url =

Kannan, Ravi and Lov\'. Isoperimetric problems for convex bodies and a localization lemma , url =. Discrete & Computational Geometry , keywords =. 1995 , bdsk-url-1 =. doi:10.1007/BF02574061 , fjournal =

1995 doi
[195]

On contraction properties of

Del Moral, Pierre and Ledoux, Michel and Miclo, Laurent , date-added =. On contraction properties of. Probability Theory and Related Fields , mrclass =. 2003 , bdsk-url-1 =. doi:10.1007/s00440-003-0270-6 , fjournal =

2003 doi
[196]

A lower bound for the smallest eigenvalue of the

Cheeger, Jeff , booktitle =. A lower bound for the smallest eigenvalue of the. 1970 , bdsk-url-1 =

1970
[197]

A note on the isoperimetric constant , url =

Buser, Peter , date-added =. A note on the isoperimetric constant , url =. Annales Scientifiques de l'\'. 1982 , bdsk-url-1 =

1982
[198]

Analysis and geometry of

Bakry, Dominique and Gentil, Ivan and Ledoux, Michel , date-added =. Analysis and geometry of. 2014 , bdsk-url-1 =. doi:10.1007/978-3-319-00227-9 , isbn =

2014 doi
[199]

Entropy contraction of the

Filippo Ascolani and Hugo Lavenant and Giacomo Zanella , date-added =. Entropy contraction of the. 2024 , bdsk-url-1 =. 2410.00858 , journal =

2024
[200]

and Madiman, Mokshay , doi =

Bobkov, Sergey G. and Madiman, Mokshay , doi =. Concentration of the information in data with log-concave distributions , volume =. The Annals of Probability , number =
[201]

Optimal Concentration of Information Content for Log-Concave Densities , url =

Fradelizi, Matthieu and Madiman, Mokshay and Wang, Liyao , booktitle =. Optimal Concentration of Information Content for Log-Concave Densities , url =. 2016 , bdsk-url-1 =. doi:10.1007/978-3-319-40519-3_3 , eprint =

2016 doi
[202]

Nguyen, Van Hoang , date-added =. In
[203]

Heat capacity bound, energy fluctuations and convexity , year =

Wang, Liyao , date-added =. Heat capacity bound, energy fluctuations and convexity , year =
[204]

, date-added =

Andrieu, Christophe and Lee, Anthony and Power, Sam and Wang, Andi Q. , date-added =. Explicit convergence bounds for. The Annals of Applied Probability , keywords =. 2024 , bdsk-url-1 =. doi:10.1214/24-aap2058 , fjournal =

2024 doi
[205]

and Mahony, R

Absil, P.-A. and Mahony, R. and Sepulchre, R. , address =. Optimization Algorithms on Matrix Manifolds , year =

Pith tools

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

[1] [1]

, title =

Vempala, Santosh S. , title =

[2] [2]

Random walks on polytopes and an affine interior point method for linear programming , year =

Kannan, Ravi and Narayanan, Hariharan , booktitle =. Random walks on polytopes and an affine interior point method for linear programming , year =

[3] [3]

Path finding methods for linear programming: solving linear programs in

Yin Tat Lee and Aaron Sidford , booktitle =. Path finding methods for linear programming: solving linear programs in

[4] [4]

Self-concordant functions and polynomial time methods in convex programming

Nesterov, Yurii and Nemirovskii, Arkadii , journal =. Self-concordant functions and polynomial time methods in convex programming. preprint, central economic & mathematical institute, ussr acad , volume =

[5] [5]

Iterative solution of problems of linear and quadratic programming , volume =

Dikin, Iliya Iosiphovich , booktitle =. Iterative solution of problems of linear and quadratic programming , volume =

[6] [6]

A polynomial-time algorithm, based on

Renegar, James , journal =. A polynomial-time algorithm, based on

[7] [7]

A new polynomial-time algorithm for linear programming , year =

Karmarkar, Narendra , booktitle =. A new polynomial-time algorithm for linear programming , year =

[8] [8]

and Johnson, Alan W

Henderson, Darrall and Jacobson, Sheldon H. and Johnson, Alan W. , pages =. The theory and practice of simulated annealing , year =