arXiv (All)
open access
Power Mean Estimation in Stochastic Continuous Monte Carlo Tree Search
Monte Carlo Tree Search (MCTS) has demonstrated success in online planning for deterministic environments, yet significant challenges remain in adapting it to stochastic Markov Decision Processes (MDPs), particularly in continuous state-action spaces. Existing methods, such as HOOT, which combines M
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Graph-Based Stochastic Power-UCT: Monte-Carlo Graph Search with Power Mean Estimation#1033738
- Online Robust Reinforcement Learning Through Monte-Carlo Planning#1012776
- Online Robust Reinforcement Learning Through Monte-Carlo Planning#965436
- OneDSE: Metric-Conditioned Inverse Modeling and Active Search for Sample-Efficient DSE#625470
- OneDSE: Metric-Conditioned Inverse Modeling and Active Search for Sample-Efficient DSE#623197
Record · ID 974062
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive