Ruqi Zhang, Muheng Li
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Recently, gradient-based discrete sampling has emerged as a highly efficient, general-purpose solver for various combinatorial optimization (CO) problems, achieving performance comparable to or surpassing the popular data-driven approaches. However, we identify a critical issue in these methods, which we term ''wandering in contours''. This behavior refers to sampling new different solutions that share very similar objective values for a long time, leading to computational inefficiency and suboptimal exploration of potential solutions. In this paper, we introduce a novel reheating mechanism inspired by the concept of critical temperature and specific heat in physics, aimed at overcoming this limitation. Empirically, our method demonstrates superiority over existing sampling-based and data-driven algorithms across a diverse array of CO problems.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2503.04047")
get_code_for_paper("2503.04047")
have("2503.04047")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2503.04047.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2503.04047)
Connect an agent — have() is free.