Optimal Simulated Annealing for Partition Function Estimation

๐Ÿ“… 2026-09-17
๐Ÿ“ˆ Citations: 0
โœจ Influential: 0
๐Ÿ“„ PDF
๐Ÿค– AI Summary
ๆœฌๆ–‡้€š่ฟ‡้ž่‡ช้€‚ๅบ”ๆจกๆ‹Ÿ้€€็ซ็ฎ—ๆณ•ๆœ‰ๆ•ˆไผฐ่ฎกๅ‰ๅธƒๆ–ฏๅˆ†ๅธƒ็š„้…ๅˆ†ๅ‡ฝๆ•ฐ๏ผŒๆไพ›ๆœ€้ซ˜ๆ•ˆๆ–นๆณ•๏ผŒๅนถ่ฏๆ˜Žไบ†่ฏฅ็ฎ—ๆณ•ๅœจๅนฟๆณ›ๅ‚ๆ•ฐ่Œƒๅ›ดๅ†…็š„ๆœ€ไผ˜ๆ€งใ€‚
๐Ÿ“ Abstract
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.
Problem

Research questions and friction points this paper is trying to address.

partition function
Gibbs distributions
simulated annealing
Innovation

Methods, ideas, or system contributions that make the work stand out.

non-adaptive simulated annealing
partition function
Gibbs distributions
optimal algorithm
๐Ÿ’ผ Related Jobs
No related jobs found.
Heng Guo
Heng Guo
University of Edinburgh
Algorithms and complexity
H
Hongyang Liu
School of Computer Science, State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, Nanjing, China
X
Xiongxin Yang
Department of Computer Science, University of California, Santa Barbara, United States
Yitong Yin
Yitong Yin
Nanjing University
theoretical computer science
Y
Yiyao Zhang
School of Computer Science, State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University, Nanjing, China