Research map / Learning theory and algorithms / Combinatorial and search optimization
Bilevel MCTS for Amortized O(1) Node Selection in Classical Planning
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.
Closest papers by meaning
- Online Robust Reinforcement Learning Through Monte-Carlo Planning (ICML 2025 · similarity 0.87)
- Graph-Based Stochastic-Power-UCT: Monte-Carlo Graph Search with Power Mean Estimation (NeurIPS 2026 · similarity 0.87)
- Provably Efficient Long-Horizon Exploration in Monte Carlo Tree Search through State Occupancy Regularization (ICML 2024 · similarity 0.87)
- Power Mean Estimation in Stochastic Continuous Monte-Carlo Tree Search (ICML 2025 · similarity 0.87)
- MALinZero: Efficient Low-Dimensional Search for Mastering Complex Multi-Agent Planning (NeurIPS 2025 · similarity 0.86)
- Speculative Monte-Carlo Tree Search (NeurIPS 2024 · similarity 0.86)
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.