Metraipolis › archive › dc_89ffe8ade927
Optimal Simulated Annealing for Partition Function Estimation — arXiv:2609.20337
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20337
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T05:39:45.826Z
- SHA-256 of the archived text
1ef137a59c93bb8879fcec88b390936f004c0e9e7160feba568b15d234b591fc- Stable URL of this page
https://metraipolis.com/documento/dc_89ffe8ade927
How to cite
Optimal Simulated Annealing for Partition Function Estimation — arXiv:2609.20337 — arXiv (en), https://arxiv.org/abs/2609.20337 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_89ffe8ade927 (Metraipolis archive dc_89ffe8ade927, sha256 1ef137a59c93bb8879fcec88b390936f004c0e9e7160feba568b15d234b591fc)
BibTeX
@misc{dc89ffe8ade927,
title = {Optimal Simulated Annealing for Partition Function Estimation — arXiv:2609.20337},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20337},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_89ffe8ade927; sha256 1ef137a59c93bb8879fcec88b390936f004c0e9e7160feba568b15d234b591fc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20337. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this note, we give a simple analysis of a non-adaptive simulated annealing algorithm for estimating the partition function of Gibbs distributions. This yields the most efficient reduction of this kind so far. We also establish lower bounds for both general and non-adaptive algorithms, showing that our algorithm is optimal over a broad range of parameters. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in cs.DS). Categorie arXiv: Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2609.20337 — 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-10T05:08:06.572Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).