arXiv (All)
open access
Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT
artificial-intelligencecomputation-and-languagemachine-learningnumerical-analysisoptimization-and-control
Because its binary optimization landscape contains exponentially many local optima, MAX-CUT is highly sensitive to initialization. We study Particle Polynomial Relaxation (PPR), a moment-based nonconvex continuous reformulation possessing an advantageous optimization landscape. We warm-start PPR wit
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Can Acceleration in Gradient-Norm Minimization Be Anytime? Sharp Last-Iterate Limits in Smooth Convex Optimization#972760
- Shifting-based Optimizable Linear Relaxations for General Activation Functions#290599
- An implicit multiscale solver for steady kinetic equations based on wave-particle decomposition#1355649
- Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes#821653
- Expander Hierarchies for Normalized Cuts on Graphs#163040
Record · ID 1344866
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive