2026
Local-Minima-Preserving Polynomial Relaxation of Ising Problems
ICML 2026poster
The generalized Ising problem captures a broad spectrum of hard combinatorial problems, including MAX-CUT, Number Partitioning (NPP), and Maximum Independent Set. In this work, we consider the notion of one-flip local minima for this problem. We construct a polynomial relaxation and prove that there…