Distillation for Efficient Multitask Manipulation Policies via Conditional Flow Matching

Shreya Deshmukh, Imen Mahdi, Nick Heppert, Abhinav Valada
9/23/2026
cs.ROcs.AIcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Advances in generative modeling have recently been extensively employed in robotics for policy learning. In particular, Conditional Flow Matching (CFM) trained with expert demonstrations has been shown to outperform existing methods on robot manipulation benchmarks. While prior work has mainly focused on single-task settings, we study the problem from a multi-task perspective, as training independent models for each task is computationally expensive. Multi-Task policy learning comes with its own set of challenges, as naively training on a concatenated dataset of demonstrations would either require increased model capacity to accommodate the added complexity or result in drops in performance. We propose to distill knowledge from single-task CFM experts into a shared multi-task policy by transferring their learned velocity fields. We combine this distillation signal with the original CFM objective to retain fidelity to the demonstrations. Experiments on RLBench show that our approach improves multi-task policy performance over naive training while maintaining a fixed model size.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{deshmukh2026distillation,
  title  = {Distillation for Efficient Multitask Manipulation Policies via Conditional Flow Matching},
  author = {Shreya Deshmukh and Imen Mahdi and Nick Heppert and Abhinav Valada},
  year   = {2026},
  eprint = {2609.28107},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2609.28107v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2609.28107.svg)](https://codeofpaper.com/paper/2609.28107)

Discussion