Paper recorded by Signals 4 on 2026-10-23 in cs.AI. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-23 on arXiv · recorded by Signals 4 on 2026-10-26
Category: cs.AI · 人工智能 · first seen 2026-10-26
We learn schedules for a continuous penalty relaxation of MAX-CUT by backpropagating through an unrolled classical solver. A state-blind schedule generalizes to instances substantially larger than those used for training. A state-adaptive bilinear schedule also generalizes out of distribution, outperforming its untrained baseline across 15 seeds ($t=4.1$). By contrast, an additive ablation with id