Speedup Patch: Learning a Plug-and-Play Policy to Accelerate Embodied Manipulation

• URL: http://arxiv.org/abs/2603.20658v1
• Date: Sat, 21 Mar 2026 05:29:04 GMT
• Title: Speedup Patch: Learning a Plug-and-Play Policy to Accelerate Embodied Manipulation
• Abstract summary: Speedup Patch (SuP) is a policy-agnostic framework that enables plug-and-play acceleration using solely offline data.<n>SuP achieves an overall 1.8x execution speedup for diverse policies while maintaining their original success rates.
• Score: 19.765462206627955
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: While current embodied policies exhibit remarkable manipulation skills, their execution remains unsatisfactorily slow as they inherit the tardy pacing of human demonstrations. Existing acceleration methods typically require policy retraining or costly online interactions, limiting their scalability for large-scale foundation models. In this paper, we propose Speedup Patch (SuP), a lightweight, policy-agnostic framework that enables plug-and-play acceleration using solely offline data. SuP introduces an external scheduler that adaptively downsamples action chunks provided by embodied policies to eliminate redundancies. Specifically, we formalize the optimization of our scheduler as a Constrained Markov Decision Process (CMDP) aimed at maximizing efficiency without compromising task performance. Since direct success evaluation is infeasible in offline settings, SuP introduces World Model based state deviation as a surrogate metric to enforce safety constraints. By leveraging a learned world model as a virtual evaluator to predict counterfactual trajectories, the scheduler can be optimized via offline reinforcement learning. Empirical results on simulation benchmarks (Libero, Bigym) and real-world tasks validate that SuP achieves an overall 1.8x execution speedup for diverse policies while maintaining their original success rates.

Related papers

• SpeedTuning: Speeding Up Policy Execution with Lightweight Reinforcement Learning [44.701558695482476]
  We introduce SpeedTuning, a reinforcement learning framework specifically designed to enhance the speed of manipulation policies.<n>SpeedTuning learns to predict the optimal execution speed for actions, thereby complementing a base policy.<n>We provide empirical evidence that SpeedTuning achieves substantial improvements in execution speed, exceeding 2.4x speed-up.
  arXiv  Detail & Related papers  (2026-08-10T05:31:41Z)
• B-spline Policy: Accelerating Manipulation Policies via B-spline Action Representations [75.39816527838181]
  B-spline Policy ( BSP) is an action representation designed for accelerating robot manipulation policies.<n> BSP parameterizes actions as continuous B-spline curves defined by a set of knots and control points.
  arXiv  Detail & Related papers  (2026-07-10T17:46:32Z)
• Aligning Flow Map Policies with Optimal Q-Guidance [50.514994916864275]
  Flow map policies are designed for fast action generation by learning to take arbitrary-size jumps.<n>We derive FLOW MAP Q-GUIDANCE (FMQ), a principled closed-form learning target that is optimal for adapting offline flow map policies under a critic-guided trust-region constraint.<n>FMQ achieves state-of-the-art performance in offline-to-online RL, outperforming the previous one-step policy MVP by a relative improvement of 21.3% on the average success rate.
  arXiv  Detail & Related papers  (2026-05-12T17:12:29Z)
• Implicit Maximum Likelihood Estimation for Real-time Generative Model Predictive Control [5.692340907039085]
  Implicit Maximum Likelihood Estimation (IMLE) is an alternative generative modeling approach for planning.<n>Our results demonstrate that IMLE achieves competitive performance on standard offline reinforcement learning benchmarks.<n>We further validate IMLE in a closed-loop human navigation scenario, operating in real-time, demonstrating how it enables rapid and adaptive plan generation.
  arXiv  Detail & Related papers  (2026-03-14T03:39:31Z)
• Mean Flow Policy with Instantaneous Velocity Constraint for One-step Action Generation [65.13627721310613]
  Mean velocity policy (MVP) is a new generative policy function that models the mean velocity field to achieve the fastest one-step action generation.<n>MVP achieves state-of-the-art success rates across several challenging robotic manipulation tasks from Robomimic and OGBench.
  arXiv  Detail & Related papers  (2026-02-14T14:44:06Z)
• Learning to Accelerate Vision-Language-Action Models through Adaptive Visual Token Caching [25.295588774254952]
  We reformulate inference acceleration as a learnable policy optimization problem.<n>We propose a novel framework that integrates a task-aware decision-making process directly into the Vision-Language-Action model.<n>Our method achieves a 1.76x wall-clock inference speedup while simultaneously improving the average success rate.
  arXiv  Detail & Related papers  (2026-01-31T12:12:51Z)
• Coverage Improvement and Fast Convergence of On-policy Preference Learning [67.36750525893514]
  Online on-policy preference learning algorithms for language model alignment can significantly outperform their offline counterparts.<n>We analyze how the sampling policy's coverage evolves throughout on-policy training.<n>We develop principled on-policy schemes for reward distillation in the general function class setting.
  arXiv  Detail & Related papers  (2026-01-13T10:46:06Z)
• SpeedAug: Policy Acceleration via Tempo-Enriched Policy and RL Fine-Tuning [52.29534291796025]
  Reinforcement learning is a promising approach that adapts policies for faster execution without additional demonstration.<n>We propose SpeedAug, an RL-based policy acceleration framework that efficiently adapts pre-trained policies for faster task execution.
  arXiv  Detail & Related papers  (2025-11-24T04:25:47Z)
• On-Device Diffusion Transformer Policy for Efficient Robot Manipulation [26.559546714450324]
  Diffusion Policies have significantly advanced robotic manipulation tasks via imitation learning.<n>Their application on resource-constrained mobile platforms remains challenging due to computational inefficiency and extensive memory footprint.<n>We propose LightDP, a novel framework specifically designed to accelerate Diffusion Policies for real-time deployment on mobile devices.
  arXiv  Detail & Related papers  (2025-08-01T15:14:39Z)
• Relative Entropy Pathwise Policy Optimization [66.03329137921949]
  We present an on-policy algorithm that trains Q-value models purely from on-policy trajectories.<n>We show how to combine policies for exploration with constrained updates for stable training, and evaluate important architectural components that stabilize value function learning.
  arXiv  Detail & Related papers  (2025-07-15T06:24:07Z)
• Can Prompt Difficulty be Online Predicted for Accelerating RL Finetuning of Reasoning Models? [65.18157595903124]
  This work investigates iterative approximate evaluation for arbitrary prompts.<n>It introduces Model Predictive Prompt Selection (MoPPS), a Bayesian risk-predictive framework.<n>MoPPS reliably predicts prompt difficulty and accelerates training with significantly reduced rollouts.
  arXiv  Detail & Related papers  (2025-07-07T03:20:52Z)
• Flow-Based Single-Step Completion for Efficient and Expressive Policy Learning [0.0]
  We propose a generative policy trained with an augmented flow-matching objective to predict direct completion vectors from intermediate flow samples.<n>Our method scales effectively to offline, offline-to-online, and online RL settings, offering substantial gains in speed and adaptability.<n>We extend SSCP to goal-conditioned RL, enabling flat policies to exploit subgoal structures without explicit hierarchical inference.
  arXiv  Detail & Related papers  (2025-06-26T16:09:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.