AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Learning dynamic polynomial proofs

Alhussein Fawzi, Mateusz Malinowski, Hamza Fawzi, Omar Fawzi

NeurIPS 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 6 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use learned dynamic degree-2 proof search instead of the level-5 Sherali-Adams hierarchyMaximum stable set · Random graphs n=50average estimated bound: 10.0 -> 8.89Improved
Use learned dynamic proof search instead of random legal actionsMaximum stable set · Random graphs n=50average estimated bound: 31.6 -> 8.89Improved
Use the symmetry-aware architecture instead of a vanilla linear input mapping (ablation)Dynamic prover · Stable set n=20estimated upper boundImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy