AI & ML
ExRL: Sample-Efficient Online Adaptation of Long-Chunk Policies via Execution Length Control
arXiv cs.RO0 views
arXiv:2611.13482v1 Announce Type: new Abstract: Predicting long action chunks, often spanning dozens of timesteps, has become a key ingredient in increasingly capable robot policies. In this paper, we find that adapting these long-chunk policies with existing reinforcement learning (RL) methods can require many online samples due to the high dimensionality of the action chunks being optimized, making such adaptation impractical in real-world scenarios where interaction data are costly to collect. Our key insight is to shift adaptation from optimizing actions to optimizing how long to execute each predicted action chunk. This keeps the adaptation space low-dimensional while its expressivity grows with the chunk size. We thus introduce Execution at the Right Length (ExRL), a simple approach which augments the base policy with a lightweight adapter that predicts the execution length of each chunk and is trained using off-policy RL algorithms. Across simulation benchmarks and real-world robotic tasks, ExRL enables sample-efficient adaptation of a diverse range of long-chunk policies with minimal task-specific hyperparameter tuning.
Source:https://arxiv.org/abs/2611.13482PreviousRhythmic-Semantic Co-Speech Gestures for Emotional Dialogue in RobotsNextRoute-Time Conflict Maps for Cooperative End-to-End Autonomous Driving
Related posts
SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
0arXiv cs.CR
Auditing Cross-Lingual Fairness in Language Model Watermarking
0arXiv cs.CR
Do Reasoning LLMs Refuse What They Infer in Long Contexts?
0arXiv cs.CR
Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
0arXiv cs.CR
RoCoMark: Robust Code Watermarking Against LLM-Based Functionality-Preserving Rewriting Attacks
0arXiv cs.CR
Design and Evaluation of Secure Distributed Chaotic Image Encryption on ESP32-S3
0arXiv cs.CR