Research map / Learning theory and algorithms / Combinatorial and search optimization
Learning dynamic polynomial proofs
Alhussein Fawzi, Mateusz Malinowski, Hamza Fawzi, Omar Fawzi
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use learned dynamic degree-2 proof search instead of the level-5 Sherali-Adams hierarchy | Maximum stable set · Random graphs n=50 | average estimated bound: 10.0 -> 8.89 | Improved |
| Use learned dynamic proof search instead of random legal actions | Maximum stable set · Random graphs n=50 | average estimated bound: 31.6 -> 8.89 | Improved |
| Use the symmetry-aware architecture instead of a vanilla linear input mapping (ablation) | Dynamic prover · Stable set n=20 | estimated upper bound | Improved |
Closest papers by meaning
- Automated Proof of Polynomial Inequalities via Reinforcement Learning (CVPR 2025 · similarity 0.93)
- Finding Simple Proofs for First-Order Optimization (NeurIPS 2026 · similarity 0.87)
- Reviving DSP for Advanced Theorem Proving in the Era of Reasoning Models (NeurIPS 2025 · similarity 0.85)
- Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms (NeurIPS 2025 · similarity 0.85)
- The Gradient of Algebraic Model Counting (AAAI 2025 · similarity 0.85)
- Learning Polynomial Problems with $SL(2, \mathbb{R})$-Equivariance (ICLR 2024 · similarity 0.85)
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.
