Research map / Learning theory and algorithms / Combinatorial and search optimization
Nested Depth Search
Junkang Li, Tristan Cazenave, Swann Legras, Arthur Queffelec, Veronique Ventos
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 |
|---|---|---|---|
| increase depth from 1 to 2 (stride 1) (ablation) | NDS level 1 · LMP(8) | average score: 6.61 -> 7.07 | Improved |
| increase stride from 1 to 2 (depth 2) (ablation) | NDS level 1 · LMP(8) | average score: 7.07 -> 6.80 | Hurt |
| use D2S2 instead of NMCS (D1S1) (ablation) | NDS level 1 · LMP(8) | average score: 6.61 -> 6.80 | Improved |
| use D2S2 instead of NMCS (D1S1) (ablation) | NDS level 2 · LMP(8) | average score: 7.57 -> 7.65 | Improved |
| replace best state on equal score (NDSr vs NDS) (ablation) | NDS (1,1,1) · LMP(8) | average score: 6.61 -> 6.75 | Improved |
| replace best state on equal score (NDSr vs NDS) (ablation) | NDS level 3 D2S2 · LMP(8) | average score: 7.90 -> 7.90 | No clear effect |
| use D2S2 instead of NMCS (ablation) | NDS level 2 · MSA edit distance n=4 | sum of edit distances: 92 900 -> 92 267 | Improved |
| use D2S2 instead of NMCS (ablation) | NDS level 1 · MSA edit distance n=3 | sum of edit distances: 47 374 -> 47 182 | Improved |
| use D2S2-NDSr instead of NMCSr (ablation) | NDSr · Set Cover scp43 | best score (lower better) | Mixed |
| use D2S1-NDSr (ablation) | NDSr · Set Cover scp43 | best score: around 1-2% improvement | Improved |
Closest papers by meaning
- Depth-First Proof-Number Search with Heuristic Edge Cost and Application to Chemical Synthesis Planning (NeurIPS 2019 · similarity 0.85)
- SeeA*: Efficient Exploration-Enhanced A* Search by Selective Sampling (NeurIPS 2024 · similarity 0.82)
- An Efficient Algorithm for Thresholding Monte Carlo Tree Search (NeurIPS 2026 · similarity 0.82)
- Improving Monte Carlo Tree Search for Symbolic Regression (NeurIPS 2025 · similarity 0.82)
- Epistemic Monte Carlo Tree Search (ICLR 2025 · similarity 0.81)
- Monte-Carlo Tree Search with Uncertainty Propagation via Optimal Transport (ICML 2025 · similarity 0.81)
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.
