Research map / Learning theory and algorithms / Combinatorial and search optimization
Enriching Non-Parametric Bidirectional Search Algorithms
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use <= (MEAP-based) expansion policy instead of < in NBS (ablation) | NBS · 14 Pancake GAP-2 | nodes expanded to first solution: 209,723 -> 152,046 | Helped |
| use <= (MEAP-based) expansion policy instead of < in NBS (ablation) | NBS · DAO grids Octile | nodes expanded to first solution: 6,686 -> 6,888 | Hurt |
| use <= (MEAP-based) expansion policy instead of < in NBS (ablation) | NBS · 15 Puzzle MD | nodes expanded to find all optimal solutions: 28,117,879 -> 24,649,233 | Helped |
| replace NBS with dynamic vertex cover search (DVCBS_F vs NBS_F) | NBS_F · 14 Pancake GAP-2 | nodes expanded to find all optimal solutions: 1,393,062 -> 864,611 | Helped |
| replace NBS with dynamic vertex cover search (DVCBS_A vs NBS_A) | NBS_A · TOH4 6+6 | nodes expanded to first solution: 730,597 -> 691,159 | Helped |
| use <= policy in DVCBS (DVCBS_A vs DVCBS_F) (ablation) | DVCBS · epsilon-case 14 Pancake GAP-2 | nodes expanded to first solution: 87,012 -> 168,176 | Hurt |
| use DVCBS_Fe instead of A* for first solution | A* · 14 Pancake GAP-2 (epsilon-case) | nodes expanded to first solution: 322,938 -> 87,012 | Helped |
| use DVCBS_Fe instead of BS* | BS* · 15 Puzzle MD / Octile / 10+2 (epsilon-case) | nodes expanded to first solution | Mixed |
Closest papers by meaning
- A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search (AAAI 2020 · similarity 0.89)
- Bidirectional Search That Is Guaranteed to Meet in the Middle (AAAI 2016 · similarity 0.89)
- Anchor Search: A Unified Framework for Suboptimal Bidirectional Search (AAAI 2025 · similarity 0.87)
- Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation (ICML 2025 · similarity 0.84)
- Rectangle Search: An Anytime Beam Search (AAAI 2024 · similarity 0.82)
- A Near Linear Query Lower Bound for Submodular Maximization (ICML 2025 · similarity 0.82)
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.