arXiv (All)
open access
Sampling from Spherical Spin Glasses in Total Variation via Algorithmic Stochastic Localization
We consider the problem of algorithmically sampling from the Gibbs measure of a mixed $p$-spin spherical spin glass. We give a polynomial-time algorithm that samples from the Gibbs measure up to vanishing total variation error, for any model whose mixture satisfies $$ ξ''(s) < \frac{1}{(1-s)^2}, \
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Manifold Sampling via Entropy Maximization#178899
- A Universal Lower Bound for the Complexity of Gaussian-Divisible Spin Glasses#1388190
- Optimal mixing of the systematic scan dynamics via approximate tensorization of entropy#972795
- Cost Comparisons for Random and Deterministic Scans in Component-Wise Markov Chains#1156056
- Instance-Optimal Adaptive Location Estimation via Multiscale Mid-Summaries#1034545
Record · ID 1422704
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive