Graph coarsening enables escaping local optima in compute-constrained nonconvex MAX-CUT; arXiv:2610.19043v1 investigates CMG-warmed PPR to improve initialization
Read the original at arxiv.org→arXiv:2610.19043v1 Announce Type: new Abstract: Because its binary optimization landscape contains exponentially many local optima, MAX-CUT is highly sensitive to initialization. We study Particle Polynomial...
Original headline: "Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT"
Coverage timeline
- Oct 15, 04:00 UTC arXiv cs.LG lead source Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT