<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom"><title>Embodied AI Radar — Robot Learning: RL &amp; Imitation</title>
<link href="https://embodied-ai-radar.com/"/><link rel="self" href="https://embodied-ai-radar.com/topics/learning.xml"/><id>https://embodied-ai-radar.com/topics/learning.xml</id>
<updated>2026-11-10T00:00:00Z</updated><author><name>Embodied AI Radar</name></author>
<entry><title>DreamLander: A 6-DOF World Model based Reinforcement Learning Planetary Lander</title><id>https://arxiv.org/abs/2611.12824</id>
<link href="https://arxiv.org/abs/2611.12824"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Soft powered descent landings are becoming evermore important in the field of space exploration and scientific advancement, because of their ability to deliver mission critical payloads, both highly accurately and safely. The high efficiency restriction on planetary landings due to the severely limited fuel supply results in the need for optimal guidance trajectories and control. Model based reinforcement learning is proving to be an important tool in simplifying the highly complex process of generating optimal guidance trajectories and control. In this work, we present DreamLander, a state …</summary></entry><entry><title>Simulation-aided Reinforcement Learning with Control Variates</title><id>https://arxiv.org/abs/2611.12643</id>
<link href="https://arxiv.org/abs/2611.12643"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Reinforcement Learning (RL) algorithms often rely on data collected from a target environment, which can be expensive and noisy. Although simulators can generate large amounts of additional data, standard simulation mixing approaches, which directly combine simulated and real experience, can degrade performance due to simulator inaccuracies, especially when they bias the solution away from the optimal policy. We propose a conservative simulation-aided learning method based on control variates, where simulated data is used solely to reduce variance in the learning process rather than directly …</summary></entry><entry><title>RAIL: Representation-Aligned Imitation Learning for Student-Compatible Teacher Policies</title><id>https://arxiv.org/abs/2611.12251</id>
<link href="https://arxiv.org/abs/2611.12251"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Reinforcement learning (RL) from raw sensory inputs such as images or onboard sensors can be challenging due to high-dimensional observations and sparse rewards. A common strategy is to train a teacher policy with access to privileged state information and then distill it into a student policy that acts from raw inputs alone. However, when the teacher relies on information unavailable to the student, exact imitation may be impossible, creating an irreducible imitation gap. Existing approaches typically mitigate this mismatch through careful reward shaping or additional reinforcement learning …</summary></entry><entry><title>Graph-Based RL for Sequential Rendezvous Planning with Multiple Patrolling USVs</title><id>https://arxiv.org/abs/2611.12205</id>
<link href="https://arxiv.org/abs/2611.12205"/><updated>2026-11-10T00:00:00Z</updated>
<summary>In patrol missions involving multiple unmanned surface vehicles (USVs), a designated command USV can support fleet management by sequentially rendezvousing with each patrolling USV. These operations require motion-feasible route planning and priority-aware rendezvous sequencing, with the objective of minimizing mission completion time and total tardiness relative to priority-dependent due dates. We propose a framework combining grid-based path planning, surrogate travel-time prediction, and graph-based reinforcement learning. The path planner accounts for ocean currents and approximates …</summary></entry><entry><title>The Relative Value of Demonstration Data: Execution Time Limits and Operator Mixtures in Behavior Cloning</title><id>https://arxiv.org/abs/2611.11947</id>
<link href="https://arxiv.org/abs/2611.11947"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Robot demonstration datasets combine demonstrations from teleoperators of uneven experience, so collection teams need to know how many demonstrations from one group match those from another. We measure this with a data multiple: the ratio of the numbers of demonstrations two groups need for their policies to reach the same success rate. On robomimic&#x27;s simulated Square and Can tasks, we train behavior-cloning policies on demonstrations from the two teleoperators robomimic labels Better and the two it labels Worse, varying dataset size and the share of Worse demonstrations. On Square, within …</summary></entry><entry><title>Distilling Instructions into Weights: Closed-Form Edits Fix a Robot Policy&#x27;s Misreading</title><id>https://arxiv.org/abs/2611.11894</id>
<link href="https://arxiv.org/abs/2611.11894"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Generalist robot policies often fail at one step of a task they can otherwise perform. We ask whether such a failure can be repaired by editing the policy&#x27;s weights directly, without gradients, training data, or a change to the instruction. Told to put the cube then the banana in the bowl, a zero-shot $π_{0.5}$ vision-language-action policy in RoboLab releases the cube before it reaches the bowl. Replaying 21 of these decisions under rewordings shows that it binds &quot;in the bowl&quot; to the wrong object. Closed-form instruction distillation copies the per-layer effect of an explicit rewording into …</summary></entry><entry><title>Fade to... Red? Scheduling Coloured Noise Exploration Supports Efficient Robot Learning with Reduced Movement Jerk</title><id>https://arxiv.org/abs/2611.11868</id>
<link href="https://arxiv.org/abs/2611.11868"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Exploration in deep reinforcement learning (RL) for continuous control is commonly driven by temporally uncorrelated Gaussian (white) action noise, which leads to jerky motions with locally constrained exploration. In contrast, temporally correlated coloured noise, particularly pink noise, has been shown to support more efficient exploration in RL. Motivated by these findings, we inquire whether scheduling changes to the noise colour over the course of training can outperform white noise for continuous control robotics. We perform a systematic study of 49 linear schedules between white and …</summary></entry><entry><title>Accelerated Reinforcement Learning for Soft Robotics: Hours Instead of Years</title><id>https://arxiv.org/abs/2611.11718</id>
<link href="https://arxiv.org/abs/2611.11718"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Reinforcement learning (RL) requires large amounts of interaction data or a reliable simulator, both hard to obtain for nonlinear soft robotic hardware. Recent work shows that a time-scale separation inherent to soft robot dynamics justifies their reduction to low-dimensional invariant manifolds, known as adiabatic spectral submanifolds (aSSMs). We demonstrate that an aSSM-reduced model, a simple polynomial ordinary differential equation learned purely from pre-collected data, can serve as an RL training environment. On a pneumatically actuated soft arm, we train a trajectory-tracking policy …</summary></entry><entry><title>Off-Policy RL with Online Inference Tuning: My Solution to the CoRL 2026 RoboEval Challenge</title><id>https://arxiv.org/abs/2611.11464</id>
<link href="https://arxiv.org/abs/2611.11464"/><updated>2026-11-10T00:00:00Z</updated>
<summary>The CoRL 2026 RoboEval challenge has eight bimanual tasks, and it ranks a policy not only on whether it succeeds but on how: every stage of the task, done safely, efficiently and with both arms in coordination, scored against human demonstrations. My solution has two parts. The generic part, carried over from my LeHome challenge solution, is off-policy RL on a $π_{0.5}$-based policy that is also its own value function. It is trained with AWR and RECAP on advantages of the exact official score, in a loop where every rollout is at the same time a Thompson-sampling trial of about 20 inference …</summary></entry><entry><title>Explicitly capturing demonstrator multi-modality for distillation into diffusion policies</title><id>https://arxiv.org/abs/2611.10949</id>
<link href="https://arxiv.org/abs/2611.10949"/><updated>2026-11-10T00:00:00Z</updated>
<summary>The diversity of a distilled diffusion policy&#x27;s outputs matters beyond how it impacts the policy&#x27;s success rate. In particular, downstream applications like test-time search and policy improvement require exploration. Thus, we want to distill multi-modal demonstrators into diffusion policies which reproduce their conditional action distributions. Standard data collection for behavior cloning applies a sliding window to demonstration episodes, which pairs unique observation histories with actions. These datasets can be fit by a policy that is either multi-modal, or unimodal with high Lipschitz …</summary></entry><entry><title>BRACE: Belief-guided Residual Adaptive Control for Safe Navigation under Unknown Disturbances</title><id>https://arxiv.org/abs/2611.10938</id>
<link href="https://arxiv.org/abs/2611.10938"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Disturbances encountered during autonomous navigation generally vary across space, often discontinuously, as obstacles redirect wind and changing terrain alters traction. Tracking controllers typically assume sufficient control authority to mitigate disturbances and maintain safety; the regime where this assumption fails remains underexplored. We present Belief-guided Residual Adaptive Control (BRACE), a hierarchical reinforcement learning (RL) framework for reach-avoid navigation under unknown, bounded, spatially varying disturbances. BRACE infers a disturbance belief from model prediction …</summary></entry><entry><title>DreamVLA: From Generated Human Motions to Humanoid Vision-Language-Action Policies</title><id>https://arxiv.org/abs/2611.10872</id>
<link href="https://arxiv.org/abs/2611.10872"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Training vision-language-action (VLA) policies typically depends on substantial robot demonstration data, making human teleoperation a costly and cumbersome bottleneck, particularly for whole-body humanoid interaction. Reinforcement learning in simulation offers an alternative for scaling this data, but designing task-specific rewards remains challenging. To address this, we propose DreamVLA, which uses generated motion trajectories to guide reinforcement learning (RL) in simulation, converting them into reliable task execution trajectories. These trajectories train VLA models in simulation …</summary></entry><entry><title>Learning When to Think: Adaptive Internal Computation for Reinforcement Learning</title><id>https://arxiv.org/abs/2611.10822</id>
<link href="https://arxiv.org/abs/2611.10822"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Iterative neural policies usually spend the same computation on every decision, although the benefit of additional processing varies across states. We introduce Adaptive Internal Computation (AIC), an iterative policy that learns when to stop refining its latent representation and act. In AIC, we train action selection and stopping jointly, an expected-depth penalty values computation and intermediate value predictions provide auxiliary supervision. We show that when only some states benefit from further refinement, an ideal state-dependent allocator outperforms every state-independent …</summary></entry><entry><title>Look Ahead: Search-Driven Reasoning in Embodied AI</title><id>https://arxiv.org/abs/2611.10769</id>
<link href="https://arxiv.org/abs/2611.10769"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Search allows a robotic policy to evaluate candidate futures before committing to an action. Motivated by test-time planning for vision-language action (VLA) models, we study selective search over action chunks in PushT using a frozen Action Chunking with Transformers (ACT) policy. Beam search generates perturbed alternatives around the policy prediction and scores them through rollouts from cloned simulator states. Across 50 evaluation episodes, beam search raises task success from 0% to 18% and increases average cumulative reward from 39.44 to 103.2. We introduce One Step Ahead (OSA), a …</summary></entry><entry><title>Model-Based Imitation Learning For Monocular Vision-Based Navigation</title><id>https://arxiv.org/abs/2611.10635</id>
<link href="https://arxiv.org/abs/2611.10635"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Reliable navigation with a single monocular limited field-of-view camera is challenging because the lack of depth measurements and limited spatial awareness complicate collision checking. Existing approaches to tackle these challenges fall into two categories. Model-based planners can incorporate explicit collision-avoidance guidance which leads to better generalization but are often computationally expensive and require manual tuning of the algorithmic parameters. In contrast, end-to-end approaches trained by imitation learning can be flexible but typically encode safety only implicitly and …</summary></entry><entry><title>Grip, Trace, Write: Force-Aware Imitation and Reinforcement Learning for High-DoF Robotic Handwriting</title><id>https://arxiv.org/abs/2611.10451</id>
<link href="https://arxiv.org/abs/2611.10451"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Most robotic handwriting rigidly mounts the pen and reduces writing to trajectory tracking. A freely held pen instead couples grasp stability, tip motion, and contact force. We present Grip, Trace, Write, a force-aware simulation environment and learning framework for high-DoF handwriting. A two-branch actor separates pen retention from arm-wrist writing while preserving their closed-loop coupling. Training learns a grasp controller, initializes writing from inverse-kinematics demonstrations by behavior cloning, and improves writing through reinforcement learning with rewards on ink, force, …</summary></entry><entry><title>Deploying Physically and Epistemically Compliant Agents by Distilling Belief-Space Task and Motion Planners</title><id>https://arxiv.org/abs/2611.10430</id>
<link href="https://arxiv.org/abs/2611.10430"/><updated>2026-11-10T00:00:00Z</updated>
<summary>In this work, we train agents to act under uncertainty according to specified, belief-dependent rules. Deep reinforcement learning (RL) can in theory train agents to follow rules if encoded into well-designed rewards, but in practice, RL fails to perfectly optimize these rewards, leading to ineffective or noncompliant agent behavior. Belief-space planners by construction produce behavior in line with developer specification, but require hand-programming online planners and belief-state estimators, adding significant engineering complexity at scale. We combine the two: we plan offline to …</summary></entry><entry><title>Detecting and Explaining Robot Policy Failures from Sparse Internal Features</title><id>https://arxiv.org/abs/2611.10400</id>
<link href="https://arxiv.org/abs/2611.10400"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Visuomotor policies can handle many robot manipulation tasks, but understanding their failures remains difficult. Unfamiliar conditions and small action errors can lead to failure, yet watching the robot alone tells us little about what went wrong inside the policy. We introduce MIND (Mechanistic Interpretability for Neural Diagnosis), a method that looks inside a trained policy to detect failures during execution and identify the internal concepts involved. MIND uses a sparse autoencoder to break down the policy&#x27;s internal activations into features that can be studied individually. We give …</summary></entry><entry><title>GUARD: Anomaly-Informed Q-Steering for Generative Robot Policies in Dexterous Manipulation</title><id>https://arxiv.org/abs/2611.10343</id>
<link href="https://arxiv.org/abs/2611.10343"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Generative robot policies based on diffusion and flow matching can model complex, multimodal behaviors, but remain susceptible to covariate shift during closed-loop execution. Existing approaches mitigate such failures through additional demonstrations, policy fine-tuning, or test-time guidance, but often require human intervention, engineered rewards, or other task-specific signals. We introduce GUARD, an anomaly-informed Q-steering framework that leverages the policy&#x27;s training distribution to construct a dense, failure-anticipatory steering signal. GUARD pairs sparse task rewards with …</summary></entry><entry><title>Who Taught the Robot That? Removing One User&#x27;s Corrections from a Robot Policy That Learns Online</title><id>https://arxiv.org/abs/2611.10280</id>
<link href="https://arxiv.org/abs/2611.10280"/><updated>2026-11-10T00:00:00Z</updated>
<summary>A robot that keeps learning after deployment is corrected by several people in turn, and one of them may later ask to be removed. We show that whether the robot can forget that person depends on how people correct it. The goal of removal is the robot that would exist if the person had never been there, which we compute exactly in two simulated tasks with scripted users. When users correct the robot by taking over control, an ordered log of training updates is enough: retraining on the remaining sessions in their original order gives a robot as close to the goal as training noise allows. …</summary></entry><entry><title>Efficient Learning of Differentiable MPC Policies on the GPU via Smoothed ADMM and First-Order Reinforcement Learning</title><id>https://arxiv.org/abs/2611.09937</id>
<link href="https://arxiv.org/abs/2611.09937"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Differentiable model predictive control (MPC) enables structured, constraint-aware policies to be optimized end-to-end. However, learning MPC policies faces two bottlenecks: (1) nonsmooth sensitivities at active-set transitions and (2) expensive policy evaluation, since each requires an optimization solve. We first introduce SmoothedTurboMPC, a GPU-parallel differentiable MPC solver combining sequential quadratic programming (SQP) with a log-barrier-smoothed alternating direction method of multipliers (ADMM) inner solver. Its design enables smooth gradients, exact sensitivities at …</summary></entry><entry><title>Preference-Augmented Distributional Reinforcement Learning for Risk-Sensitive Navigation</title><id>https://arxiv.org/abs/2611.09932</id>
<link href="https://arxiv.org/abs/2611.09932"/><updated>2026-11-10T00:00:00Z</updated>
<summary>Ensuring safe and reliable navigation under diverse sources of uncertainty remains a central challenge for autonomous systems. Within distributional reinforcement learning (DistRL), Implicit Quantile Networks (IQN) have attracted interest for navigation under uncertainty because they enable risk adaptation through flexible quantile sampling. Existing approaches, however, typically use a fixed or randomly sampled Conditional Value-at-Risk (CVaR) level during training and adjust the risk level during deployment using hand-tuned hyperparameters or external sensor signals. This scalar-CVaR …</summary></entry><entry><title>Autonomous Particle Image Velocimetry Using Zero-Shot Sim-to-Real Reinforcement Learning</title><id>https://arxiv.org/abs/2611.09679</id>
<link href="https://arxiv.org/abs/2611.09679"/><updated>2026-11-09T00:00:00Z</updated>
<summary>Particle image velocimetry (PIV) reconstructs a flow field from the motion of tracer particles but the reconstruction quality is bounded by how well the flow structure of interest is resolved in the images. The acquisition position is typically fixed by the operator before the measurement. We cast camera placement as a sequential decision-making problem and train a reinforcement learning agent to control a 6-DoF manipulator equipped with a camera, enabling it to locate, frame and resolve a hydrofoil wake in a water tunnel. The agent commands the camera pose and observes the scene only through …</summary></entry><entry><title>Horizon-Coupled Obstacle Guidance for Relative-Action Diffusion Policies</title><id>https://arxiv.org/abs/2611.09340</id>
<link href="https://arxiv.org/abs/2611.09340"/><updated>2026-11-09T00:00:00Z</updated>
<summary>Real-world robot deployment requires adapting learned policies to unseen obstacles without collecting new demonstrations or retraining. Existing policy-level guidance often applies obstacle corrections independently at individual horizon steps, which may address local obstacle violations but fail to coordinate the action sequence into a complete, task-directed detour. How obstacle responses should be propagated across the action horizon to coordinate complete, task-directed avoidance motion remains underexplored. We introduce an inferencetime obstacle-guidance framework for pretrained …</summary></entry><entry><title>STRIDE: Learning Humanoid Locomotion in Minutes with Acceleration-Based Rewards</title><id>https://arxiv.org/abs/2611.08857</id>
<link href="https://arxiv.org/abs/2611.08857"/><updated>2026-11-09T00:00:00Z</updated>
<summary>Learning locomotion directly on a humanoid robot is a promising direction to avoid the sim-to-real gap. However, locomotion rewards in Reinforcement Learning (RL) typically track the base velocity, which cannot be measured onboard without an external motion capture system or well-calibrated state estimator. This is why we introduce \method{}, which learns humanoid locomotion from minutes of samples with a reward that only requires the onboard Inertial Measurement Unit (IMU). Instead of tracking the base velocity, STRIDE rewards the robot for following a commanded acceleration profile. To …</summary></entry><entry><title>It Takes Two to Tangram: Multi-Agent Object Centric Reinforcement Learning for Assembly</title><id>https://arxiv.org/abs/2611.08814</id>
<link href="https://arxiv.org/abs/2611.08814"/><updated>2026-11-09T00:00:00Z</updated>
<summary>Geometric assembly requires fine spatiotemporal coordination to place parts without causing collisions or deadlocks under tight clearances. To address this, we present an object-centric reinforcement learning framework that treats each part as an agent and learns a shared policy for continuous assembly control. A graph neural network represents the pieces, their target poses, and their spatial relationships, and predicts translational and angular velocities for each component. Per-agent proximal policy optimization with a centralized graph critic directly learns motion and temporal …</summary></entry><entry><title>Latent RL Priors for Data-Efficient Dexterous Manipulation</title><id>https://arxiv.org/abs/2611.08458</id>
<link href="https://arxiv.org/abs/2611.08458"/><updated>2026-11-06T00:00:00Z</updated>
<summary>Learning dexterous manipulation from limited visual demonstrations is challenging because policies must acquire both perceptual grounding and precise control, while reinforcement learning (RL) in simulation can acquire rich control behaviors from large-scale interaction with privileged information. We introduce \textbf{Latent RL Prior}, a two-stage framework that reuses this control knowledge for data-efficient visual policy learning. During privileged pretraining, we distill large-scale RL rollouts into a flow-matching action decoder conditioned on proprioception and latent task context. …</summary></entry><entry><title>SHORE: Stability-Hybrid On-Policy Reinforcement Learning for Online Bin Packing</title><id>https://arxiv.org/abs/2611.08364</id>
<link href="https://arxiv.org/abs/2611.08364"/><updated>2026-11-06T00:00:00Z</updated>
<summary>Online 3D bin packing with a processing buffer requires choosing which box to pack, its orientation, and its placement while keeping the stack stable under unknown future arrivals. A collapse ends the episode and forfeits the remaining volume. Existing methods use geometric rules or hard stability masks, limiting how risk can influence the joint choice of box, orientation, and placement. We propose Stability-Hybrid On-Policy Reinforcement Learning (SHORE), which combines a learned stability probability of a placement with an on-policy estimate of its return conditional on stability. A 3D …</summary></entry><entry><title>La-JEPA: Compact Robot Policies with Latent World Modeling</title><id>https://arxiv.org/abs/2611.08156</id>
<link href="https://arxiv.org/abs/2611.08156"/><updated>2026-11-06T00:00:00Z</updated>
<summary>World-action models adapt pretrained video generators, and vision-language-action models build on pretrained vision-language backbones; both tie policy architecture and inference cost to large transformers designed for generation rather than control. It remains unclear how much these generation-oriented choices affect control. In this work, we introduce Latent Action JEPA (La-JEPA), a compact world-action model whose policy transformer is trained from scratch in the feature space of a pretrained V-JEPA 2.1 encoder. Following Fast-WAM, La-JEPA learns to predict future features jointly with …</summary></entry><entry><title>Detecting Silent Faults at the Environment-Trainer Boundary in Reinforcement Learning</title><id>https://arxiv.org/abs/2611.08144</id>
<link href="https://arxiv.org/abs/2611.08144"/><updated>2026-11-06T00:00:00Z</updated>
<summary>Robot reinforcement learning increasingly runs environments outside the trainer: in another process, on another machine, in another language. Many faults at this boundary raise no error. We make the boundary a wire protocol and ask what notices a fault in it. On Pendulum, HalfCheetah, Hopper and a 7-joint arm (Pusher), we injected up to 23 faults into what crosses the wire and 2 into the trainer&#x27;s log, from one value to every value. Unless every value was wrong, a learning-curve threshold caught at most one run in ten, and a comparison with ten fault-free seeds at most 21%. A clean evaluation …</summary></entry><entry><title>LMGN: A Unified Policy Learning Model for Last-Mile Grasp-Navigation</title><id>https://arxiv.org/abs/2611.07515</id>
<link href="https://arxiv.org/abs/2611.07515"/><updated>2026-11-06T00:00:00Z</updated>
<summary>Legged robots equipped with manipulators have shown significant potential in the fields of daily life and industry in complex environments. However, existing methods mainly focus on global navigation or manipulation independently, while overlooking the last-mile navigation problem, where the robot must jointly determine the base placement, approach direction, and grasp execution to achieve reliable object grasping, and different manipulation stages require distinct control behaviors. To address these challenges, we propose Last-Mile Grasp-Navigation (LMGN), a unified policy learning model for …</summary></entry><entry><title>Kinematic Hypothesis Context: Embodiment-Conditioned Learned Video Coding for Bandwidth-Limited Robot Policy Uplinks</title><id>https://arxiv.org/abs/2611.07411</id>
<link href="https://arxiv.org/abs/2611.07411"/><updated>2026-11-06T00:00:00Z</updated>
<summary>Robots increasingly run large vision-language-action policies on remote servers, making the camera uplink the bottleneck. Existing video codecs spend bits on content the receiver could predict: the robot&#x27;s own motion. We introduce the kinematic hypothesis context, a zero-rate conditioning signal that both ends build from joint states, the robot model and the camera calibration. Ego-motion homographies, per-link robot reprojections, an end-effector plane and a background memory warp the previous reconstruction into hypotheses that condition a learned video codec. We prove that history-only and …</summary></entry><entry><title>Efficient Diffusion Policy Fine Tuning with Latent Noise Representation Bridging</title><id>https://arxiv.org/abs/2611.07275</id>
<link href="https://arxiv.org/abs/2611.07275"/><updated>2026-11-06T00:00:00Z</updated>
<summary>Pre-trained diffusion and flow policies have emerged as powerful backbones for robotics, yet adapting them to novel data via reinforcement learning (RL) remains computationally expensive, sample inefficient and lacks theoretical guarantees. Prior approaches that fine-tune the initial noise bypass costly backpropagation through time but struggle with the &quot;noise aliasing&quot; problem: there does not exista natural link between the noise space value and the action space value. This paper resolves these challenges by introducing the Latent Noise Linear Markov Decision Process (LNL-MDP). We derive the …</summary></entry><entry><title>An Empirical Study of Reinforcement Learning for Keypoint Positioning of Deformable Linear Objects</title><id>https://arxiv.org/abs/2611.07261</id>
<link href="https://arxiv.org/abs/2611.07261"/><updated>2026-11-06T00:00:00Z</updated>
<summary>Deformable linear object (DLO) manipulation is challenging because high-dimensional configurations, nonlinear contact dynamics, and diverse material and geometric properties produce a broad range of object responses that are both difficult to model and data-intensive to learn. This work studies reinforcement learning for planar manipulation of a one-end-grasped DLO, focusing on training efficiency, observation design, robustness, and zero-shot sim-to-real transfer. We compare three Proximal Policy Optimization training stacks and find that the GPU-parallel MuJoCo Playground stack enables …</summary></entry><entry><title>Reinforcement Learning Enables Scaling Generalist Robot Policy Improvement</title><id>https://arxiv.org/abs/2611.06905</id>
<link href="https://arxiv.org/abs/2611.06905"/><updated>2026-11-05T00:00:00Z</updated>
<summary>The introduction of generalist robot policies has enabled a single, large model to learn to perform a variety of tasks from a vast pre-training corpus. While these models often exhibit powerful zero-shot generalization capabilities, they typically require an adaptation phase to achieve sufficient performance in deployment. Iterated self-improvement via reinforcement learning (RL) has demonstrated promise in enabling this adaptation, yet such approaches have been largely explored in single-task settings - where the goal is to simply improve on a narrow deployment task - which lies in stark …</summary></entry><entry><title>Open-HumanScale: An Open Recipe for Scaling Human and Robot Experience for Embodied Foundation Models</title><id>https://arxiv.org/abs/2611.06817</id>
<link href="https://arxiv.org/abs/2611.06817"/><updated>2026-11-05T00:00:00Z</updated>
<summary>Egocentric human video offers a scalable source of manipulation priors for robot learning, yet translating raw data scale into generalizable robot policies demands rigorous data curation and training recipes. We introduce Open-HumanScale, the first fully open recipe for scaling egocentric pretraining to 50,000 hours, anchored by Open-HumanScale-50K---a curated egocentric video corpus densely annotated with hand motion and natural language. Leveraging this corpus, we systematically investigate pure human pretraining via closed-loop simulation evaluations and uncover an empirical log-linear …</summary></entry><entry><title>Which Physical Tactile Cues Matter for Contact-Rich Imitation Learning? A Controlled Real-Robot Study</title><id>https://arxiv.org/abs/2611.06673</id>
<link href="https://arxiv.org/abs/2611.06673"/><updated>2026-11-05T00:00:00Z</updated>
<summary>Vision-based tactile sensors capture multiple aspects of physical interaction within a single image stream, including contact appearance, geometry, indentation depth, and tangential deformation. However, existing visuo-tactile policies often directly process tactile observations as images, making it difficult to determine which physical cues contribute to policy learning. This paper presents a controlled real-robot study that compares physically interpretable tactile signals using the LeRobot platform, enhanced with our visuo-tactile perception system. From the same tactile stream, we derive …</summary></entry><entry><title>H^2MARL: Hierarchical Heterogeneous Multi-agent Reinforcement Learning for Humanoid Robot Control</title><id>https://arxiv.org/abs/2611.06523</id>
<link href="https://arxiv.org/abs/2611.06523"/><updated>2026-11-05T00:00:00Z</updated>
<summary>Coordinated whole-body control of humanoid robots remains challenging due to high-dimensional coupled dynamics and substantial physical heterogeneity across joint degrees of freedom (JDoFs). Existing multi-agent reinforcement learning methods either employ coarse agent partitions or directly apply generic heterogeneous-agent algorithms, while hierarchical controllers commonly optimize high-level planning and low-level execution independently, leading to uncoordinated motion. In this paper, we propose H^2MARL, a hierarchical heterogeneous multi-agent reinforcement learning framework with two …</summary></entry><entry><title>TwinBridge: Digital Twin-Driven Policy and Reward Transfer for Real-World Reinforcement Learning in Laboratory Robotics</title><id>https://arxiv.org/abs/2611.06442</id>
<link href="https://arxiv.org/abs/2611.06442"/><updated>2026-11-05T00:00:00Z</updated>
<summary>Online reinforcement learning offers an effective approach to precise laboratory manipulation, yet costly real-world demonstrations and limited access to dense process rewards hinder its practical application. We present TwinBridge, a digital twin-driven framework that supplies policy initialization and dense visual rewards for real-world online learning. We construct digital twins by combining 3D Gaussian splatting with physics simulation. Here, simulator states provide task events and geometric progress under physical prerequisites and ordering constraints, yielding rewards for policy …</summary></entry><entry><title>Can Astra Solve RoboMME without Breaking the Bank?</title><id>https://arxiv.org/abs/2611.06184</id>
<link href="https://arxiv.org/abs/2611.06184"/><updated>2026-11-05T00:00:00Z</updated>
<summary>Robotic manipulation often requires remembering information that is no longer visible, such as an object&#x27;s location before occlusion or the order of a demonstrated action sequence. A large vision-language planner can read this history, but calling it before every action chunk is slow and costly. We present a three-tier system for the RoboMME benchmark. GPT-6 Astra (System 2) selects a grounded subtask from stored visual history, a $\pi_{0.5}$ vision-language-action policy (System 1) executes it, and a fine-tuned Qwen3-VL-4B monitor (System 1.5) checks after each action chunk whether the …</summary></entry><entry><title>Online Adaptation to Latent Physical Properties for Learning from Demonstration</title><id>https://arxiv.org/abs/2611.06118</id>
<link href="https://arxiv.org/abs/2611.06118"/><updated>2026-11-05T00:00:00Z</updated>
<summary>Manipulating visually identical objects with different physical properties requires adapting actions based on information acquired through interaction. We address the problem of learning from demonstrations how to adapt manipulation actions, such as regrasping and changing contact locations, based on physical-property information acquired during interaction. To this end, we propose a learning-from-demonstration method that learns latent representations of physical properties needed to predict object responses and conditions a policy on online estimates of these representations. A dynamics …</summary></entry><entry><title>RACE: Calibrated Cumulative Scoring for Rollout-Free Robot Policy Checkpoint Selection</title><id>https://arxiv.org/abs/2611.05838</id>
<link href="https://arxiv.org/abs/2611.05838"/><updated>2026-11-05T00:00:00Z</updated>
<summary>Assessing the deployment performance of learned robot policies during training is challenging, as directly measuring task success requires costly real-world trials for each candidate checkpoint. Averaged validation loss offers a rollout-free alternative, but its checkpoint rankings can be inconsistent with deployment performance. We analyze two limitations of this criterion: it penalizes action deviations without considering whether the policy can recover from them, and gives later reference predictions equal weight even when earlier deviations may lead execution away from the reference. We …</summary></entry><entry><title>ELA: End-to-End Latent Action Policy Learning from Video Demonstrations</title><id>https://arxiv.org/abs/2611.05571</id>
<link href="https://arxiv.org/abs/2611.05571"/><updated>2026-11-05T00:00:00Z</updated>
<summary>Robot imitation learning is limited by the scarcity of action-labeled data, while action-free demonstrations such as videos are abundant. Recent latent-action methods learn action-relevant representations from observation transitions, but they do not optimize latent actions for downstream control, leading to latent representations that are difficult for policies to model and difficult to accurately decode into continuous robot actions. This paper introduces ELA, an end-to-end framework for learning from video demonstrations via latent actions jointly optimized for policy learning and action …</summary></entry><entry><title>PolicyIK: High-Precision Inverse Kinematics for Robot Arms with Reinforcement Learning</title><id>https://arxiv.org/abs/2611.05372</id>
<link href="https://arxiv.org/abs/2611.05372"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Inverse kinematics (IK) converts end-effector pose commands into joint motion, and many vision-language-action (VLA) policies rely on it to act on a given arm and to transfer across embodiments. Precise IK remains laborious: redundancy and singularities complicate the inverse mapping, execution depends on hand-tuned controllers, and training data on physical robots are costly to collect. We present PolicyIK, a goal-conditioned reinforcement learning policy for high-precision IK. It updates joint-position references from pose feedback and observes its accumulated reference relative to the …</summary></entry><entry><title>GUILD: Guided Iterative Data Collection for Imitation Learning</title><id>https://arxiv.org/abs/2611.05368</id>
<link href="https://arxiv.org/abs/2611.05368"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Imitation learning policies in robotics are trained on datasets collected through costly real-world teleoperation. Often, the data-collection process is unguided, relying on the teleoperator&#x27;s intuition, resulting in data that contributes little to overall policy performance. Recent work has shown that curating such unguided datasets can substantially improve policy performance, but these approaches operate by filtering existing datasets after collection and therefore do not prevent the acquisition of uninformative data. In this work, we propose GUILD, a novel Guided Data Collection (GDC) …</summary></entry><entry><title>GSBR: Geometric Support Behavior Regularization for Online RL</title><id>https://arxiv.org/abs/2611.05295</id>
<link href="https://arxiv.org/abs/2611.05295"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Regularizing online reinforcement learning (RL) toward a pretrained base policy can improve sample efficiency and learning stability, but regularization that is too restrictive limits how much the policy can improve. Base policies -- typically diffusion or flow-matching models trained by imitation learning on large, diverse datasets -- capture many behaviors that are reasonable but suboptimal. Existing regularizers using such base policies are too restrictive in one of two ways: behavioral cloning regularizers pull the actor toward the full base-policy distribution, penalizing it for …</summary></entry><entry><title>RoboTryOn: Synthesizing Dexterous Robot Demonstrations from Human Videos via Virtual Try-On</title><id>https://arxiv.org/abs/2611.05163</id>
<link href="https://arxiv.org/abs/2611.05163"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Robot foundation models have shown remarkable performance in robot control, yet adapting them to a new task still relies heavily on teleoperated demonstrations. Egocentric human videos offer a scalable substitute, but overlaying rendered robots on human videos or retargeting human poses into robot actions leaves significant visual or action gaps for high-DoF robot embodiments. To address this limitation, we propose RoboTryOn, which treats human-to-robot translation as virtual try-on: try-on keeps the person and swaps the garment, RoboTryOn keeps the demonstrated motion and swaps the human for …</summary></entry><entry><title>Asynchronous Robot Policies</title><id>https://arxiv.org/abs/2611.05155</id>
<link href="https://arxiv.org/abs/2611.05155"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Scaling vision-language foundation models has significantly advanced generalist robot manipulation, but the increased model scale introduces computational latency that degrades real-time physical reactivity. Existing Vision-Language-Action (VLA) architectures execute high-level semantic reasoning and action ex- ecution sequentially within the primary control loop, creating a fundamental tension between semantic-reasoning capability and robot agility. To address this, we propose Asynchronous Robot Policy (ARP), an architectural framework that decouples semantic reasoning from low-level action …</summary></entry><entry><title>CRONOS: Benchmarking Non-Episodic Reinforcement Learning for Robotic Manipulation</title><id>https://arxiv.org/abs/2611.05080</id>
<link href="https://arxiv.org/abs/2611.05080"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Reinforcement learning (RL) is promising for adapting robot policies to unstructured real-world environments. However, standard RL pipelines rely on episodic training with frequent scene resets, which is impractical for real-world deployment due to the need for substantial human intervention. While prior work has studied non-episodic RL in relatively small policies trained from scratch, its behavior when fine-tuning modern large-scale pre-trained vision-language-action (VLA) models remains underexplored. In this work, we introduce CRONOS, a simulation benchmark for RL fine-tuning of VLAs …</summary></entry><entry><title>DRAP: Dynamics-Risk Adaptive Plasticity for Continual Learning in Physical AI</title><id>https://arxiv.org/abs/2611.05029</id>
<link href="https://arxiv.org/abs/2611.05029"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Continual learning in physical AI differs from conventional continual learning because small per-step policy errors can accumulate over a trajectory. Each deviation may move the agent outside the training distribution, increase subsequent prediction errors, and ultimately cause closed-loop task failure. This work introduces Dynamics-Risk Adaptive Plasticity (DRAP), a replay-free method that estimates the historical importance of adaptable model tensors from sample-level action gradients weighted by local trajectory-amplification risk. A ridge-regularized local linear model is fitted to expert …</summary></entry><entry><title>LLMs as MDP Designers: A Dependency-Aware Agentic Framework for Automated Robot Policy Generation</title><id>https://arxiv.org/abs/2611.04974</id>
<link href="https://arxiv.org/abs/2611.04974"/><updated>2026-11-04T00:00:00Z</updated>
<summary>We investigate the automated generation of executable robot reinforcement learning (RL) policies from natural-language task descriptions. Rather than using large language models (LLMs) as execution-time decision makers, we use them as designers that construct RL pipelines before deployment, including Markov decision process (MDP) formulation and simulator implementation. We identify a phase-wise structure in this problem: MDP formulation is dependency-structured and sequential, whereas simulator implementation becomes modular once the formulation is fixed. Based on this structure, we propose …</summary></entry><entry><title>Safeguarding Multi-Agent Reinforcement Learning for Connected and Automated Vehicles with Recursively Feasible Control Barrier Functions</title><id>https://arxiv.org/abs/2611.04957</id>
<link href="https://arxiv.org/abs/2611.04957"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Multi-Agent Reinforcement Learning (MARL) shows promise in coordinating connected and automated vehicles but offers no safety guarantee. Although Control Barrier Functions (CBFs) can add this guarantee, their optimization problem can become infeasible in practice due to control bounds. Moreover, they often overapproximate vehicle and road geometry, which makes them conservative. This paper proposes the Backup-Horizon CBF (BH-CBF), which evaluates safety along a horizon until all vehicles stop. BH-CBF is recursively feasible under control bounds, and it considers the exact vehicle and road …</summary></entry><entry><title>Physical Diffusion Policy via MPM-Guided 3D Gaussian Simulation</title><id>https://arxiv.org/abs/2611.04493</id>
<link href="https://arxiv.org/abs/2611.04493"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Learning robust manipulation policies for diverse everyday objects remains challenging because objects with different materials exhibit distinct deformation and contact dynamics. While diffusion policies provide a powerful framework for modeling multimodal manipulation behaviors, they typically lack explicit physical reasoning and may produce averaged actions when facing heterogeneous objects. We present a physics-aware diffusion policy that augments visual imitation learning with object physical understanding. Our framework recovers material properties from visual demonstrations by coupling …</summary></entry><entry><title>Spectrally Routed Diffusion Policy for Multi-Task Robotic Manipulation</title><id>https://arxiv.org/abs/2611.04477</id>
<link href="https://arxiv.org/abs/2611.04477"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Diffusion-based policies have achieved strong performance on single-task robotic manipulation. However, a single model trained jointly on multiple tasks consistently underperforms the per-task specialists trained on the same demonstrations. We focus on two challenges. First, the convolutional encoders commonly used in diffusion-based policies produce visual conditions that are not discriminative enough. Second, gradients from incompatible action modes update the shared denoiser&#x27;s dense parameters along the same directions, causing destructive interference during joint training. To address …</summary></entry><entry><title>Latent Policy Barrier: Learning Robust Visuomotor Policies by Staying In-Distribution</title><id>https://arxiv.org/abs/2508.05941</id>
<link href="https://arxiv.org/abs/2508.05941"/><updated>2026-11-04T00:00:00Z</updated>
<summary>Visuomotor policies trained via behavior cloning are vulnerable to covariate shift, where small deviations from expert trajectories can compound into failure. Common strategies to mitigate this issue involve expanding the training distribution through human-in-the-loop corrections or synthetic data augmentation. However, these approaches are often labor-intensive, rely on strong task assumptions, or compromise the quality of imitation. We introduce Latent Policy Barrier, a framework for robust visuomotor policy learning. Inspired by Control Barrier Functions, LPB treats the latent embeddings …</summary></entry><entry><title>D&amp;A: Decoupling Description and Assessment Enables VLMs as Zero-Shot Robotic Reward Models</title><id>https://arxiv.org/abs/2611.03622</id>
<link href="https://arxiv.org/abs/2611.03622"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Vision-Language Models (VLMs) hold promise for zero-shot video task-progress estimation in robot learning, yet existing frameworks frequently suffer from confirmation bias, hallucinating progress in failed executions due to implicit success assumptions or relative temporal ranking designs. Naive prompting of frontier models collapses into a binary success detector that fails to capture nuanced, non-linear progress and failures. While post-training approaches can mitigate this through explicit training, they demand expensive real-world robotics data and require computationally intensive …</summary></entry><entry><title>When Robots Outweigh Objects: How Inertia Mismatch Shapes Robot Policy Learning</title><id>https://arxiv.org/abs/2611.03501</id>
<link href="https://arxiv.org/abs/2611.03501"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Conventional robot arms can be extremely heavy compared with the everyday objects they manipulate, creating a significant inertia mismatch at contact. Even a small accidental bump from a heavy arm can knock a light object out of place. Modern learning methods have nevertheless demonstrated a wide range of successful manipulation behaviors on these platforms, suggesting that even extreme inertia mismatch can be overcome with sufficient data. However, it remains unclear whether high inertia imposes a hidden cost on learning, potentially worsening scaling with data or lowering the performance …</summary></entry><entry><title>SNAP: Semantic Navigation Among Pedestrians</title><id>https://arxiv.org/abs/2611.03498</id>
<link href="https://arxiv.org/abs/2611.03498"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Navigating crowded urban environments requires robots to avoid pedestrians while adhering to social norms such as remaining on sidewalks. Existing approaches typically address either crowd avoidance or semantic path planning in isolation. We propose a reinforcement learning (RL) navigation policy that jointly reasons about semantic terrain and dynamic obstacles from a single semantically annotated bird&#x27;s-eye-view (BEV) map, without relying on explicit human-state estimation. Our policy outperforms established crowd-navigation and semantic-aware baselines and transfers zero-shot to a legged …</summary></entry><entry><title>ForceLDM: A Force-aware Latent Dynamics Model for Contact-Rich Manipulation</title><id>https://arxiv.org/abs/2611.03294</id>
<link href="https://arxiv.org/abs/2611.03294"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Contact-rich manipulation requires fine-grained control and complex physical interactions with the environment, posing significant challenges for robot policy learning. Vision-only policies struggle with such tasks, as contact states and interaction forces are difficult to infer from visual observations alone. Existing methods mitigate this issue by incorporating force or tactile sensing. However, they often treat these signals as auxiliary observations without fully exploiting their role in modeling future interaction dynamics. To address this, we propose ForceLDM, a force-aware latent …</summary></entry><entry><title>KlaskTron: An Open-Source Platform for Physical Adversarial Multi-Agent RL</title><id>https://arxiv.org/abs/2611.03138</id>
<link href="https://arxiv.org/abs/2611.03138"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Progress in robot learning, particularly physical multi-agent reinforcement learning (MARL), is currently challenged by a limited availability of accessible, standardized benchmarks. While simulation-based MARL has produced remarkable emergent behaviors, from coordinated team play to complex tool use, translating these advances to physical systems remains difficult. A key barrier is infrastructural: physical platforms are often prohibitively expensive, require specialized facilities, or lack open mechanisms and designs for reproducibility. We introduce KlaskTron, an open-source, low-cost …</summary></entry><entry><title>KlaskTron-IL: A Contact-Rich Adversarial Imitation Learning Benchmark with a Validated Sim-to-Real Bridge</title><id>https://arxiv.org/abs/2611.03091</id>
<link href="https://arxiv.org/abs/2611.03091"/><updated>2026-11-03T00:00:00Z</updated>
<summary>KlaskTron is an open-hardware physical platform for two-player adversarial reinforcement learning, with a learned actuator model that supports zero-shot sim-to-real transfer of trained policies. Building on this platform, we contribute KlaskTron-IL: a multi-tier imitation learning dataset (80k human demonstration timesteps collected directly on the physical robot, 320k symmetry-augmented timesteps, and synthetic expert trajectories up to 5M steps generated by the zero-shot-validated PPO policy), and diagnostic baselines that expose three characteristic failure modes of standard IL methods …</summary></entry><entry><title>BeyondContact: A Reinforcement Learning Framework for Airflow-Based Non-Contact Manipulation</title><id>https://arxiv.org/abs/2611.03059</id>
<link href="https://arxiv.org/abs/2611.03059"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Contact-based robotic manipulation is constrained by end-effector reachability and the mechanical properties of objects. Airflow can exert forces without direct robot-object contact, enabling manipulation of objects beyond the reach or when direct contact is undesirable. However, the lack of suitable simulation has hindered the application of reinforcement learning to airflow-based manipulation, limiting the broader adoption of this mechanism compared with contact-based methods. To address this gap, we developed a robot- and task-agnostic airflow extension for Isaac Lab that supports …</summary></entry><entry><title>Beyond Policy Patches: Distilling RL Specialists into Vision-Language-Action Policies</title><id>https://arxiv.org/abs/2611.02777</id>
<link href="https://arxiv.org/abs/2611.02777"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Vision-language-action (VLA) policies can handle noncritical stages of long-horizon manipulation yet fail during short precision-critical phases. Lightweight reinforcement learning (RL) specialists can address these failures without directly applying RL to the full VLA, but retain auxiliary controllers and switching mechanisms at deployment. We study how to transfer their capabilities into a single flow-matching VLA. Direct imitation of specialist rollouts can reproduce action jitter and leave the VLA unprepared for states encountered during its own execution. We introduce REPAIR, a …</summary></entry><entry><title>Visuo-tactile Diffusion Policy for Robotic Manipulation with Auxiliary Tactile Dynamics Prediction</title><id>https://arxiv.org/abs/2611.02677</id>
<link href="https://arxiv.org/abs/2611.02677"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Long-horizon robotic assembly requires reliable perception and action across grasping, alignment, and insertion. Vision captures global object pose and scene context, where as fingertip touch provides local contact cues that are especially useful as contact states change. We present a visuotactile diffusion policy that combines four-step histories from two camera views and two fingertip tactile images to condition action-sequence generation. A recurrent temporal representation integrates recent observations from both modalities. To encourage it to capture how contact evolves under action, an …</summary></entry><entry><title>Beyond Ensemble Disagreement: Predictive STL Monitoring of RL Locomotion under Distribution Shift</title><id>https://arxiv.org/abs/2611.02218</id>
<link href="https://arxiv.org/abs/2611.02218"/><updated>2026-11-03T00:00:00Z</updated>
<summary>RL locomotion policies trained under nominal simulation conditions may encounter distribution shifts that compromise safety. Predictive monitors could anticipate violations, but their world-model forecasts may become unreliable under shift, and ensemble disagreement is not calibrated. We evaluate predictive Signal Temporal Logic (STL) monitoring for frozen Ant-v5 and HalfCheetah-v5 policies using closed-loop world-model rollouts and a three-model ensemble. Across external-force, observation-noise, and mass shifts, predicted robustness ranks HalfCheetah&#x27;s future STL violations strongly, …</summary></entry><entry><title>ODE Policy: Robot Learning via Action Dynamics, Not Actions</title><id>https://arxiv.org/abs/2611.01729</id>
<link href="https://arxiv.org/abs/2611.01729"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Most robot policies, whether trained by imitation learning (IL) or reinforcement learning (RL), map observations to action values at discrete control steps and leave the continuity of physical motion to be learned implicitly. We propose ODE policy, which learns the dynamics of the action rather than the action itself. A neural ordinary differential equation (ODE) learns the vector field of the action by matching the integrated actions to the targets over short action chunks in IL and single control steps in RL. A lightweight diversity head captures multi-modal behavior by randomizing the …</summary></entry><entry><title>Beyond Validation Loss: Coverage and Reliability Dynamics in Robot Policy Pretraining</title><id>https://arxiv.org/abs/2611.01565</id>
<link href="https://arxiv.org/abs/2611.01565"/><updated>2026-11-03T00:00:00Z</updated>
<summary>In modern robot learning, generative robot policies are first pretrained through supervised learning from demonstrations, then refined through reinforcement learning, supervised finetuning, or other forms of posttraining. Yet conventional pretraining metrics, such as validation loss and average task success, provide an incomplete account of which policies support both effective direct deployment and subsequent posttraining. In this work, we study closed-loop pass@k, which evaluates the probability that k rollouts from the same initial condition attain at least one success. Thus, pass@1 …</summary></entry><entry><title>Hi-CoLA: High Confidence Lower Bound Approximation Based Reinforcement Learning for Flex-Route Transit Operation Control</title><id>https://arxiv.org/abs/2611.01071</id>
<link href="https://arxiv.org/abs/2611.01071"/><updated>2026-11-03T00:00:00Z</updated>
<summary>This paper studies safe policy improvement for real-time operation control of flex-route transit (FRT) systems, where robustness is critical and any performance decrease is undesirable. While reinforcement learning (RL) has shown strong empirical success, its adoption remains limited in safety and cost critical applications, such as intelligent transportation, since learned policies lack statistically certified performance guarantees before deployment. In this paper, we propose the High Confidence Lower Bound Approximation (Hi-CoLA) RL framework, which combines importance sampling and …</summary></entry><entry><title>Evaluating Tactile Foundation Models for End-to-End Imitation Learning in Contact-Rich Manipulation</title><id>https://arxiv.org/abs/2611.00957</id>
<link href="https://arxiv.org/abs/2611.00957"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Tactile sensing plays an important role in imitation learning for contact-rich manipulation by providing direct observations of physical contact with objects. Recently, several tactile foundation models (TFMs) have been proposed to learn general-purpose tactile representations through pretraining on large-scale tactile datasets. However, how these pretrained tactile representations should be leveraged for end-to-end imitation learning remains insufficiently explored. In this work, we integrate multiple TFMs into Diffusion Policy and systematically evaluate their effectiveness for contact-rich …</summary></entry><entry><title>Reflex: Fast Robot Policy Serving by Reusing and Correcting Past Actions</title><id>https://arxiv.org/abs/2611.00524</id>
<link href="https://arxiv.org/abs/2611.00524"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Modern robot policies often perform expensive inference to generate action chunks, making serving a latency bottleneck for real-time control and a throughput bottleneck for multi-robot serving. Building on the success of caching in image, video, and audio generation, recent robot-policy advances have reported promising speedups by reusing intermediate denoising states to avoid redundant computation. Surprisingly, we find that such reuse often offers little advantage over simply running fewer denoising steps from fresh noise, without any cache. Moreover, accelerating denoising leaves the …</summary></entry><entry><title>Behavioral Steering of Vision-Language-Action Models in the Low-Parameter Regime</title><id>https://arxiv.org/abs/2611.00522</id>
<link href="https://arxiv.org/abs/2611.00522"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Reinforcement learning (RL) is increasingly used to adapt pretrained vision-language-action models (VLAs). We investigate the problem of behavioral steering: adapting a VLA&#x27;s execution style to preferences such as carrying objects higher. To investigate how little trainable capacity such steering requires and how much pretrained capability can be retained, we freeze an OpenVLA-OFT 7B policy and optimize TinyLoRA adapters with 8 to 384 trainable parameters using either policy-gradient RL (GRPO) or evolutionary search (CMA-ES). With just 256 trainable parameters, we raise carry height by 120 mm …</summary></entry><entry><title>OmniPiano: Diverse Dexterous Piano-Playing Challenges for Standard, Robust, Safe, and Multi-Agent RL</title><id>https://arxiv.org/abs/2611.00243</id>
<link href="https://arxiv.org/abs/2611.00243"/><updated>2026-11-03T00:00:00Z</updated>
<summary>Dexterous robotic manipulation remains a major challenge in robotics, exemplified by piano playing, which requires coordinated control of fingers and provides a demanding testbed for reinforcement learning (RL). Although previous work established a benchmark for robotic piano playing, it is restricted to two hands and does not support unified evaluation. To address this gap, we introduce OmniPiano, a benchmark that provides one to up to five Shadow Hands and supports standard, robust, safe, and multi-agent RL within a shared piano-playing task family. OmniPiano is developed for scalable and …</summary></entry><entry><title>Nexus-VLA: Bridging Human and Robot Experiences via a Shared Hierarchical Semantic Latent Space</title><id>https://arxiv.org/abs/2610.42021</id>
<link href="https://arxiv.org/abs/2610.42021"/><updated>2026-11-02T00:00:00Z</updated>
<summary>Large-scale egocentric human videos provide rich and scalable manipulation experience for robot policy learning, yet substantial embodiment gaps in visual appearance, kinematic structure, and action spaces hinder effective knowledge transfer. Existing methods often decouple cross-embodiment knowledge alignment from robot policy learning, making it difficult for human manipulation knowledge to directly and fully contribute to robot action learning. To address this issue, we propose Nexus-VLA, a hybrid policy learning framework that enables cross-embodiment knowledge transfer through end-to-end …</summary></entry><entry><title>Online Learning of Heterogeneous Locomotion Dynamics under Reinforcement Learning Policies for Precise Loco-Manipulation</title><id>https://arxiv.org/abs/2610.41892</id>
<link href="https://arxiv.org/abs/2610.41892"/><updated>2026-11-02T00:00:00Z</updated>
<summary>How to reuse a pretrained locomotion policy for precise loco-manipulation is still an open problem. We propose an online method to learn the closed-loop dynamics under a frozen locomotion policy. The learned model predicts floating-base motion and improves loco-manipulation accuracy. However, unobserved latent conditions of the policy introduce heterogeneous responses, meaning that the same observed state will lead to different motions. Direct learning without accounting for this heterogeneity introduces bias and fluctuations into dynamics estimates, degrading floating-base prediction and …</summary></entry><entry><title>Movens-Zero: Scaling Humanoid Motion Foundation Models with Large-Scale Human Videos</title><id>https://arxiv.org/abs/2610.41877</id>
<link href="https://arxiv.org/abs/2610.41877"/><updated>2026-11-02T00:00:00Z</updated>
<summary>Scaling humanoid motion foundation models is constrained by the scarcity of diverse, robot-executable data and by the difficulty of jointly learning from heterogeneous multimodal inputs while supporting real-time closed-loop control. We present Movens-5M, constructed from raw Internet videos through clip generation, quality filtering, semantic annotation, motion recovery, and physical refinement with humanoid retargeting and execution verification. It contains 15 million human-motion sequences and 5 million physically executable humanoid-motion sequences spanning over 10,000 hours, aligned …</summary></entry><entry><title>ResMerge: Residual Policy Learning and Merging for Continual Adaptation of Pre-trained Robot Policies</title><id>https://arxiv.org/abs/2610.41663</id>
<link href="https://arxiv.org/abs/2610.41663"/><updated>2026-11-02T00:00:00Z</updated>
<summary>Continual adaptation to new tasks is essential for robots deployed in the real world, but adapting pre-trained policies remains challenging due to parameter growth and the need for continual demonstration collection. Parameter-Efficient Continual Fine-Tuning (PECFT) isolates task-specific updates, but adapter-per-task designs require demonstrations and grow with the task set. We propose ResMerge, a two-stage framework that learns mergeable residual policies atop a frozen pre-trained policy: residual reinforcement learning (RL) acquires task-specific corrections without additional expert …</summary></entry><entry><title>$\nabla$Mimic: Ultra-Efficient Humanoid Control with Differentiable Simulation</title><id>https://arxiv.org/abs/2610.41654</id>
<link href="https://arxiv.org/abs/2610.41654"/><updated>2026-11-02T00:00:00Z</updated>
<summary>Robot policy learning is dominated by zeroth-order methods such as PPO, which treat the simulator as a black box and pay for it with enormous sample counts. First-order policy learning differentiates through the dynamics, but on contact-rich whole-body control it has rarely worked: its gradients explode. A recent world-model method showed that derivative information can make humanoid motion tracking far more efficient, using surrogate gradients of a learned model. We show that exact gradients of the simulator itself do better, once two obstacles are removed. Exact gradients contain rare …</summary></entry><entry><title>Joint-Health-Aware Reinforcement Learning for Robust Robot Control Under Actuator Degradation</title><id>https://arxiv.org/abs/2610.41348</id>
<link href="https://arxiv.org/abs/2610.41348"/><updated>2026-11-02T00:00:00Z</updated>
<summary>Robots deployed in unstructured environments are susceptible to actuator-authority degradation, which reduces the effective control authority of individual actuators and can cause reinforcement learning policies trained under nominal dynamics to fail. Existing robustness approaches rely on discrete fault labels, broad domain randomization, or global latent variables, often without explicitly modeling continuous per-joint residual actuation capability. We propose a joint-health-aware reinforcement learning framework for robust robot control under simulated actuator degradation. Our framework …</summary></entry><entry><title>HandMimicX: Learning Human-Like Dexterous Manipulation via an Object-Centric Policy from Egocentric Videos</title><id>https://arxiv.org/abs/2610.41336</id>
<link href="https://arxiv.org/abs/2610.41336"/><updated>2026-11-02T00:00:00Z</updated>
<summary>Learning dexterous manipulation from human videos remains an open challenge, particularly in the context of transferring a single demonstration into a spatially generalizable robotic skill and maintaining physically plausible human-like interactions. Unlike prior works that emphasize hand-motion imitation, we introduce an object-centric framework for acquiring dexterous skills from egocentric human RGB-D videos. Within our framework, we formulate the reinforcement learning (RL) objective in terms of object motion to decouple the underlying skill from the specific hand trajectory and impose …</summary></entry><entry><title>CaPtain: A Pipeline for Post-Training Code-as-Policy Robot Agents</title><id>https://arxiv.org/abs/2610.40799</id>
<link href="https://arxiv.org/abs/2610.40799"/><updated>2026-11-02T00:00:00Z</updated>
<summary>Across coding, web, and tool-use tasks, language-model agents are now routinely trained with the same recipe: supervised fine-tuning (SFT) to learn the interface, then multi-turn reinforcement learning (RL) to master it. Code-as-policy (CaP) casts robot manipulation in the same form, as the policy writes code against robot APIs and reads back the results, so the same recipe should apply. Yet existing CaP agents sidestep training: they either prompt closed frontier models or delegate manipulation to pre-trained vision-language-action models (VLAs) and high-level skills, while small open …</summary></entry><entry><title>JEDI: Joint-Embedding Demonstration Compression for In-Context Imitation Learning</title><id>https://arxiv.org/abs/2610.40356</id>
<link href="https://arxiv.org/abs/2610.40356"/><updated>2026-10-30T00:00:00Z</updated>
<summary>In-context imitation learning (ICIL) adapts robot policies through test-time demonstrations, but long multimodal trajectories constrain how many examples fit in context. We ask what a compressed demonstration should preserve. We propose JEDI, which compresses demonstrations into latent slots trained to predict the query episode&#x27;s next-stage keyframe in a frozen video-JEPA space. Task and process counterfactuals help the slots preserve execution details, while the predictor selects demonstrations from a bank. Post-training with keypoint tokens enables human-hand conditioning on robots. …</summary></entry><entry><title>Learned Terminal Costs for Short-Horizon Model Predictive Control of Autonomous Trucks in Interactive Highway Traffic</title><id>https://arxiv.org/abs/2610.40257</id>
<link href="https://arxiv.org/abs/2610.40257"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Autonomous highway driving for heavy-duty trucks is a challenging control problem. The greater mass, dimensions and intricate dynamics increase the requirements for cooperation from surrounding traffic in critical maneuvers, requiring a careful balance between safety constraints and efficient long-horizon decision making. Model Predictive Control (MPC) provides rigorous constraint satisfaction but relies on terminal cost which can limit its effectiveness at short, computationally affordable horizons. Reinforcement Learning (RL) captures long-term driving behavior but offers no constraint …</summary></entry><entry><title>Learning Safe Flow Matching Robot Policies from Binary Feasibility Oracles</title><id>https://arxiv.org/abs/2610.40075</id>
<link href="https://arxiv.org/abs/2610.40075"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Robot foundation models increasingly rely on flow-based action generation for general-purpose manipulation, yet the generated actions are not guaranteed to satisfy physical constraints such as joint limits and collision avoidance. This problem is especially challenging when the feasible set cannot be described analytically and is accessible only through black-box feasibility oracles. We study this practical oracle-only setting and propose an oracle-guided differentiable safeguard for safe flow-matching robot policies. The safeguard uses binary feasibility queries to correct unsafe updates in …</summary></entry><entry><title>Humanoid Dodgeball: Learning Fast Dynamic Obstacle Avoidance Motions for Humanoids</title><id>https://arxiv.org/abs/2610.40003</id>
<link href="https://arxiv.org/abs/2610.40003"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Humanoids have become increasingly agile and capable in real-world environments. To operate safely in dynamic scenarios, they must rapidly evade fast-moving obstacles while maintaining stability and physically feasible whole-body motion. Learning such behaviors remains challenging due to the high-dimensional dynamics of humanoid systems and the need to jointly balance reactive obstacle avoidance, motion naturalness, and control robustness. In this work, we present Humanoid Dodgeball, a reinforcement learning (RL) framework for agile dynamic obstacle avoidance in humanoids. Our method enables …</summary></entry><entry><title>Smooth Action Chunking Via Movement-Primitive Representations for Imitation Learning</title><id>https://arxiv.org/abs/2610.39451</id>
<link href="https://arxiv.org/abs/2610.39451"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Imitation learning has become a widely adopted approach for vision-based robot policies, owing to its conceptual simplicity, scalability, and ability to leverage large-scale datasets. As these policies have grown more capable, action chunking has become their standard interface. At each decision step the policy outputs several future actions at once. Backbones from diffusion policies to large vision-language-action models all share it. Whatever backbone produces the chunk, its temporal structure is learned only implicitly. The commanded trajectory is therefore jerky both within a chunk and …</summary></entry><entry><title>ScheduleGen: Demonstration Generation via Skill Scheduling for Multi-Arm Imitation Learning</title><id>https://arxiv.org/abs/2610.39429</id>
<link href="https://arxiv.org/abs/2610.39429"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Multi-arm robot platforms, including bimanual and humanoid robots, have the capability to complete tasks with lower cycle times than single-arm systems, but they are more difficult to safely control due to the presence of multi-arm constraints. The paradigm of training generalist robot policies from massive datasets is a promising approach to address general-purpose multi-arm manipulation, but the acquisition of large multi-arm manipulation datasets remains a bottleneck. Automated demonstration generation can alleviate this burden by synthesizing new demonstrations from a handful of source …</summary></entry><entry><title>Robotic Data Inoculation</title><id>https://arxiv.org/abs/2610.39054</id>
<link href="https://arxiv.org/abs/2610.39054"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Modern robot learning systems feed on high-quality demonstration data, and their performance hinges on coverage. Without good coverage, small errors compound and the policy can quickly go into out-of-distribution states from which it cannot recover. Yet there is no principled way of collecting high-coverage data, and data collection often relies on heuristic instructions to human operators. Purely online reinforcement learning (RL) explores at the cost of safety and sample efficiency, while DAgger-style interventions require the policy to fail by chance before a human can correct it. In this …</summary></entry><entry><title>Force-Driven Hook Disassembly via Constraint-Aware Object-Centric Reinforcement Learning</title><id>https://arxiv.org/abs/2610.38513</id>
<link href="https://arxiv.org/abs/2610.38513"/><updated>2026-10-30T00:00:00Z</updated>
<summary>The growing volume of end-of-life products has intensified the need for automated disassembly, yet hook-type connections remain challengin: their orientations vary, they deform under load, and their geometry is hidden, so vision alone cannot identify a feasible non-destructive disassembly direction. This work proposes a constraint-aware reinforcement learning framework that infers feasible extraction directions online from contact forces. The policy is trained in a robot-agnostic, object-centric simulation on a simplified peg-in-hole pair and deployed zero-shot on a physical robot, where it …</summary></entry><entry><title>MATCH: Execution-Aware Hierarchical Reinforcement Learning for Vision-and-Language Navigation in Continuous Environment</title><id>https://arxiv.org/abs/2610.38248</id>
<link href="https://arxiv.org/abs/2610.38248"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Vision-and-Language Navigation in Continuous Environments (VLN-CE) requires instruction-consistent planning and reliable execution under collision constraints. Yet many hierarchical approaches optimize the planner while keeping execution fixed. We introduce MATCH, a framework that jointly learns a language-conditioned planner and a goal-conditioned primitive-action executor. An execution-aware topological graph represents start-dependent execution options and integrates executor value estimates with realized outcome memory, enabling the planner to select execution requests and refine their …</summary></entry><entry><title>Embodied at Sea: Imitation Learning for Multi-Task Underwater Manipulation</title><id>https://arxiv.org/abs/2610.38199</id>
<link href="https://arxiv.org/abs/2610.38199"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Behavior Cloning has demonstrated promising generalization capabilities for robotic manipulation in terrestrial environments. However, marine visual distortions and dynamic currents create a severe domain shift that remains a key bottleneck in adapting generalist architectures to underwater field manipulation. To address this, 1616 episodes of underwater manipulation data were collected in calm and turbulent waters and were used to train 14 generalist Vision-Language-Action (VLA) models (DynamicVLA) with varying proprioception observation configurations. Across three tasks on 1260 gradable …</summary></entry><entry><title>Learning from Relative Action Credit for Escaping Local Minima</title><id>https://arxiv.org/abs/2610.38034</id>
<link href="https://arxiv.org/abs/2610.38034"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Reinforcement learning holds the promise of robots that learn manipulation skills from interaction alone, without pretrained priors or demonstration data. In practice, on-policy methods such as PPO routinely stall on long-horizon, contact-rich tasks: dense reward shaping carries the policy through stages, yet stitching them together and discovering sparsely rewarded events rarely succeeds. We trace this failure to the missing action discrimination in state-value credit assignment: a state-value critic judges progress only by episode outcomes, so when the policy converges to a partial solution …</summary></entry><entry><title>Echo: Scaling Visual Reinforcement Learning with Off-policy Experience</title><id>https://arxiv.org/abs/2610.37865</id>
<link href="https://arxiv.org/abs/2610.37865"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Scaling visual reinforcement learning (RL) with GPU-accelerated simulation is computationally expensive due to rendering and visual-policy inference costs. Consequently, two-stage teacher--student distillation is commonly used to train visual policies, but introduces an imitation gap. In this preliminary study, we introduce \echomethod{}, \textbf{a single-stage off-policy RL framework that scales experience collection without proportionally increasing visual computation}. Through \textbf{inverse distillation}, a state-based auxiliary policy imitates the evolving visual policy and collects …</summary></entry><entry><title>LaWAM: Latent World Action Models for Efficient Dynamics-Aware Robot Policies</title><id>https://arxiv.org/abs/2606.15768</id>
<link href="https://arxiv.org/abs/2606.15768"/><updated>2026-10-30T00:00:00Z</updated>
<summary>Vision-Language-Action models (VLAs) leverage large-scale vision-language pretraining for semantic robot control, but often lack explicit foresight into how robot actions change the scene. World-Action Models (WAMs) address this limitation by conditioning policies on predicted futures, yet existing approaches typically rely on computationally expensive video generation with substantial pixel-level redundancy. We present LaWAM, a Latent World Action Model that exposes predictive dynamics to robot policies through compact latent visual subgoals instead of reconstructed future video. At the core …</summary></entry><entry><title>ThinkWorld: World Imagination Reinforces Chain-of-Dynamics Reasoning</title><id>https://arxiv.org/abs/2610.37666</id>
<link href="https://arxiv.org/abs/2610.37666"/><updated>2026-10-28T00:00:00Z</updated>
<summary>Vision-Language-Action (VLA) models have made substantial progress in robotic manipulation, but their generalization remains constrained by the diversity and coverage of action-labeled robot demonstrations. Human videos provide much broader behavioral and environmental experience, while learning from them faces a fundamental trade-off between scalable data and explicit action grounding. We introduce ThinkWorld, a VLA learning framework that grounds action reasoning in world dynamics and strengthens it through reinforcement learning with world imagination. ThinkWorld represents each action …</summary></entry><entry><title>When, Where, and What to Correct: Human-Guided Adaptive Residual Correction for Robot Policies</title><id>https://arxiv.org/abs/2610.37547</id>
<link href="https://arxiv.org/abs/2610.37547"/><updated>2026-10-28T00:00:00Z</updated>
<summary>Imitation policies that reliably execute most of a manipulation trajectory can still fail in localized regions requiring last-mile precision. Updating the full policy or exploring residual actions everywhere treats this local failure as a global learning problem. We introduce Adaptive Residual Correction (ARC), a lightweight post-training module that uses reinforcement learning (RL) to learn a residual correction on top of a frozen policy while using sparse human corrections to structure autonomous exploration. Rather than treating human corrections as imitation targets, ARC uses …</summary></entry><entry><title>Rendering-Free Event Frame Simulation for Fast Reinforcement Learning of Autonomous Robot Navigation</title><id>https://arxiv.org/abs/2610.37543</id>
<link href="https://arxiv.org/abs/2610.37543"/><updated>2026-10-28T00:00:00Z</updated>
<summary>Event cameras offer low latency, high dynamic range, and milliwatt-level power consumption, making them ideal for agile robots such as tiny drones navigating through cluttered environments. However, existing simulators generally render photorealistic images before converting them into events, making large-scale reinforcement learning prohibitively slow. We propose an analytic event simulator that exploits what event cameras fundamentally measure - moving contrast edges - to synthesize event streams directly from scene geometry and ego-motion without visual rendering. Our simulator generates a …</summary></entry><entry><title>Predict the Swing, Match the Speed: Robotic Pipe Stabbing With Learned Stereo Vision and Residual Reinforcement Learning</title><id>https://arxiv.org/abs/2610.37535</id>
<link href="https://arxiv.org/abs/2610.37535"/><updated>2026-10-28T00:00:00Z</updated>
<summary>A joint of pipe run into the hole swings from the elevator over the well and strikes a fixed stabbing guide at whatever speed the swing has. StabBot, a robotic stabbing system, predicts the swing and meets the pipe at its own speed. A pendulum Kalman filter tuned from the pipe tally tracks the joint in stereo images. A six-axis arm with an open V-shaped roller head closes in at matched velocity, confirms the last millimetres by touch, aims the pin over the box when the elevator hangs off centre, and follows the block down with lateral compliance. A ResNet-18 keypoint network locates the pipe, …</summary></entry><entry><title>Autonomous fixed-wing interception using reinforcement learning</title><id>https://arxiv.org/abs/2610.37470</id>
<link href="https://arxiv.org/abs/2610.37470"/><updated>2026-10-28T00:00:00Z</updated>
<summary>Medium altitude, long endurance unmanned aerial systems such as Shahed-type strike drones are an unanswered threat in modern conflicts. Conventional air defense systems are too expensive to provide a feasible large-scale solution. Quadcopter interceptors are a cheap, battle-proven alternative, but their extremely limited flight time restricts them to low altitude targets at short range, whereas fixed-wing platforms have the endurance to reach higher altitude targets from longer distances. However, such interceptors are still operated manually. Recent developments in learning-based controllers …</summary></entry><entry><title>Multi-Agent Reinforcement Learning of Co-Adaptive Hip Exoskeleton Control (MARL-Exo) for Metabolic Energy Reduction</title><id>https://arxiv.org/abs/2610.37441</id>
<link href="https://arxiv.org/abs/2610.37441"/><updated>2026-10-28T00:00:00Z</updated>
<summary>Objective: This study aims to determine whether a hip-exoskeleton policy trained in simulation, by co-adapting with a musculoskeletal human model under a metabolic-energy reward, reduces the metabolic cost of walking in new users without per-user tuning, and how mechanical-power shaping affects the learned assistance. Methods: We developed MARL-Exo, a multi-agent reinforcement learning framework in which a full-body human model (304 muscle actuators; randomized anatomy, gait, and speed) and a bilateral hip-exoskeleton policy are trained concurrently in two stages. The exoskeleton observes …</summary></entry><entry><title>Learning Quality-Controllable Robot Policies with Iterative Hindsight Relabeling</title><id>https://arxiv.org/abs/2610.37393</id>
<link href="https://arxiv.org/abs/2610.37393"/><updated>2026-10-28T00:00:00Z</updated>
<summary>Robot policy evaluation often relies on a binary success signal for task completion. In real-world deployment, however, desired execution behaviors are also defined by quality attributes such as execution speed and motion smoothness, which need to be dynamically controlled according to task requirements. To address this, we introduce Quality-Controllable Policy (QCP), a robot policy that enables inference-time control over both individual quality attributes and their combinations. To extend the controllable quality range beyond initial demonstrations, we further propose an iterative hindsight …</summary></entry>
</feed>
