Sampling from the Sherrington-Kirkpatrick model up to β<1/2

Sampling from the Sherrington-Kirkpatrick model up to β<1/2

🎙 Holden Lee 👥 75K 📅 August 5, 2026 ⏱ 46 min 👁 259 📄 original study 🧭 2026-08-07
Available in: English (current) Français

Keywords

Sherrington-Kirkpatrick modelsamplingdiffusion modelsstochastic localizationreplica symmetry

Summary

The talk presents a polynomial-time algorithm to sample from the Gibbs measure of the Sherrington-Kirkpatrick (SK) model with negligible total-variation distance for inverse temperature β < 1/2. The algorithm is based on algorithmic stochastic localization (a diffusion model) and Jarzynski’s equality with rejection sampling. The proof uses the potential Hessian ascent framework, combining covariance estimates of tilted Gibbs distributions via Gaussian integration by parts, overlap concentration, and precise cavity estimates. A free probability argument controls the diagonal sub-algebra of the Hessian, and functional inequalities for localized distributions are employed. Prior work achieved TV distance guarantees only up to β ≈ 0.295, while results covering the entire replica-symmetric regime β < 1 gave only non-trivial Wasserstein distance guarantees. The talk also shows how to use regularity properties of the diffusion process to conclude a weak Poincaré inequality for the SK model and simplify the algorithm. The work demonstrates how diffusion model theory can solve challenging sampling problems. Joint work with Ewan Davies, Juspreet Singh Sandhu, and Jonathan Shi.

167 words

Critical Evaluation

The talk presents a significant advancement in the sampling problem for the Sherrington-Kirkpatrick model, a central model in statistical physics and theoretical computer science. The speaker, Holden Lee, clearly explains the problem, prior work, and the new contributions. The technical content is rigorous, with detailed proofs and references to established techniques. The algorithm is based on algorithmic stochastic localization, which is a diffusion model, and the proof leverages several sophisticated tools from probability theory and statistical physics. The results extend the regime for which negligible total-variation distance sampling is possible from β ≈ 0.295 to β < 1/2, a substantial improvement. The talk also discusses a simplified algorithm based on a weak Poincaré inequality, which is a nice contribution. The presentation is well-structured, with clear explanations of the key ideas and technical challenges. The sources cited are appropriate, including prior work by Anari, Koehler, Vuong, El Alaoui, Montanari, Sellke, and Celentano. The title accurately reflects the content. Overall, this is an excellent talk that presents original research of high quality. The only minor limitation is that the talk is highly technical and may not be accessible to a general audience, but this is not a flaw given the target audience of the Simons Institute. The speaker handles audience questions well, clarifying the transition point and the need for global convexity. The talk is a valuable contribution to the field and is likely to influence future research on sampling from random distributions.

241 words

Title / Content Match

The title accurately reflects the content, which focuses on sampling from the SK model up to β&lt;1/2.

Quality & Reliability

9/10

Presentation of original research with rigorous mathematical proofs, published by a reputable institute (Simons Institute), and joint work with multiple researchers. The talk includes detailed technical arguments and references to prior work.

Key Moments

Cited Sources

Concurring Sources

Contribution & Novelties

The talk presents a novel algorithm for sampling from the SK model up to β<1/2 with negligible TV distance, improving on previous results. It also introduces a simplified algorithm based on a weak Poincaré inequality. The work demonstrates the power of diffusion model theory in solving sampling problems.

Pour aller plus loin :

91 words

Radar Profile

The radar profile shows high scores across all dimensions, indicating a technically deep and reliable presentation. The talk is particularly strong in technical level and information quality, with slightly lower but still high scores in quantity and reliability.

Reliability 9/10

💬 No comments were provided for analysis.