Dynamic Rank Adjustment in Diffusion Policies for Efficient and Flexible Training
Xiatao Sun, Shuo Yang, Yinxing Chen, Francis Fan, Yiyan Liang, Daniel Rakita
TL;DR
DRIFT tackles the training inefficiency of diffusion policies trained from scratch by introducing a dynamic, SVD-based rank modulation that splits weight matrices into trainable and frozen subspaces, paired with a rank scheduler to progressively adjust the number of trainable ranks. The DRIFT-DAgger algorithm combines offline bootstrapping with online expert interventions, achieving improved sample efficiency and faster training while maintaining competitive performance. Across simulations and real-world tasks, the approach reduces batch training time and preserves task success, with sigmoid-based rank scheduling offering the best balance between speed and accuracy. These results suggest a practical path to deploying large diffusion-policy models in robotics by leveraging intrinsic low-rank structures without reinitializing adapters or incurring prohibitive computation.
Abstract
Diffusion policies trained via offline behavioral cloning have recently gained traction in robotic motion generation. While effective, these policies typically require a large number of trainable parameters. This model size affords powerful representations but also incurs high computational cost during training. Ideally, it would be beneficial to dynamically adjust the trainable portion as needed, balancing representational power with computational efficiency. For example, while overparameterization enables diffusion policies to capture complex robotic behaviors via offline behavioral cloning, the increased computational demand makes online interactive imitation learning impractical due to longer training time. To address this challenge, we present a framework, called DRIFT, that uses the Singular Value Decomposition to enable dynamic rank adjustment during diffusion policy training. We implement and demonstrate the benefits of this framework in DRIFT-DAgger, an imitation learning algorithm that can seamlessly slide between an offline bootstrapping phase and an online interactive phase. We perform extensive experiments to better understand the proposed framework, and demonstrate that DRIFT-DAgger achieves improved sample efficiency and faster training with minimal impact on model performance. The project website is available at: https://apollo-lab-yale.github.io/25-RSS-DRIFT-website/.
