Pith. sign in

REVIEW 3 cited by

Sparse Diffusion Policy: A Sparse, Reusable, and Flexible Policy for Robot Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.01531 v2 pith:TVMUNXE3 submitted 2024-07-01 cs.RO cs.LG

classification cs.ROcs.LG
keywords policytaskslearningsparsediffusionefficientexpertsactive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The increasing complexity of tasks in robotics demands efficient strategies for multitask and continual learning. Traditional models typically rely on a universal policy for all tasks, facing challenges such as high computational costs and catastrophic forgetting when learning new tasks. To address these issues, we introduce a sparse, reusable, and flexible policy, Sparse Diffusion Policy (SDP). By adopting Mixture of Experts (MoE) within a transformer-based diffusion policy, SDP selectively activates experts and skills, enabling efficient and task-specific learning without retraining the entire model. SDP not only reduces the burden of active parameters but also facilitates the seamless integration and reuse of experts across various tasks. Extensive experiments on diverse tasks in both simulations and real world show that SDP 1) excels in multitask scenarios with negligible increases in active parameters, 2) prevents forgetting in continual learning of new tasks, and 3) enables efficient task transfer, offering a promising solution for advanced robotic applications. Demos and codes can be found in https://forrest-110.github.io/sparse_diffusion_policy/.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. High-Fidelity One-Step Generative Visuomotor Policy via Recursive Correction, Frequency Consistency, and Contrastive Flow Matching

    cs.RO 2026-07 conditional novelty 6.0 of 10

    One-step flow-matching visuomotor policy with recursive correction, dual-timestep spectral consistency, and contrastive mode separation matches or exceeds 10-step baselines at 1 NFE.

  2. Learning Semantic Atomic Skills for Multi-Task Robotic Manipulation

    cs.RO 2025-12 conditional novelty 6.0 of 10

    An imitation-learning system that segments demonstrations into VLM-labeled atomic skills, aligns them with contrastive learning, and uses keypose prediction to chain skills, outperforming prior baselines in multi-task...

  3. RCM-ACT: Imitation Learning with Dynamic RCM Calibration for Autonomous Intraocular Foreign Body Removal

    cs.RO 2025-08 conditional novelty 6.0 of 10

    An imitation-learning robot with dynamic coordinate calibration can grasp and place a 1.22 mm ring in an eye model with 0.686 mm average error, but full-task success was only 5/10 in the reported table.

Pith tools