arXiv (All)
open access
Optimal Simulated Annealing for Partition Function Estimation
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 tha
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
- Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions#1049566
- A more efficient algorithm to compute the Rand Index for change-point problems#665417
- A more efficient algorithm to compute the Rand Index for change-point problems#663917
- An (almost) efficient classical algorithm for sampling from typical Gibbs states#1154512
- An $O\big((5/3)^n\mathrm{poly}(n)\big)$ One-Sided Monte Carlo Algorithm for Equal Subset Sum#971845
Record · ID 1034101
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