Reproduce “Understanding Simulated Annealing: from Weak Poincaré Inequalities to a Discrete Optimal Transport Framework” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Yuchen He, Tianhui Jiang, Zhehan Lei, Sihan Wang, Chihao Zhang

The authors analyze annealing for uniform independent-set sampling in bipartite graphs, measuring how much probability mass a prescribed path must route through local transitions rather than requiring fast mixing at every temperature. Weak action permits a small residual of unrouted motion. For fixed degree imbalance and sufficiently large D, unrestricted single-site annealing achieves total-variation error τ in polynomial expected updates on finite simple (d,D)-biregular graphs; the guarantee does not cover arbitrary graphs or degree regimes.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.