In-context imitation learning allows robots to acquire skills from demonstrations, yet one-shot trajectory generation remains fragile under environmental variation. We propose SAIL, a framework that reframes robot imitation as an iterative refinement problem capable of scaling with test-time compute. SAIL utilizes Monte Carlo Tree Search, where each node is a complete trajectory and edges correspond to trajectory refinements. The process is guided by three core components: an automated archive of successful trajectories for contextually relevant retrieval, a vision language model-based scoring mechanism for trajectory evaluation, and a step-level feedback that provides trajectory-aligned scores for iterative refinement. Experiments across six diverse manipulation tasks in simulation and real-world validation clearly demonstrate that increasing test-time compute consistently improves success rates, achieving up to 95% on complex tasks. Our results suggest that trajectory-level test-time scaling is a robust path toward more generalizable robotic agents.
Figures & tables
Fig. 2: Method overview. SAIL refines trajectories at test time via MCTS, where each node is a complete trajectory proposed by a policy VLM for a seed. (1) A shared trajectory archive stores successful rollouts across seeds and retrieves visually similar trajectories as in-context demonstrations. (2) Each proposal is executed and scored by a scoring VLM that (i) decomposes the task into ordered subtasks from one demo and (ii) estimates per-frame completion to yield a scalar node value. (3) The scoring VLM aligns the progress scores to waypoints to provide step-level feedback for the next refinement.
Method
Nodes
Success Rate
HOB
HOP
BOR
DO
LC
MRL
Avg
Single rollout
1
0.40
0.40
0.40
0.10
0.15
0.05
0.25
Breadth-search
15
0.85
0.50
0.60
0.35
0.60
0.15
0.51
Depth-search
15
0.45
0.50
0.80
0.05
0.30
0.10
0.37
Ours
6
0.80
0.55
1.00
0.20
0.50
0.25
0.55
15
0.90
0.70
1.00
0.40
0.50
0.40
0.65
TABLE I: Success rates over 20 seeds under different test-time compute budgets measured by expanded MCTS nodes. Gray rows indicate the 15-node budget for fair comparison. Bold denotes the best result among the 15-node methods, and underline denotes the best overall.
Setting
Success Rate
HOB
HOP
BOR
DO
LC
MRL
Avg
Ours ( K=1 )
0.90
0.70
1.00
0.40
0.50
0.40
0.65
Retrieval Strategy ( K=1 )
Fixed demonstration
0.75
0.40
0.85
0.05
0.50
0.15
0.45
Random retrieval
0.75
0.50
0.90
0.15
0.55
0.15
0.50
Retrieval Strategy ( K=3 )
TABLE II: Ablation study with a fixed MCTS budget of 15 nodes (success rate). We compare retrieval strategies and feedback modalities for refinement.
Fig. 3: Digital-twin experimental setup for the BlockIntoBowl task. The task consists of three sequential steps: (1) grasp the blue block, (2) move to the bowl, and (3) release the block into the bowl. The left panel shows the simulation environment, and the right panel shows the corresponding real-world setup.
Method
Success Rate
MCTS-based Trajectory Refinement
5 / 6
Sim2Real Policy Distillation
5 / 6
TABLE III: Real-world BlockIntoBowl success rates over 6 trials.
In-context imitation learning (ICIL) enables robots to learn new tasks from a small number of demonstrations by conditioning a pre-trained policy on task-specific examples, without retraining at test time. Despite this promise, training generalizable and scalable in-context imitation policies remains an open challenge. We present SynthICL, a scalable framework that trains ICIL policies entirely from RGB-only synthetic data. Specifically, we build a data generation pipeline to produce high-fidelity ICIL data and train a flow-matching transformer policy on the resulting dataset. SynthICL avoids the need for depth sensing, precise camera calibration, and real-world training data in prior approaches, offering a simpler and more scalable alternative. We further incorporate subgoal prediction by training the model to predict the next subgoal images, enabling more precise and visually grounded control. Evaluated on 16 unseen real-world manipulation tasks, SynthICL achieves an average success rate of 79% with only one demonstration provided at test time and outperforms prior methods. Project page: https://synth-icl.github.io
Robot manipulation policies trained through imitation learning commonly rely on costly demonstrations recorded in one task direction and at one temporal resolution. We propose Reversal and Stride-based Trajectory Augmentation (RESTA), which exploits time-scaling data augmentation to improve data efficiency through trajectory reversal and temporal resampling. Trajectory-reversal augmentation reverses and relabels demonstrations between paired tasks with opposite objectives, reusing recorded rollouts without additional environment interaction. Because contact-rich manipulation is not exactly reversible, we treat reversal as an approximate paired-task prior rather than a physical symmetry. Temporal-stride augmentation varies observation and action sampling strides and conditions the policy on the resulting offsets, enabling fixed or randomized temporal schedules. Experiments across 16 paired bimanual manipulation tasks show that trajectory reversal is particularly effective in the low-data regime and that temporal-stride augmentation improves success under randomized temporal schedules. With 25 and 50 independently collected demonstrations per task, RESTA achieves 78.4% and 85.2% average success, respectively, matching or exceeding baselines trained with twice as many demonstrations (77.3% and 85.4%). These results show that RESTA can improve data efficiency in robot imitation learning.
Yunpeng Jiang, Jianshu Hu, Han Fang +3
Global College, Shanghai Jiao Tong University, Shanghai, China · Shanghai Institute of Physical Intelligence and Robotics (PAIR), Shanghai, China · Duke Kunshan University, Jiangsu, China
Language-conditioned Imitation Learning (IL) is essential for enabling robots to perform complex tasks following natural language instructions. However, generalizing to multi-step compositional tasks remains a significant challenge. While hierarchical approaches attempt to address this by decomposing tasks into atomic skills, existing methods often suffer from training instability and codebook collapse due to the tight coupling between high-level skill reasoning and low-level action generation in joint training paradigms. Inspired by the Dual-Process Theory of cognition, we propose Dual-Process Atomic Skill Learning (DASL), a novel asynchronous hierarchical imitation learning framework that decouples slow semantic reasoning from fast, real-time motion control. DASL comprises a Slow-Frequency Policy that predicts interpretable, discrete skills via Vector Quantization, and a High-Frequency Policy that leverages a latent diffusion model and a Decision Transformer to generate precise actions conditioned on these latent skills. By asynchronously coordinating these modules and utilizing diffusion to structure the latent space, our framework mitigates the skill codebook interference problem common in joint training paradigms. Evaluations across simulation benchmarks and experiment demonstrate that DASL significantly outperforms state-of-the-art baselines, excelling in skill acquisition and compositional generalization to unseen instructions. GitHub page: https://github.com/Hatakekaka/DASL
Jun Chen, Erdemt Bao, Wenlong Dong +7
University of Electronic Science and Technology of China · Huazhong University of Science and Technology · Southern University of Science and Technology +2