arXiv Machine Learning
REDAR: Reinforcement-Driven Adaptive Regularisation for Class Incremental Learning
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 7
RL Forgets! Towards Continual Policy Optimization
arXiv:2607. 04364v1 Announce Type: new Abstract: Continual post-training is becoming a central paradigm for adapting vision-language models to evolving tasks.
arXiv Machine Learning
Sep 18
Improving Online Reinforcement Learning via Bidirectional Behavior Prior Distillation
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.
arXiv AI
Jun 8
Just-In-Time Reinforcement Learning: Continual Learning in LLM Agents Without Gradient Updates
arXiv:2601. 18510v2 Announce Type: replace-cross Abstract: While Large Language Model (LLM) agents excel at general tasks, they inherently struggle with continual adaptation due to the frozen weights after deployment.
arXiv Machine Learning
Sep 21
REFINEPPO: Learning Continuous Control Policies by Iterative Action Refinement
arXiv:2609.21108v1 Announce Type: new Abstract: Deep reinforcement learning (DRL) has achieved strong performance across a wide range of continuous-control problems. These continuous-control policies...
arXiv AI
1d ago
Permanent and Transient Representations for Continual Reinforcement Learning
arXiv:2611.07327v1 Announce Type: cross Abstract: Continual Reinforcement Learning (CRL) agents struggle to adapt to new situations while retaining prior knowledge, leading to a stability-plasticity...
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.