Research map / Learning theory and algorithms / Combinatorial and search optimization
Hard Examples for Common Variable Decision Heuristics
Marc Vinyals
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 |
|---|---|---|---|
| embed Tseitin formula in pitfall formula Phi(45,6) vs standalone Ts(45) | CaDiCaL (VMTF) · Phi(45,6) | mean CPU time (s): 3331 -> 2228 | Improved |
| use CHB/Glucose/LRB on pitfall formula instead of standalone Tseitin | Glucose (VSIDS) · Phi(45,6) vs Ts(45) | mean CPU time (s): 754 -> 1917 | Hurt |
| replace conflict-based heuristics with static variable order Y,X,Z,P,A | Glucose · Phi(45,6) | mean CPU time (s): 1917 -> < 1 | Improved |
| replace conflict-based heuristics with static variable order | Glucose · Phi(50,8) | mean CPU time (s): 3600 -> < 1 | Improved |
| static order on standalone Tseitin formula | Glucose · Ts(45) | mean CPU time (s): 754 -> 3600 | Hurt |
| interleave random decisions (probability about 0.2) with VSIDS (ablation) | Glucose · pitfall formulas | mean runtime | Improved |
| randomize variable polarities (initial phase) (ablation) | CaDiCaL, Glucose, MapleSAT LRB · pitfall formulas | runtime | Mixed |
Closest papers by meaning
- Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs (AAAI 2024 · similarity 0.86)
- Guiding CDCL SAT Search via Random Exploration amid Conflict Depression (AAAI 2020 · similarity 0.86)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.83)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.80)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.80)
- NeuroBack: Improving CDCL SAT Solving using Graph Neural Networks (ICLR 2024 · similarity 0.79)
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.
