Metraipolis › archive › dc_8234ae44ff18

Overcoming critical slowing down in frustrated spin systems by learned multiscale sampling — arXiv:2608.31114

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.31114
License (as archived)
CC0-1.0
Archived
2026-10-17T08:59:51.061Z
SHA-256 of the archived text
d388e5166bf4056f8a1b1503437cb0141e55017f4c6527ee80d7e32d1aea3135
Stable URL of this page
https://metraipolis.com/documento/dc_8234ae44ff18

How to cite

Overcoming critical slowing down in frustrated spin systems by learned multiscale sampling — arXiv:2608.31114 — arXiv (en), https://arxiv.org/abs/2608.31114 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8234ae44ff18 (Metraipolis archive dc_8234ae44ff18, sha256 d388e5166bf4056f8a1b1503437cb0141e55017f4c6527ee80d7e32d1aea3135)
BibTeX
@misc{dc8234ae44ff18,
  title = {Overcoming critical slowing down in frustrated spin systems by learned multiscale sampling — arXiv:2608.31114},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.31114},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8234ae44ff18; sha256 d388e5166bf4056f8a1b1503437cb0141e55017f4c6527ee80d7e32d1aea3135},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.31114. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Cluster algorithms, such as the Swendsen--Wang and Wolff methods, are among the most successful MCMC methods for mitigating critical slowing down in statistical systems. These constructive cluster algorithms, however, fail in the presence of even extremely weak frustration. Here, we sidestep this fundamental limitation by learning rather than constructing the relevant clusters. Specifically, we use the wavelet conditional renormalization group (WCRG) sampling method to learn the probability distribution of collective fluctuations of a frustrated two-dimensional soft-spin model. Configurations are then generated recursively from coarse to fine scales by sampling conditional wavelet distributions. The WCRG method reproduces the main statistical properties of the system across different phases, including the local-field distribution and the structure factor. At an Ising-like critical point, the conditional dynamics remains decorrelated within $\mathcal{O}(1)$ sweeps at each scale, yielding an overall sampling complexity of $\mathcal{O}(\log_2 L)$, thus making WCRG much more efficient than standard local MCMC methods. These results show that learned multiscale sampling can overcome critical slowing down in frustrated systems for which conventional cluster algorithms fail. By assessing the sampling accuracy of different observables, we also clarify the main tradeoff of the WCRG method: the accuracy of the fast sampling scheme depends on the expressiveness of the energy-based model used to estimate the wavelet conditional distributions.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-01 in stat.ML).
Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech) ; Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2608.31114 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T08:39:20.303Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).