arXiv (All)
open access
Value-Preserving Action Quantization
Search-based policy learning, such as Monte Carlo tree search (MCTS), offers the flexibility to trade runtime computation for data efficiency and adaptation to novel environments. For robot learning, however, applying search requires discretizing the continuous action space and associated dynamics,
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
- Active Exploration in Bayesian Model-based Reinforcement Learning for Robot Manipulation#1324452
- OGPO: Offline Goal-conditioned Policy Optimization for Recoverable Vision-Language-Action Models#1297266
- CAC-VLA: Context-Gated Action Conditioning for Vision-Language-Action Models#1109096
- Prioritized Rollouts for Efficient World Model-based Vision-Language-Action Policy Optimization#1037562
- Reinforcement Learning for Real-Time Vision-Language-Action Policies#1011901
Record · ID 1342128
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