Papers › Switch Diffusion Transformer: Synergizing Denoising Tasks with Sparse Mixture-of-Experts

Switch Diffusion Transformer: Synergizing Denoising Tasks with Sparse Mixture-of-Experts

14 Mar 2024arXiv:2403.09176archive 2025-07-28

Byeongjun Park, Hyojun Go, Jin-Young Kim, Sangmin Woo, Seokil Ham, Changick Kim

Diffusion models have achieved remarkable success across a range of generative tasks. Recent efforts to enhance diffusion model architectures have reimagined them as a form of multi-task learning, where each task corresponds to a denoising task at a specific noise level. While these efforts have focused on parameter isolation and task routing, they fall short of capturing detailed inter-task relationships and risk losing semantic information, respectively. In response, we introduce Switch Diffusion Transformer (Switch-DiT), which establishes inter-task relationships between conflicting tasks without compromising semantic information. To achieve this, we employ a sparse mixture-of-experts within each transformer block to utilize semantic information and facilitate handling conflicts in tasks through parameter isolation. Additionally, we propose a diffusion prior loss, encouraging similar tasks to share their denoising paths while isolating conflicting ones. Through these, each transformer block contains a shared expert across all tasks, where the common and task-specific denoising paths enable the diffusion model to construct its beneficial way of synergizing denoising tasks. Extensive experiments validate the effectiveness of our approach in improving both image quality and convergence rate, and further analysis demonstrates that Switch-DiT constructs tailored denoising paths across various generation scenarios.

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="2403.09176")

Code

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

By repository: official repository: 18 samples from 1 repository, 14 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

byeongjun-park/Switch-DiT officialmentioned on GitHubpytorchMIT report
byeongjun-park/SteerX mentioned on GitHubpytorch report

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

18 samples harvested; 14 ran; 3 honoured the contract we drafted; 4 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.

3ran · honoured contract
5ran · our draft was wrong
1ran · fixture could not drive it
5ran
4unverified

Licence: 0 of the 18 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 byeongjun-park/Switch-DiT. “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.

approx_standard_normal_cdf byeongjun-park/Switch-DiT/diffusion/diffusion_utils.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · d6a68e210556f857 · report
bipartite_matching byeongjun-park/Switch-DiT/util/model_util.py official repository ran MIT (permissive) · 7025a15a914aa29c · report
compute_gating byeongjun-park/Switch-DiT/util/model_util.py official repository ran MIT (permissive) · cab0618c0a02c1dd · report
continuous_gaussian_log_likelihood byeongjun-park/Switch-DiT/diffusion/diffusion_utils.py official repository ran · our draft was wrong MIT (permissive) · ab1c9568b4e13899 · report
create_mask_tasks byeongjun-park/Switch-DiT/models/DiT/models.py official repository ran MIT (permissive) · 65dba4593dc4b27d · report
create_mask_tasks byeongjun-park/Switch-DiT/models/taskrouting.py official repository ran MIT (permissive) · 0562beb66a52dbef · report
create_npz_from_sample_folder byeongjun-park/Switch-DiT/sample_ddp.py official repository ran · our draft was wrong MIT (permissive) · 7b21a01ae77703a3 · report
get_2d_sincos_pos_embed byeongjun-park/Switch-DiT/models/DiT/models.py official repository ran · honoured contract MIT (permissive) · c92c27c924b517e8 · report
get_beta_schedule byeongjun-park/Switch-DiT/diffusion/gaussian_diffusion.py official repository ran · honoured contract MIT (permissive) · 3e0fa4efc22272d4 · report
mean_flat byeongjun-park/Switch-DiT/diffusion/gaussian_diffusion.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · f6d7c009a8efb8b7 · report
modulate byeongjun-park/Switch-DiT/util/model_util.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 03310bba324ae4fb · report
normal_kl byeongjun-park/Switch-DiT/diffusion/diffusion_utils.py official repository ran · honoured contract fingerprinted MIT (permissive) · 8afbfc42c6ea0448 · report
sample_t_batch byeongjun-park/Switch-DiT/models/UW.py official repository ran MIT (permissive) · 567312c76772b0dd · report
space_timesteps byeongjun-park/Switch-DiT/diffusion/respace.py official repository ran · fixture could not drive it MIT (permissive) · ea9dbc131adf582e · report
download_model byeongjun-park/Switch-DiT/download.py official repository unverified MIT (permissive) · 6a0d5ecd441905cc · report
find_model byeongjun-park/Switch-DiT/download.py official repository unverified MIT (permissive) · 29947a0a94157558 · report
get_2d_sincos_pos_embed_from_grid byeongjun-park/Switch-DiT/models/DiT/models.py official repository unverified MIT (permissive) · 665d8a4e8f673a4c · report
get_named_beta_schedule byeongjun-park/Switch-DiT/diffusion/gaussian_diffusion.py official repository unverified MIT (permissive) · 4f55c34a92359642 · report

Tasks

DenoisingMixture-of-ExpertsMulti-Task Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute 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