Organizations: AI for Good (AIGO), Istituto Italiano di Tecnologia, Genoa, Italy · DITEN, University of Genoa, Genoa, Italy · PAVIS, Istituto Italiano di Tecnologia, Genoa, Italy · Department of Computer Science, University of Verona, Verona, Italy
We introduce a lifelong imitation learning framework that enables continual policy refinement across sequential tasks under realistic memory and data constraints. Our approach departs from conventional experience replay by operating entirely in a multimodal latent space, where compact representations of visual, linguistic, and robot's state information are stored and reused to support future learning. To further stabilize adaptation, we introduce an incremental feature adjustment mechanism that regularizes the evolution of task embeddings through an angular margin constraint, preserving inter-task distinctiveness. Our method establishes a new state of the art in the LIBERO benchmarks, achieving 10-17 point gains in AUC and up to 65% less forgetting compared to previous leading methods. Ablation studies confirm the effectiveness of each component, showing consistent gains over alternative strategies. The code is available at: https://github.com/yfqi/lifelong_mlr_ifa.
Figures & tables
Figure 1: Illustration of Incremental Feature Adjustment (IFA). The figure displays a 2D projection of the global latent representations g during policy rollout for two related tasks, Tj (previously learned) and Tk (newly learned). The stars ( \mathbf{\color[rgb]{1,0,0}\star} for Tj and \mathbf{\color[rgb]{0,1,0}\star} for Tk ) represent the stable language reference embeddings h(r) , while the circles ( \mathbf{\color[rgb]{1,0,0}\bullet} for Tj and \mathbf{\color[rgb]{0,1,0}\bullet} for Tk ) are the global embeddings g . (Left) Without IFA, the new task’s embeddings ( \mathbf{\color[rgb]{0,1,0}\bullet} ) exhibit representation drift by clustering close to the old task’s embeddings ( \mathbf{\color[rgb]{1,0,0}\bullet} ). (Right) With IFA, the loss LIFA enforces a constraint on the distances: the distance to the own reference ( Down ) plus a margin δ must be less than or equal to the distance to the other task’s reference ( Dother ). This mechanism forces the g(Tk) ( \mathbf{\color[rgb]{0,1,0}\bullet} ) cluster away from h(r)(Tj) ( \mathbf{\color[rgb]{1,0,0}\star} ) and closer to h(r)(Tk) ( \mathbf{\color[rgb]{0,1,0}\star} ) , achieving inter-task disentanglement.
Figure 2: Our method is a general multimodal architecture composed of modality-specific encoders (language, vision, and state), a modulation network, a temporal decoder, and a policy head. During the pretraining phase, all architecture modules are trained. In the lifelong learning phase, only the temporal decoder and policy head are updated using both the new task data and the samples stochastically stored in the replay buffer. The buffer stores the multimodal features, output of the modulation layer. The model is jointly supervised by both the Behavior Cloning and the Incremental Feature Adjustment loss, processing the current task and previously stored tasks.
Method
LIBERO-OBJECT
LIBERO-GOAL
LIBERO-50
FWT ↑
NBT ↓
AUC ↑
FWT ↑
NBT ↓
AUC ↑
FWT ↑
NBT ↓
AUC ↑
Sequential [ 14 ]
62.0 ± 1.0
63.0 ± 2.0
30.0 ± 1.0
55.0 ± 1.0
70.0 ± 1.0
23.0 ± 1.0
32.0 ± 1.0
90.0 ± 2.0
14.0 ± 2.0
ER [ 14 , 2 ]
56.0 ± 1.0
24.0 ± 1.0
49.0 ± 1.0
53.0 ± 1.0
36.0 ± 1.0
47.0 ± 2.0
35.0 ± 3.0
49.0 ± 1.0
36.0 ± 3.0
BUDS [ 33 , 26 ]
52.0 ± 2.0
21.0 ± 1.0
47.0 ± 1.0
50.0 ± 1.0
39.0 ± 1.0
42.0 ± 1.0
29 ± 3.0
50.0 ± 4.0
33.0 ± 3.0
LOTUS [ 26 ]
74.0 ± 3.0
11.0 ± 1.0
65.0 ± 3.0
61.0 ± 3.0
30.0 ± 1.0
56.0 ± 1.0
39 ± 2.0
43.0 ± 1.0
45.0 ± 2.0
ISCIL [ 10 ]
71.7 ± 1.9
11.9 ± 5.1
66.3 ± 3.7
70.4 ± 3.6
19.4 ± 4.1
60.5 ± 2.5
47.8 ± 1.3
15.0 ± 4.8
37.7 ± 2.1
Table 1: Comparison of results on the LIBERO benchmarks (mean ± standard deviation). “NA” indicates not available. Best results are shown in bold.
Modality
LIBERO-OBJECT
LIBERO-GOAL
FWT ↑
NBT ↓
AUC ↑
FWT ↑
NBT ↓
AUC ↑
AV
83.8 ± 2.2
11.1 ± 10.4
78.9 ± 2.6
77.7 ± 2.6
7.8 ± 2.7
73.9 ± 2.6
Lan
83.3 ± 0.7
13.5 ± 3.1
77.3 ± 1.9
77.1 ± 1.9
12.3 ± 0.8
71.8 ± 2.0
EIH
84.4 ± 0.9
16.1 ± 3.1
77.1 ± 1.1
75.0 ± 3.3
5.6 ± 3.9
72.7 ± 4.2
Act
84.6 ± 2.6
20.7 ± 3.6
75.1 ± 1.4
73.8 ± 2.5
2.5 ± 4.2
73.2 ± 1.1
Sta
82.5 ± 3.3
11.2 ± 10.6
77.5 ± 2.6
78.3 ± 5.1
8.2 ± 2.4
74.9 ± 5.9
Table 2: Influence of different modality similarity on the proposed method’s performance. “AV”, “Lan”, “EIH”, “Act”, and “Sta” denote Agent-view, Language, Eye-in-hand, Action, and State modalities, respectively.
Buffer
FWT ↑
NBT ↓
AUC ↑
LIBERO-OBJECT
33.3%
83.3 ± 2.6
12.3 ± 2.4
77.6 ± 3.0
50%
84.6 ± 1.9
11.4 ± 5.6
79.4 ± 1.5
66.6%
83.3 ± 1.4
16.4 ± 9.0
75.8 ± 5.3
LIBERO-GOAL
33.3%
80.0 ± 2.5
6.9 ± 0.9
77.2 ± 1.8
50%
80.0 ± 2.5
6.9 ± 0.9
77.2 ± 1.8
66.6%
82.0 ± 0.9
15.4 ± 16.7
75.6 ± 8.7
Table 3: Ablation on task pair selection proportion used when calculating IFA.
Reference
FWT ↑
NBT ↓
AUC ↑
LIBERO-OBJECT
Mean global
79.6 ± 7.21
8.3 ± 12.2
75.7 ± 1.1
Lan+agent view
84.6 ± 1.9
11.4 ± 5.6
79.4 ± 1.5
LIBERO-GOAL
Mean global
77.1 ± 3.1
15.7 ± 6.1
70.5 ± 6.0
Lan+agent view
80.0 ± 2.5
6.9 ± 0.9
77.2 ± 1.8
Table 4: Effectiveness of choosing different references. “Lan” stands for language. See the text for a description of the “mean global” reference.
Probability
Storage
FWT ↑
NBT ↓
AUC ↑
LIBERO-OBJECT
0.50
188MB
84.6 ± 1.9
11.4 ± 5.6
79.4 ± 1.5
0.20
75.3MB
80.5 ± 7.5
12.5 ± 7.1
77.7 ± 10.0
0.10
37.6MB
79.9 ± 12.6
13.4 ± 6.1
76.6 ± 14.1
LIBERO-GOAL
0.50
121.2MB
80.0 ± 2.5
6.9 ± 0.9
77.2 ± 1.8
0.20
60.6MB
78.3 ± 1.9
10.6 ± 8.0
77.4 ± 4.6
0.10
30.3MB
78.7 ± 1.3
25.2 ± 10.4
66.2 ± 6.8
Table 5: Impact of varying the probability of storing features in the buffer, affecting buffer size.
Figure 3: Comparison between cosine distance and angle-based IFA loss calculation.
Figure 4: UMAP visualization of the global latent representation g(Tk) obtained when not enforcing the IFA loss (left) or when enforcing it (right). Each color represents the global latent representations of one task.
LIBERO-OBJECT
LIBERO-GOAL
T6
T7
T8
T6
T7
T8
w/o
0.1265
0.1374
0.3590
0.2191
0.2319
0.3652
w
0.1197
0.1218
0.3482
0.1977
0.2345
0.3877
Table 6: Average cosine similarity between task 8 embeddings and references from other tasks after lifelong training. “w/o” and “w” denote training without and with IFA, respectively (see main text for details).
Appendix figures & tables7 assets
Supplementary material from the paper’s appendix.
Appendix
Dataset
α
FWT ↑
NBT ↓
AUC ↑
LIBERO-OBJECT
0.10
81.8 ± 3.2
12.4 ± 3.6
77.3 ± 1.4
0.30
84.6 ± 1.9
11.4 ± 5.6
79.4 ± 1.5
0.50
82.1 ± 0.7
18.3 ± 10.3
73.2 ± 4.1
0.70
81.7 ± 0.7
8.4 ± 3.3
77.3 ± 2.4
LIBERO-GOAL
0.10
80.8 ± 4.0
12.0 ± 11.3
75.4 ± 8.8
0.30
81.3 ± 3.3
15.2 ± 7.3
74.7 ± 6.7
Appendix
Table 7: Ablation on different angular scaling factor α in the adaptive IFA.
LIBERO-OBJECT
LIBERO-GOAL
FWT ↑
NBT ↓
AUC ↑
FWT ↑
NBT ↓
AUC ↑
R=8
57.5 ± 0.2
7.9 ± 1.0
52.8 ± 5.9
59.3 ± 0.9
11.5 ± 3.3
54.1 ± 0.7
R=16
48.9 ± 7.1
-5.6 ± 0.4
50.4 ± 6.9
56.3 ± 5.3
4.4 ± 18.9
53.6 ± 2.4
R=32
53.8 ± 0.2
-0.2 ± 6.7
54.2 ± 2.3
63.8 ± 7.1
7.5 ± 13.0
60.0 ± 1.5
FFT
84.6 ± 1.9
11.4 ± 5.6
79.4 ± 1.5
80.0 ± 2.5
6.9 ± 0.9
77.2 ± 1.8
Appendix
Table 8: Comparison between LoRA adapters with different ranks (R) and full fine-tuning (FFT).
LIBERO-OBJECT
LIBERO-GOAL
FWT ↑
NBT ↓
AUC ↑
FWT ↑
NBT ↓
AUC ↑
w/o FiLM
43.8 ± 3.5
8.8 ± 7.7
41.6 ± 0.2
57.6 ± 17.7
0.83 ± 7.5
56.3 ± 2.1
w FiLM
84.6 ± 1.9
11.4 ± 5.6
79.4 ± 1.5
80.0 ± 2.5
6.9 ± 0.9
77.2 ± 1.8
Appendix
Table 9: Effect of using FiLM layers during lifelong learning.
LIBERO-OBJECT
LIBERO-GOAL
Task Reference
Task 6
Task 7
Task 8
Task 9
Task 6
Task 7
Task 8
Task 9
Mean global
0.565
0.555
0.549
0.454
0.485
0.354
0.501
0.437
Global
0.811
0.802
0.797
0.703
0.735
0.583
0.752
0.684
Language
0.668
0.701
0.656
0.677
0.591
0.610
0.629
0.680
AgentView
0.947
0.951
0.973
0.994
0.976
0.957
0.980
1.051
Eye-in-hand
1.008
0.974
1.005
1.005
1.018
1.037
0.987
1.042
Appendix
Table 10: Task-reference comparison on LIBERO-OBJECT and LIBERO-GOAL . See text for the explanation of “Mean Global” and “Global”. “Language”, “AgentView”, “Eye-in-hand”, and “State” use the corresponding modality-specific latent feature as the task reference. The smallest cosine distance is highlighted in bold , and the second smallest is underlined .
Figure 5: UMAP visualization of the global latent representations g(Tk) obtained when not enforcing the IFA loss, each color represents the global latent representations of one task.
Figure 6: Illustration of the cosine function and its inverse.
Method
P
Forward Time (ms)
S-FLOPs
T-FLOPs
BASE
-
75.5 ± 2.43
3.63×1011
4.36×1017
BASE + RR
0.5
75.8 ± 2.80
3.63×1011
12.96×1017
BASE + MLR
0.5
75.5 ± 2.43
3.63×1011
7.62×1017
BASE + MLR + IFA
0.5
75.8 ± 2.80
3.63×1011
7.62×1017
BASE + MLR + IFA
0.2
75.8 ± 2.43
3.63×1011
5.66×1017
BASE + MLR + IFA
0.1
75.8 ± 2.43
3.63×1011
5.01×1017
Appendix
Table 11: Runtime and FLOPs comparison. See text for the explanation of Forward Time, S-FLOPs, and T-FLOPs. All experiments are conducted on LIBERO-GOAL . P means the probability of storing features in the buffer, which is ablated in Tab. 5 . RR stands for raw replay, which stores past samples and replays them during training. Note that BASE stands for running our method without MLR or IFA. It is included solely to quantify the computational cost of the base architecture.
Continual imitation learning evaluates whether a robot can learn new knowledge without forgetting previously learned skills. However, retaining task performance does not ensure the behavior remains grounded in language because policies may rely on scene cues, object associations, or memorized task structure. We introduce a benchmark protocol to study how language-guided behavior changes as robotic policies learn successive tasks. We construct meaning-preserving and meaning-changing instruction variants for the Goal, Spatial, Object, and Long suites of LIBERO. Policy experiments focus on LIBERO-Goal, evaluating Original and Paraphrase instructions after each continual-learning stage. We compare representative continual imitation learning methods under their original assumptions while separating task competence from language sensitivity. The proposed diagnostics complement standard learning and forgetting metrics by measuring semantic robustness, goal adaptation, and language sensitivity. Results show that strong continual-learning performance does not always translate to reliable language grounding, and our diagnostics help determine whether retained skills remain correctly guided by their instructions. Additional materials are available at https://sites.google.com/view/stillgrounded
Siddeshwar Raghavan, Ziqin Yuan, Fengqing Zhu +1
Department of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA. · Department of Computer and Information Technology,Purdue University, West Lafayette, IN, USA. · Computer Science and Intelligent Systems Engineering, Indiana University Bloomington, IN, USA.
A key challenge in lifelong imitation learning (LIL) is enabling agents to acquire new skills from expert demonstrations while retaining prior knowledge. This requires preserving the low-dimensional manifolds and geometric structures that underlie task representations across sequential learning. Existing distillation methods, which rely on L2-norm feature matching in raw feature space, are sensitive to noise and high-dimensional variability, often failing to preserve intrinsic task manifolds. To address this, we introduce SPREAD, a geometry-preserving framework that employs singular value decomposition (SVD) to align policy representations across tasks within low-rank subspaces. This alignment maintains the underlying geometry of multimodal features, facilitating stable transfer, robustness, and generalization. Additionally, we propose a confidence-guided distillation strategy that applies a Kullback-Leibler divergence loss restricted to the top-M most confident action samples, emphasizing reliable modes and improving optimization stability. Experiments on the LIBERO, lifelong imitation learning benchmark, show that SPREAD substantially improves knowledge transfer, mitigates catastrophic forgetting, and achieves state-of-the-art performance.
Kaushik Roy, Giovanni D'urso, Nicholas Lawrance +2
CSIRO Robotics, DATA61, CSIRO, Australia. · Queensland University of Technology (QUT), Brisbane, Australia.
Robotic systems perceive the world through multiple input modalities -- including visual camera streams and natural language instructions -- and must select appropriate actions based on these signals. However, assuming the permanent availability of all input devices is unrealistic, as sensors may fail, become occluded, or drop out entirely during deployment. Robust handling of such missing-modality scenarios is therefore essential for real-world robot operation. This paper introduces RL4IL, a reinforcement learning guided method for imitation learning that selects the most suitable action for a given observation by identifying the most relevant expert demonstrations from a training library. A reinforcement learning policy, trained via Proximal Policy Optimisation over Breadth-First Search candidate sets, ranks candidate demonstrations and a soft cross-attention fusion head aggregates their action signals to produce the final prediction. When a modality is missing at inference time, a dedicated per-modality RL retrieval policy identifies donor demonstrations from the training library, and a soft imputation head reconstructs the missing embedding via cross-attention over the top-ranked donors -- without requiring any retraining of the system. Experiments on three LIBERO benchmark suites demonstrate that RL4IL substantially outperforms state-of-the-art imitation learning methods under sensor dropout conditions, while requiring no policy network training. The code can be found at https://github.com/h-ismkhan/Reinforcement-Learning-via-kNN-for-Robotic-Learning-with-Missing-Camera