Research map / Learning theory and algorithms / Combinatorial and search optimization
Local-Minima-Preserving Polynomial Relaxation of Ising Problems
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-$k$-Cut Problems (ICML 2025 · similarity 0.85)
- Tilted Sharpness-Aware Minimization (ICML 2025 · similarity 0.84)
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.84)
- The Multi-Block DC Function Class: Theory, Algorithms, and Applications (NeurIPS 2026 · similarity 0.84)
- On the Universal Near Optimality of Hedge in Combinatorial Settings (NeurIPS 2025 · similarity 0.84)
- Regularized Langevin Dynamics for Combinatorial Optimization (ICML 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.