Dynamic Test-Time Compute Scaling in Control Policy: Difficulty-Aware Stochastic Interpolant Policy
Inkook Chun, Seungjae Lee, Michael S. Albergo, Saining Xie, Eric Vanden-Eijnden

TL;DR
DA-SIP introduces a real-time adaptive control policy that adjusts computational effort based on task difficulty, significantly reducing computation time while maintaining high success rates in robotic manipulation tasks.
Contribution
It presents a novel difficulty-aware framework for diffusion-based policies, enabling dynamic adjustment of inference resources during robotic control.
Findings
Achieves 2.6-4.4x reduction in computation time
Maintains comparable success rates to fixed-budget baselines
Demonstrates effectiveness across diverse manipulation tasks
Abstract
Diffusion- and flow-based policies deliver state-of-the-art performance on long-horizon robotic manipulation and imitation learning tasks. However, these controllers employ a fixed inference budget at every control step, regardless of task complexity, leading to computational inefficiency for simple subtasks while potentially underperforming on challenging ones. To address these issues, we introduce Difficulty-Aware Stochastic Interpolant Policy (DA-SIP), a framework that enables robotic controllers to adaptively adjust their integration horizon in real time based on task difficulty. Our approach employs a difficulty classifier that analyzes observations to dynamically select the step budget, the optimal solver variant, and ODE/SDE integration at each control cycle. DA-SIP builds upon the stochastic interpolant formulation to provide a unified framework that unlocks diverse training and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsRobot Manipulation and Learning · Reinforcement Learning in Robotics · Motor Control and Adaptation
