Research map / Learning theory and algorithms / Combinatorial and search optimization
Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search
Maximilian Fickert, Tianyi Gu, Leonhard Staut, Wheeler Ruml, Joerg Hoffmann, Marek Petrik
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 |
|---|---|---|---|
| replace assumption-based beliefs with data-driven belief distributions | Nancy (pers.) · Transport (60) L=100 | solution cost: 615 -> 496 | Improved |
| replace assumption-based beliefs with data | Nancy (pers.) · Blocksworld L=1000 | solution cost: 32 -> 27 | Improved |
| replace assumption-based beliefs with data | Nancy (pers.) · Transport unit-cost L=100 | solution cost: 40 -> 31 | Improved |
| replace assumption-based beliefs with data | Nancy (pers.) · Elevators unit-cost L=300 | solution cost: 29 -> 30 | No clear effect |
| make Nancy persistent (ablation) | Nancy · Blocksworld L=100 | solution cost: 67 -> 33 | Improved |
| make Nancy persistent (ablation) | Nancy · Transport (60) L=100 | solution cost: 1116 -> 615 | Improved |
| make Nancy persistent (ablation) | Nancy · Transport unit-cost L=100 | solution cost: 79 -> 40 | Improved |
| use data-driven Nancy instead of LSS-LRTA* | Nancy (DD) · Transport (60) L=1000 | solution cost: 499 -> 422 | Improved |
| use persistent assumption-based Nancy instead of LSS-LRTA* (ablation) | Nancy (pers.) · Transport (60) L=300 | solution cost: 519 -> 559 | Hurt |
| increase lookahead from 100 to 1000 nodes (ablation) | LSS-LRTA* · Transport (60) | solution cost: 631 -> 499 | Improved |
| data-driven Nancy instead of assumption-based Nancy on uniform-cost 15-puzzle | Nancy (DD) · 15-puzzle uniform-cost | solution cost | Hurt |
| data-driven Nancy instead of assumption-based Nancy on heavy-cost 15-puzzle at L>=300 | Nancy (DD) · 15-puzzle heavy-cost | solution cost | Improved |
Closest papers by meaning
- Sample, Scrutinize and Scale: Effective Inference-Time Search by Scaling Verification (ICML 2025 · similarity 0.84)
- What If We Allocate Test-Time Compute Adaptively? (ICML 2026 · similarity 0.84)
- Optimizing Test-Time Compute via Meta Reinforcement Finetuning (ICML 2025 · similarity 0.84)
- SD-Search: Hindsight Self-Distillation for Search-Augmented Reasoning (NeurIPS 2026 · similarity 0.83)
- Martingale Score: An Unsupervised Metric for Bayesian Rationality in LLM Reasoning (NeurIPS 2025 · similarity 0.83)
- A Theoretical Study on Bridging Internal Probability and Self-Consistency for LLM Reasoning (NeurIPS 2025 · similarity 0.83)
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.
