Papers › Efficient Diffusion Transformer Policies with Mixture of Expert Denoisers for...

Efficient Diffusion Transformer Policies with Mixture of Expert Denoisers for Multitask Learning

17 Dec 2024arXiv:2412.12953archive 2025-07-28

Moritz Reuss, Jyothish Pari, Pulkit Agrawal, Rudolf Lioutikov

Diffusion Policies have become widely used in Imitation Learning, offering several appealing properties, such as generating multimodal and discontinuous behavior. As models are becoming larger to capture more complex capabilities, their computational demands increase, as shown by recent scaling laws. Therefore, continuing with the current architectures will present a computational roadblock. To address this gap, we propose Mixture-of-Denoising Experts (MoDE) as a novel policy for Imitation Learning. MoDE surpasses current state-of-the-art Transformer-based Diffusion Policies while enabling parameter-efficient scaling through sparse experts and noise-conditioned routing, reducing both active parameters by 40% and inference costs by 90% via expert caching. Our architecture combines this efficient scaling with noise-conditioned self-attention mechanism, enabling more effective denoising across different noise levels. MoDE achieves state-of-the-art performance on 134 tasks in four established imitation learning benchmarks (CALVIN and LIBERO). Notably, by pretraining MoDE on diverse robotics data, we achieve 4.01 on CALVIN ABC and 0.95 on LIBERO-90. It surpasses both CNN-based and Transformer Diffusion Policies by an average of 57% across 4 benchmarks, while using 90% fewer FLOPs and fewer active parameters compared to default Diffusion Transformer architectures. Furthermore, we conduct comprehensive ablations on MoDE's components, providing insights for designing efficient and scalable Transformer architectures for Diffusion Policies. Code and demonstrations are available at https://mbreuss.github.io/MoDE_Diffusion_Policy/.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2412.12953")

Code

Syntology Ran 5 of 11 code samples harvested from 1 repository linked to this paper; 6 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 2 ran · fixture could not drive it; 2 ran with no contract checked.

By repository: community (archive-listed): 11 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 5 ran; 0 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
2ran · fixture could not drive it
2ran
6unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from intuitive-robots/MoDE_Diffusion_Policy. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

append_dims intuitive-robots/MoDE_Diffusion_Policy/mode/models/edm_diffusion/utils.py community (archive-listed) ran · fixture could not drive it fingerprinted MIT (permissive) · 30befb7e4327e615 · report
append_zero intuitive-robots/MoDE_Diffusion_Policy/mode/models/edm_diffusion/gc_sampling.py community (archive-listed) ran · fixture could not drive it fingerprinted MIT (permissive) · 43f2167b019a5fb7 · report
get_sigmas_exponential intuitive-robots/MoDE_Diffusion_Policy/mode/models/edm_diffusion/gc_sampling.py community (archive-listed) ran MIT (permissive) · 205e97641ece09f8 · report
get_sigmas_karras intuitive-robots/MoDE_Diffusion_Policy/mode/models/edm_diffusion/gc_sampling.py community (archive-listed) ran MIT (permissive) · a3ae2e8a897b4d99 · report
rand_log_normal intuitive-robots/MoDE_Diffusion_Policy/mode/models/edm_diffusion/utils.py community (archive-listed) ran · our draft was wrong MIT (permissive) · ec8364ee198f15b3 · report
load_npz intuitive-robots/MoDE_Diffusion_Policy/mode/datasets/disk_dataset.py community (archive-listed) unverified MIT (permissive) · 68787b0149b5e4bf · report
load_pkl intuitive-robots/MoDE_Diffusion_Policy/mode/datasets/disk_dataset.py community (archive-listed) unverified MIT (permissive) · 45af63efa9933397 · report
return_time_sigma_embedding_model intuitive-robots/MoDE_Diffusion_Policy/mode/models/edm_diffusion/utils.py community (archive-listed) unverified MIT (permissive) · 6f1fce523ddeea43 · report
setup_callbacks intuitive-robots/MoDE_Diffusion_Policy/mode/training_calvin.py community (archive-listed) unverified MIT (permissive) · 0e68bc534d7f6740 · report
setup_logger intuitive-robots/MoDE_Diffusion_Policy/mode/training_calvin.py community (archive-listed) unverified MIT (permissive) · 765bd1c53cf958eb · report
split_trajectories intuitive-robots/MoDE_Diffusion_Policy/mode/datasets/libero_data_module.py community (archive-listed) unverified MIT (permissive) · 38618aea799ddc0e · report

Tasks

DenoisingImitation LearningRobot ManipulationZero-shot Generalization

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
LIBERO-10 MoDE Average Success Rate 0.94 #1 of 1 Archive leaderboard report
LIBERO-90 MoDE Average Success Rate 0.95 #1 of 1 Archive leaderboard report
Robot Manipulation CALVIN MoDE avg. sequence length (D to D) 4.01 #7 of 19 Archive leaderboard report
Zero-shot Generalization CALVIN MoDE Avg. sequence length 4.01 #2 of 5 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

ABCAbsolute Position EncodingsAdamAttentionBPEDense ConnectionsDiffusionDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections