Joint stochastic localization and applications

Qiang Ye; Tom Alberts; Yiming Xu

REVIEW 4 major objections 5 minor 14 references

Joint stochastic localization and applications

T0 review · 4 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

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

Pith's one-line read A coupling produced by joint stochastic localization defines a metric with the same topology as the 2-Wasserstein distance on compactly supported measures.

desk verdict The joint stochastic localization distance is a real new construction, but the abstract sells an estimator-error guarantee the body never proves. read the letter →

arxiv 2505.13410 v2 pith:KTQN3EW3 submitted 2025-05-19 math.ST math.PRstat.MLstat.TH

Tom Alberts , Yiming Xu , Qiang Ye This is my paper · ORCID

classification math.STmath.PRstat.MLstat.TH MSC 49Q2260G4460J6062B10

keywords stochasticlocalizationEldanalpha-schemecouplingsofprobabilitymeasuresWassersteindistanceoptimaltransportscorematchingdiffusionmodelslog-concave

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 tries to turn stochastic localization, a pathwise technique for decomposing a probability measure into localized pieces, into a tool for coupling two distributions and comparing them. It runs two localization processes concurrently on a shared Brownian motion and defines a distance $dSL_{\alpha}$ as the expected squared distance between the two posterior means at the end of the process. The central result is that for $\alpha=0$, this distance has the same topology as the $2$-Wasserstein metric on probability measures supported on a common compact set. Because the distance can be estimated by Monte-Carlo simulation rather than by solving an optimal-transport problem, it offers a cheaper way to compare distributions in applications that need many pairwise distances. A second construction extrapolates the optimal Gaussian coupling to log-concave measures and reproduces the squared $2$-Wasserstein cost exactly when both measures are Gaussian.

What carries the argument

The central object is Eldan's $\alpha$-scheme: a stochastic localization process whose control matrix is $C_t=(\Sigma_t^\dagger)^\alpha$, where $\Sigma_t$ is the current covariance of the localized measure. The paper runs two such schemes, one for $\mu$ and one for $\nu$, driven by the same Brownian motion, and defines the $\alpha$-SL distance $dSL_{\alpha}(\mu,\nu)=\sqrt{\mathbb{E}\|a_\infty-b_\infty\|_2^2}$ using the almost-sure limits of the two posterior-mean processes. For $\alpha=0$ the control is the identity, which makes the observation process $\theta_t=tX+W_t$ explicit and allows the proof of Theorem 5.4 to compare finite-time observation processes with a Gronwall argument; this explicit structure is what carries the topological equivalence.

What would settle it

Take $\mu_n$ uniform on an $n\times n$ grid in $[0,1]^2$ and $\nu_n$ uniform on the same grid shifted by $1/n^2$, so $W_2(\mu_n,\nu_n)\to 0$. Both are finitely supported on a common compact set, and the joint $0$-scheme's posterior-mean dynamics is a finite SDE system; topological equivalence predicts $dSL_0(\mu_n,\nu_n)\to 0$, so a Monte-Carlo evaluation that yields a positive limit would refute Theorem 5.4.

Watch

Extended reading notes

Core claim

Joint Eldan's $\alpha$-scheme couples $\mu$ and $\nu$ by evolving their tilted densities with the same Brownian motion; when both processes localize, the posterior means converge to a random pair $(a_\infty,b_\infty)$ whose law is a coupling of $\mu$ and $\nu$. The paper defines $dSL_{\alpha}(\mu,\nu)=\sqrt{\mathbb{E}\|a_\infty-b_\infty\|_2^2}$ and proves in Theorem 5.4 that for $\alpha=0$, on measures supported in a fixed compact set, $dSL_0$ and $W_2$ induce the same topology. The proof shows $W_2$ convergence forces $dSL_0$ convergence by bounding the difference of the two observation processes with a Gronwall/stability argument; the reverse direction is immediate because $W_2\le dSL_0$. The extrapolation scheme of Theorem 4.2 produces a coupling whose expected squared cost lies strictly below the independent-coupling cost for log-concave measures, and equals the squared $W_2$ distance when both measures are Gaussian. The paper also connects weighted $0$-SL distances to the Gaussian KL divergence and to score-matching losses used in diffusion models.

Load-bearing premise

The distances are only defined when the stochastic localization processes exist and localize, and the paper imports that existence from earlier bounded-support, smooth-density results instead of proving it for the joint scheme on the broader class the abstract suggests.

Editorial extensions

If this is right

On a common compact set, $W_2$-convergence and $dSL_0$-convergence are the same, so either metric can be used to study convergence of measures in that class.
For Gaussian marginals, the extrapolation coupling's expected cost is exactly the squared $W_2$ distance, and for log-concave marginals it is an explicit upper bound, giving a computable transport bound without solving an optimization problem.
The weighted $0$-SL objectives are equivalent, under the identifications of Theorems 6.1 and 6.3, to Gaussian-KL and score-matching objectives used in diffusion-model training.
The finite-support and bounded-smooth cases in which the $\alpha$-scheme is known to exist support simulation-based use of $dSL_{\alpha}$ for distribution estimation and repeated pairwise comparisons.

Reading between the lines

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

Should the topological equivalence extend beyond compact support to all finite-second-moment measures, $dSL_0$ could become a universal simulated surrogate for $W_2$; the paper's proof does not go that far.
The family $\{dSL_{\alpha}\}_{\alpha\in[0,1/2]}$ appears to interpolate between an entropy-like divergence and a transport-like metric, suggesting a tunable divergence family for applications that need to balance the two geometries; the paper leaves this interpolation as future work.
The score-matching equivalence suggests a concrete experiment: train a diffusion model by minimizing the coupled posterior-mean mismatch in (6.11) and compare sample quality against the usual single-trajectory score loss.
Section 9 explicitly leaves discretization and Monte-Carlo error bounds to future work, so the abstract's promise of rigorous error guarantees is not proved in the current text; a certified estimator remains an open step.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

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

I read this one carefully. The core content is better than the abstract. The authors unify SL schemes via Ct=(Σ†)^α, prove localization rates, and introduce a joint scheme that yields a genuine coupling. The α-SL distance is a reasonable object; Theorem 5.4 (dSL0 topologically equivalent to W2 on common compact support) appears to hold — I checked the proof step by step and the sequential argument is sound: normalize observation gap by 4/t, then Gronwall, Lipschitz bound via covariance, with constants independent of n. Theorem 4.2 also checks out: the extrapolation coupling gives strict improvement over independence and equals W2^2 for Gaussians. The Section 6 links to Gaussian KL and score-matching are honest, mostly change-of-variable arguments over known results, but they place the distance in a useful context. No fitted parameters anywhere; α and w are design choices. Citation pattern is solid — Eldan, EMZ20, etc. are correctly credited.

The soft spots are real but localized. First, the abstract promises 'rigorous error guarantees' for α=0 and α=1/2 estimators, but Section 9 admits the paper did not account for discretization or MC error. I searched the body: no theorem bounds E||a_T−a∞||² or the discretization error in (7.2). That is an abstract/body mismatch, not a fatal flaw in the math. The repair is straightforward for α=0: (3.2) gives E||a_T−a∞||²=∫_T∞ E trΣ_t dt=O(d/T), and exponential decay for α=1/2; add those bounds plus MC/discretization analysis and the claim is substantiated. Second, the abstract mentions approximate Wasserstein barycenters; the body never returns to that. Third, the gradient computation in (7.4) assumes the localization profile is differentiable in ϑ; for the finite-support approximations used in Section 8, the profile is piecewise constant, so the gradient is zero a.e. and the selected index ij jumps. The numerical results are preliminary and not reproducible — no code or data. Also, the metric is defined on P_α(R^d), which is imported from EMZ20; the authors acknowledge that a sharp characterization is hard. That is a limitation, not a flaw.

Bottom line: the central mathematical claims hold up; the paper oversells the algorithmic side. A serious referee should take it — the theory is worth engaging and the fixes are feasible. I'd send it out with instructions to align the abstract with the body, add or withdraw the error-guarantee claim, and either prove or state honestly the regularity needed for (7.4). As for me, I'd cite the α-SL distance and Theorem 5.4, and I'd bring it to reading group if anyone is working on Wasserstein proxies.

Referee Report

4 major / 5 minor

Summary. The paper proposes a joint stochastic localization (SL) framework and uses it to define a family of distances between probability measures. Section 3 unifies existing SL schemes into Eldan's alpha-scheme with control Ct = (Sigma^dag_t)^alpha and proves localization-rate bounds (Theorem 3.1), including a regularized alpha = 1/2 variant with a log-concave analysis (Theorem 3.3). Section 4 introduces joint SL and an extrapolation scheme, yielding a coupling with upper bounds on the 2-Wasserstein distance (Theorem 4.2). Section 5 defines the alpha-SL distance and its weighted version, proves basic metric properties, and establishes topological equivalence of dSL0 and W2 for measures with common compact support (Theorem 5.4). Section 6 links weighted 0-SL distances to the Gaussian KL divergence and to score-matching objectives; Section 7 proposes MC-based distribution estimation; Section 8 reports numerical experiments. The abstract additionally promises efficient estimators with rigorous error guarantees and approximate Wasserstein barycenters, but those claims are not established in the body.

Significance. If the central claims hold, the paper offers a genuinely new sampling-based proxy for the 2-Wasserstein distance that avoids solving an optimal transport problem, with attractive connections to Follmer processes and score matching. The proofs of Theorems 3.1, 4.2, and 5.4 are detailed, the localization-rate inequalities are explicit, and no fitted calibration parameters are used. I did not identify a fatal mathematical flaw in the proof of Theorem 5.4. The current manuscript is not, however, in publishable form as advertised: the computational guarantees promised in the abstract are absent, the domain of the distance is narrower than the abstract suggests, and the paper's own Section 9 acknowledges that discretization and Monte Carlo errors are not quantified.

major comments (4)

[Abstract; Section 7, Eq. (7.2); Section 9] The abstract's claim of efficient estimators with rigorous error guarantees is unsupported. The estimator replaces a_infty,b_infty by a_T,b_T, uses Euler-Maruyama discretization, and averages M trajectories, but no theorem in Sections 7-8 bounds E||a_T - a_infty||^2, the SDE discretization error, or the Monte Carlo error. Section 9 explicitly states that approximation errors, including discretization and MC errors, were not accounted for and that rigorously quantifying them is a necessary task. This gap is load-bearing because the advertised computational proxy for W2 depends on it. A repair is available: for alpha = 0, (3.2) and Theorem 3.1(i) imply E||a_T - a_infty||^2 = integral_T^infty E tr Sigma_t dt = O(d/T), and for alpha = 1/2 the decay is exponential; combining such a bound with MC and discretization analysis would substantiate the claim.
[Section 5.1, Definition 2] The alpha-SL distance is defined only on P_alpha(R^d), and the text immediately before Definition 2 states that a sharp characterization of P_alpha is difficult, with existence imported from [EMZ20, Propositions 1-2] under bounded-support and smooth-density or finite-support hypotheses. No standalone existence result is proved for the jointly driven alpha-scheme beyond the log-concave case of Theorem 4.1. Thus the abstract's broad phrasing, which suggests a family of metrics on the space of probability measures, overstates the domain. Theorems 5.1 and 5.4 are acceptable under their stated hypotheses, but the paper should state the domain restriction prominently and either prove existence or explicitly limit the alpha = 1/2 computational claims to finite-support or log-concave inputs.
[Abstract; Sections 1-9] The abstract claims the distance enables approximate computation of Wasserstein barycenters, but no theorem, algorithm, or experiment on barycenters appears anywhere in the body. If this is intended as a future direction, it should be removed from the abstract or supported by an explicit construction and error analysis.
[Section 8] The numerical sections cannot fill the gap between Theorem 5.4 and the computational guarantees in the abstract. The simulations use the regularized control Ct = (Sigma_t + delta^(1/alpha) I)^(-alpha) rather than the theoretical Ct = (Sigma^dag_t)^alpha, and the reported entries in Figure 5 are MC averages whose bias relative to dSL_alpha and W2 is not analyzed. The paper states in Section 8 that discretization errors are not considered. Consequently, the experiments illustrate behavior but do not provide the rigorous finite-sample guarantees promised in the abstract.

minor comments (5)

[Theorem 5.4 proof] In the final display of the proof, the notation switches between the normalized process (theta_T - theta'_T)/T and the unnormalized process theta_T - theta'_T; the line 'E||theta_T - theta'_T||_2^2 <= (1/T^2) E||theta_T - theta'_T||^2' should use two different symbols for the normalized and unnormalized variables.
[Theorem 5.1 proof, Eq. (5.2)] In the displayed equation, E||Ua_t - Ub_t||_infty^2 should be E||Ua_t - Ub_t||_2^2, and the subsequent term 'a^U_t - a^U_t' should read 'a^U_t - b^U_t'.
[Section 8.2, Case 2] The uniform distributions on annuli are written as Unif({x in R^d : ...}) but the experiment is in R^2; the dimension should be R^2.
[Abstract and Definition 2] The abstract uses the name 'Eldan's alpha-distance' while the body uses 'alpha-SL distance'; the terminology should be made consistent.
[Section 8.2, Figure 5] The tables report 'Optimal' and 'Independence' rows without confidence intervals; the text should clarify whether these values are exact or obtained by a different estimator.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the new distance is defined constructively, the main equivalence theorem is proved from the SL dynamics with external existence results, and no self-citations or fitted parameters carry the argument.

full rationale

The derivation of the alpha-SL distance is constructive rather than circular: Definition 2 defines dSL_alpha as the squared-L2 cost of the coupling (a_infty,b_infty) produced by a joint Eldan alpha-scheme, and no parameter is fitted to the quantity being predicted. Theorem 5.4 is a genuine equivalence proof: conditional on existence of the alpha=0 scheme (imported from external sources, [EMZ20, Propositions 1-2] and [LS77, Theorem 7.1.2]), the proof bounds the finite-time gap E||theta_T - theta'_T||^2 by a Gronwall estimate in terms of W2^2(nu,nu^(n)) with constants independent of n, so W2 convergence forces dSL0 convergence; the reverse direction uses only that W2 is bounded by dSL0. The KL and score-matching identities in Section 6 are rewritings of known external results (Lemma 3 from [KP23] and Lemma 4 from [Mon23]); Theorem 6.1 chooses the weight w(dt)=(1+t)^{-2}dt so that a change-of-variable identity holds exactly, which is a representation rather than a fitted prediction. The reference list contains no self-citations by the present authors. The abstract's claim of 'rigorous error guarantees' for the Monte-Carlo estimator is not supported by any theorem in the body, and Section 9 explicitly concedes that approximation errors from SDE discretization and MC simulation were not accounted for and that quantifying them 'is a necessary task'; this is a completeness/correctness limitation, not a circularity. Therefore no circular step is present and the paper's core mathematical contributions are self-contained given the cited external existence and localization results.

Assumptions & free parameters 4 free parameters · 6 assumptions · 3 invented entities

The central theoretical results introduce no fitted constants; alpha, delta, time horizon, and Monte Carlo sizes are free design or implementation parameters. The proofs rest on imported existence, localization, thin-shell, and Follmer-process results from the prior literature, plus the explicit compact-support and log-concavity assumptions. The three invented entities are mathematical/algorithmic constructions with internal consistency arguments rather than empirical objects, so independent_evidence is false for all of them.

free parameters (4)

alpha (Eldan scheme exponent) = design parameter in [0,1]
Defines the family Ct = (Sigma^dagger_t)^alpha. Not fitted to data, but the entire distance family is indexed by it.
delta (regularization parameter) = 0.003 in Section 8.1, 0.001 in Sections 8.2-8.3
Regularization in the numerical implementation of the alpha-scheme; theoretical results assume small positive delta.
Simulation horizon T = T = 10 in Sections 8.1 and 8.3, T = 10^4 in Section 8.2
Finite-time truncation of the SL process replaces the infinite-time limits; the paper does not provide bias bounds for this truncation.
MC trajectory count and sample sizes = M = 10^3 or 10^4, N = 200-1024 depending on experiment
Monte Carlo and empirical-measure discretization choices in Section 8; no rigorous error control is provided.

assumptions (6)

standard math Existence and uniqueness of Eldan's alpha-scheme for bounded-support smooth densities is imported from [EMZ20, Propositions 1-2].
Used in the proof of Theorem 3.1 and implicitly in Definition 2 for the alpha-SL distance.
domain assumption Log-concave measures localize under Eldan's 1/2-scheme and have nonsingular covariance, from [Eld13, Lemma 2.4].
Used in Theorem 4.1 to prove existence and localization of the extrapolation scheme.
standard math Thin-shell variance bound sigma_d^2 <= O(log^4.5 d) for isotropic log-concave measures, from [JLV22, Theorem 2].
Used in the proof of Theorem 3.3 to control the quadratic variation of the trace process.
domain assumption The Follmer process exists and satisfies the KL identity (6.2) under mild regularity conditions on the target measure relative to Gaussian.
Used in Theorem 6.1 to represent KL(mu||nu) as an integral over posterior means.
standard math The pathwise identities in Lemma 3 [KP23] and Lemma 4 [Mon23] connecting SL observation processes to Follmer processes and OU reversals are taken as given.
These lemmas are the bridge for the KL and score-matching interpretations in Section 6.
domain assumption Both measures are supported on a common compact set for the topological equivalence result.
This is the explicit hypothesis of Theorem 5.4 and controls Lipschitz constants and exponential moments throughout the proof.

invented entities (3)

alpha-SL distance and weighted alpha-SL distance
purpose: Family of transport-style metrics on probability measures induced by joint stochastic localization couplings.
A new mathematical object; its main external handle is the proved topological equivalence with W2, which is internal to the paper rather than an independent experimental prediction.
Joint Eldan's alpha-scheme
purpose: Coupling construction that runs two SL processes on a shared Brownian motion.
A new algorithmic construct introduced by the paper; no separate falsifiable prediction outside the paper is provided.
Extrapolation scheme
purpose: Joint SL variant designed to extrapolate the Gaussian optimal transport coupling to log-concave measures.
A new construction; its behavior for Gaussians matches the known W2 coupling, but for general measures it is supported only by theoretical upper bounds and simulations.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Joint stochastic localization and applications." pith.science (2026). https://pith.science/paper/KTQN3EW3

@misc{pith2026250513410,
  author       = {Pith},
  title        = {Pith review of: Joint stochastic localization and applications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KTQN3EW3}},
  note         = {Machine review of arXiv:2505.13410}
}

abstract

Stochastic localization is a pathwise analysis technique that has emerged as a powerful tool in high-dimensional probability and sampling. In this work, we extend stochastic localization to a joint framework for coupling probability measures and explore its applications in distributional data analysis. We first unify existing stochastic localization processes under Eldan's $\alpha$-scheme and characterize their localization rates. Building on this, we introduce a joint scheme to couple probability measures via concurrent $\alpha$-schemes driven by a shared Brownian motion. This construction is canonical and induces a family of metrics on the space of probability measures, which we call Eldan's $\alpha$-distance. Alternative variants that extrapolate optimal Gaussian couplings to log-concave measures are also discussed. We study the theoretical properties of Eldan's $\alpha$-distance, including its restriction to Gaussian measures and its behavior under affine transformations. For $\alpha = 0$, we show it is topologically equivalent to the $2$-Wasserstein distance for measures supported on a common compact set; we also relate its weighted variants to linearized optimal transport in Wiener space and to score-matching objectives in training diffusion models. Computationally, we develop efficient estimators for Eldan's $\alpha$-distance in the cases $\alpha=0$ and $\alpha=1/2$, with rigorous error guarantees for log-concave and finitely supported measures in the former setting and Gaussian measures in the latter. Finally, we apply Eldan's $\alpha$-distance as a scalable surrogate for the $2$-Wasserstein distance to enable fast pairwise distance estimation and approximate computation of Wasserstein barycenters.

Figures

Figures reproduced from arXiv: 2505.13410 by the authors.

**Figure 1.** A trajectory of the observation process θt = tX + Wt with X = (1, 1)⊤ (left). As t grows, the signalto-noise ratio increases and thus θt becomes increasingly informative of the unobserved signal X. This can be measured by computing the ℓ2 distance (error) between the normalized signal θt t and X (right). where Gt is the filtration generated by θt . Viewing (2.7) from a Bayesian perspective, one can consider an asso… view at source ↗

**Figure 2.** Joint SL of point cloud on the Yin and Yang Taichi logo using the (regularized) extrapolation scheme in (4.4). The initial distributions are uniform on the blue and red points, and time increases in the diagram as one goes from left to right. The size of the points is proportional to their weights. As an initial application, we construct couplings between µ and ν with reduced transportation distance compared to the … view at source ↗

**Figure 3.** Localization rates of Eldan’s α-scheme for two different distributions in R 2 : a uniform distribution over [−1, 1]2 (left) and a Gaussian mixture with three components (right). The specific setups are given below: Case 1 : µ ∼ X 4 i=1 1 4 N   " √ 1 2 − √ 1 2 √ 1 2 √ 1 2 #i 4 0 , 0.1 0 0 0.1   , ν ∼ X 4 i=1 1 4 N   " √ 1 2 − √ 1 2 √ 1 2 √ 1 2 #i 2 √ 2 2 √ 2 , 0.1 0 0 0.1   ; Case 2 : µ ∼ Unif… view at source ↗

Figures from the paper (3 more)

**Figure 4.** Figure 4: Simulated data from µ and ν in Case 1 (top) and Case 2 (bottom). A line connecting two points represents a joint sample obtained in the MC simulation of the corresponding joint SL schemes. Coupling Bound on W2 95% CI Joint Eldan’s 0 2.99 [2.95, 3.02] Joint Eldan’s 0.3 …

**Figure 5.** Figure 5: Estimated bounds on the W2-distance using different joint SL schemes in Case 1 (left) and Case 2 (right). The 95% CI is also given based on the estimated variances. 29 [PITH_FULL_IMAGE:figures/full_fig_p029_5.png]

**Figure 6.** Figure 6: Loss decay (plotted in log10-scale against iterations) for both informed and uninformed initializations (top) and visualizations of the initializations along with their corresponding estimated distributions ν (bottom). 9 Conclusion and future work In this paper, we stu…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

14 extracted references · 10 canonical work pages

[1]

Reverse-time diffusion equation models

[And82] B. Anderson. “Reverse-time diffusion equation models”. Stochastic Processes and their Ap- plications 12.3 (1982), pp. 313–326. [ACB17] M. Arjovsky, S. Chintala, and L. Bottou. “Wasserstein Generative Adversarial Networks”. In: Proceedings of the 34th International Conference on Machine Learning. Ed. by D. Precup and Y. W. Teh. Vol

work page 1982
[2]

On high dimensional maximal functions associated to convex bodies

[Bou86b] J. Bourgain. “On high dimensional maximal functions associated to convex bodies”. American Journal of Mathematics 108.6 (1986), pp. 1467–1476. [Che21] Y. Chen. “An almost constant lower bound of the isoperimetric coefficient in the KLS con- jecture”. Geometric and Functional Analysis 31 (2021), pp. 34–61. [CE22] Y. Chen and R. Eldan. “Localizatio...

work page arXiv 1986
[3]

2013, pp. 885–899. [LS77] R. S. Lipster and A. N. Shiiriaev. Statistics of random processes I: general theory . Springer- Verlag,

work page 2013
[5]

Eldan’s stochastic localization and the KLS hyperplane con- jecture: an improved lower bound for expansion

2023, pp. 939–967. [LV17] Y. T. Lee and S. S. Vempala. “Eldan’s stochastic localization and the KLS hyperplane con- jecture: an improved lower bound for expansion”. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) . IEEE. 2017, pp. 998–1007. [Leh13] J. Lehec. “Representation formula for the entropy and functional inequalities”...

work page 2023
[6]

A spectral condition for spectral gap: fast mixing in high-temperature Ising models

2022, pp. 4246–4270. [EKZ22] R. Eldan, F. Koehler, and O. Zeitouni. “A spectral condition for spectral gap: fast mixing in high-temperature Ising models”. Probability theory and related fields 182.3 (2022), pp. 1035–

work page 2022
[14]

Score-based generative modeling through stochastic differential equations

[Son+20] Y. Song, J. Sohl-Dickstein, D. P. Kingma, A. Kumar, S. Ermon, and B. Poole. “Score-based generative modeling through stochastic differential equations”.arXiv preprint arXiv:2011.13456 (2020). [TZ24] W. Tang and H. Zhao. “Score-based Diffusion Models via Stochastic Differential Equations–a Technical Tutorial”. arXiv preprint arXiv:2402.07487 (2024...

arXiv 2020
[70]

Strong equivalence between metrics of Wasserstein type

Proceedings of Machine Learning Research. PMLR, 2017, pp. 214–223. [BG21] E. Bayraktar and G. Guo. “Strong equivalence between metrics of Wasserstein type”. Elec- tronic Communications in Probability 26 (2021). [Ben+23] J. Benton, V. De Bortoli, A. Doucet, and G. Deligiannidis. “Linear convergence bounds for diffusion models via stochastic localization”. ...

arXiv 2021
[84]

A class of Wasserstein metrics for probability distributions

Proceedings of Machine Learning Research. PMLR, 2018, pp. 1608–1617. [GS84] C. R. Givens and R. M. Shortt. “A class of Wasserstein metrics for probability distributions.” Michigan Mathematical Journal 31.2 (1984), pp. 231–240. [Gla04] P Glasserman. Monte Carlo Methods in Financial Engineering

work page 1984

Show all 14 references

[1051]

Bounding the norm of a log-concave vector via thin-shell estimates

[EL14] R. Eldan and J. Lehec. “Bounding the norm of a log-concave vector via thin-shell estimates”. In: Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2011-2013 . Springer. 2014, pp. 107–122. [EMZ20] R. Eldan, D. Mikulincer, and A. Zhai. “The CLT in high dimen...

2020
[1280]

Taming correlations through entropy-efficient measure decompositions with ap- plications to mean-field approximation

[Eld20] R. Eldan. “Taming correlations through entropy-efficient measure decompositions with ap- plications to mean-field approximation”. Probability Theory and Related Fields 176.3 (2020), pp. 737–755. [Eld22] R. Eldan. “Analysis of high-dimensional distributions using pathwi...

2020
[1977]

Random walks in a convex body and an improved volume algorithm

[LS93] L. Lov´ asz and M. Simonovits. “Random walks in a convex body and an improved volume algorithm”. Random structures & algorithms 4.4 (1993), pp. 359–412. [MS24] D. Mikulincer and Y. Shenfeld. “The Brownian transport map”. Probability Theory and Re- lated Fields 190.1 (20...

1993 arXiv
[2003]

An empirical Bayes approach to statistics

[Rob92] H. E. Robbins. “An empirical Bayes approach to statistics”. In: Breakthroughs in Statistics: Foundations and basic theory. Springer, 1992, pp. 388–394. [Sal+18] T. Salimans, H. Zhang, A. Radford, and D. Metaxas. “Improving GANs Using Optimal Trans- port”. In: Internati...

1992
[2014]

Stochastic Localization via Itera- tive Posterior Sampling

[Gre+24] L. Grenioux, M. Noble, M. Gabri´ e, and A. O. Durmus. “Stochastic Localization via Itera- tive Posterior Sampling”. In: International Conference on Machine Learning . PMLR. 2024, pp. 16337–16376. [Gua24] Q. Guan. “A note on Bourgain’s slicing problem”. arXiv preprint ...

2024 arXiv
[2018]

Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization

32 [EAMS22] A. El Alaoui, A. Montanari, and M. Sellke. “Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic stochastic localization”. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) . IEEE. 2022, pp. 323–334. [Eld13] R. Eldan. ...

2013

Pith tools

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

[1] [1]

Reverse-time diffusion equation models

[And82] B. Anderson. “Reverse-time diffusion equation models”. Stochastic Processes and their Ap- plications 12.3 (1982), pp. 313–326. [ACB17] M. Arjovsky, S. Chintala, and L. Bottou. “Wasserstein Generative Adversarial Networks”. In: Proceedings of the 34th International Conference on Machine Learning. Ed. by D. Precup and Y. W. Teh. Vol

work page 1982

[2] [2]

On high dimensional maximal functions associated to convex bodies

[Bou86b] J. Bourgain. “On high dimensional maximal functions associated to convex bodies”. American Journal of Mathematics 108.6 (1986), pp. 1467–1476. [Che21] Y. Chen. “An almost constant lower bound of the isoperimetric coefficient in the KLS con- jecture”. Geometric and Functional Analysis 31 (2021), pp. 34–61. [CE22] Y. Chen and R. Eldan. “Localizatio...

work page arXiv 1986

[3] [3]

2013, pp. 885–899. [LS77] R. S. Lipster and A. N. Shiiriaev. Statistics of random processes I: general theory . Springer- Verlag,

work page 2013

[4] [5]

Eldan’s stochastic localization and the KLS hyperplane con- jecture: an improved lower bound for expansion

2023, pp. 939–967. [LV17] Y. T. Lee and S. S. Vempala. “Eldan’s stochastic localization and the KLS hyperplane con- jecture: an improved lower bound for expansion”. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) . IEEE. 2017, pp. 998–1007. [Leh13] J. Lehec. “Representation formula for the entropy and functional inequalities”...

work page 2023

[5] [6]

A spectral condition for spectral gap: fast mixing in high-temperature Ising models

2022, pp. 4246–4270. [EKZ22] R. Eldan, F. Koehler, and O. Zeitouni. “A spectral condition for spectral gap: fast mixing in high-temperature Ising models”. Probability theory and related fields 182.3 (2022), pp. 1035–

work page 2022

[6] [14]

Score-based generative modeling through stochastic differential equations

[Son+20] Y. Song, J. Sohl-Dickstein, D. P. Kingma, A. Kumar, S. Ermon, and B. Poole. “Score-based generative modeling through stochastic differential equations”.arXiv preprint arXiv:2011.13456 (2020). [TZ24] W. Tang and H. Zhao. “Score-based Diffusion Models via Stochastic Differential Equations–a Technical Tutorial”. arXiv preprint arXiv:2402.07487 (2024...

arXiv 2020

[7] [70]

Strong equivalence between metrics of Wasserstein type

Proceedings of Machine Learning Research. PMLR, 2017, pp. 214–223. [BG21] E. Bayraktar and G. Guo. “Strong equivalence between metrics of Wasserstein type”. Elec- tronic Communications in Probability 26 (2021). [Ben+23] J. Benton, V. De Bortoli, A. Doucet, and G. Deligiannidis. “Linear convergence bounds for diffusion models via stochastic localization”. ...

arXiv 2021

[8] [84]

A class of Wasserstein metrics for probability distributions

Proceedings of Machine Learning Research. PMLR, 2018, pp. 1608–1617. [GS84] C. R. Givens and R. M. Shortt. “A class of Wasserstein metrics for probability distributions.” Michigan Mathematical Journal 31.2 (1984), pp. 231–240. [Gla04] P Glasserman. Monte Carlo Methods in Financial Engineering

work page 1984