arXiv (All)
open access
Graph-Based Stochastic Power-UCT: Monte-Carlo Graph Search with Power Mean Estimation
Tree-based Monte-Carlo Tree Search (MCTS) duplicates the same state when it is reached through different trajectories, which can waste simulations in stochastic MDPs. We introduce Graph-Based Stochastic-Power-UCT (GS-Power-UCT), which shares states reached at the same planning depth while keeping se
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
- Power Mean Estimation in Stochastic Continuous Monte Carlo Tree Search#974062
- The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions#1109770
- Optimal sampling strategies in event-chain Monte Carlo#1156930
- Discovering Temporal Structure: An Overview of Hierarchical Reinforcement Learning#997438
- Efficient Monte Carlo sampling of metastable systems using nonlocal collective variable updates#194417
Record · ID 1033738
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