arXiv (OAI Expanded)
open access
Particle Monte Carlo Tree Search
Monte Carlo Tree Search (MCTS) is a widely used approach for policy improvement and action selection in Reinforcement Learning. Due to its sequential and deterministic nature, principled runtime-scaling of MCTS with parallel compute remains a major challenge. We introduce Particle MCTS (PMCTS), a pa
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
- PMCTS: Principled Parallelized Inference Time Scaling with Particle Monte Carlo Tree Search#974416
- TOUR: A Trajectory-Level Unlearning Benchmark for Offline Reinforcement Learning#394431
- You've Got a Golden Ticket: Improving Generative Robot Policies With A Single Noise Vector#1199774
- A Balanced Data Diet: Addressing the Exploration Bottleneck in Mega-Scale RL for Robot Control#1249889
- A Balanced Data Diet: Addressing the Exploration Bottleneck in Mega-Scale RL for Robot Control#1242724
Record · ID 1393808
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