arXiv Machine Learning By Gong Gao, Xiao Lai, Jiaji Shen, Ning Jia, Xianhui Liu, Weidong Zhao

Improving Online Reinforcement Learning via Bidirectional Behavior Prior Distillation

Read the original on arXiv Machine Learning →

The paper introduces Bidirectional Behavior Prior Distillation (B2PD), a method that uses action‑value priors to train a conditional variational autoencoder for generating high‑value behavior support. These expert behavior priors are then distilled into the online reinforcement learning agent, reducing inefficient exploration and stabilizing policy updates. Experiments on state‑ and pixel‑based tasks show that B2PD improves sample efficiency while maintaining stable learning dynamics.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 23

What Does It Take For A Generalist Robot Policy To Adapt Using Minimal Data?

The paper introduces a minimal‑data adaptation regime where a pretrained robot policy learns a new task from a single demonstration followed by autonomous online interaction. It shows that while zero‑shot performance is poor, one demonstration can guide the policy toward coarse task‑following, and identifies key design principles—pretrained VLA representations for sample‑efficient value learning, residual policy learning for corrective behavior, and data‑balancing to avoid exploration collapse. The proposed MiDAS method, combining few‑demonstration behavior cloning with value‑based residual learning over frozen VLA representations, significantly boosts task success on LIBERO, RoboCasa, and a bimanual YAM platform after only a few hours of online interaction.

By Shreyas Kowshik, Sreyas Venkataraman, Leo Wang, Niharika Pant, Max Simchowitz, Aviral Kumar
arXiv Machine Learning
Sep 14

MInTRL: Off-policy Intervention can boost On-policy RL

MInTRL (Minimal Intervention Reinforcement Learning) expands exploration in on-policy reinforcement learning by inserting sparse, local corrections into rollouts via a judge-intervention policy. These interventions replace erroneous suffixes and immediately return control to the main policy, allowing the agent to explore beyond its natural trajectory while maintaining on-policy data. The method uses a sequence-level advantage-regression objective, avoiding importance sampling, and demonstrates superior performance on math and code benchmarks compared to standard on-policy and off-policy baselines.

By Mingyu Chen, Yefan Tao, Gerald Friedland, Xuezhou Zhang, Chris Kong
arXiv AI
Oct 28

Freeze, Don't Clone: Fine-Tuning with Expressive Policies Without Retaining Offline Data

The paper investigates fine‑tuning reinforcement learning agents when offline data cannot be retained. It shows that continuing online behavioral cloning after the offline dataset disappears erodes the pretrained policy, leading to representational collapse and loss of action diversity. By freezing the expressive prior and stopping online behavioral fitting, the authors achieve better performance across several algorithms on seven OGBench domains.

By Sami Nur Islam, Johan Obando-Ceron, Doina Precup, Aaron Courville, Pablo Samuel Castro
arXiv Machine Learning
Jun 11

OGPO: Sample Efficient Full-Finetuning of Generative Control Policies

arXiv:2605. 03065v2 Announce Type: replace Abstract: Generative control policies (GCPs), such as diffusion- and flow-based control policies, have emerged as effective parameterizations for robot learning.

By Sarvesh Patil, Mitsuhiko Nakamoto, Manan Agarwal, Shashwat Saxena, Jesse Zhang, Giri Anantharaman, Cleah Winston, Chaoyi Pan, Douglas Chen, Nai-Chieh Huang, Zeynep Temel, Oliver Kroemer, Sergey Levine, Abhishek Gupta, Hongkai Dai, Paarth Shah, Max Simchowitz