Skip to content

The Composition Gap in Dataset Distillation

Sep 2026 · 0 citations
Computer Science

TL;DR

This work asks whether the union of separately distilled sets reproduces training on the union of the real data composability and shows that it can fail even when every source is distilled exactly and the total budget admits an exact joint distillate.

Abstract

Dataset distillation compresses a training set into a small synthetic set, usually evaluated one at a time. In federated and data-governance settings, several parties distill their own data and a user trains on their union. We ask whether the union of separately distilled sets reproduces training on the union of the real data composability and show that it can fail even when every source is distilled exactly and the total budget admits an exact joint distillate. Compressing a training trajectory into fewer steps transforms the source statistics nonlinearly, so averaging compressed sources differs from compressing their average. For quadratic objectives we derive the exact composition error for two-to-one step compression in terms of the source-Hessian variance and the linear terms of the losses, and on a smooth network at small step sizes this prediction captures the local endpoint discrepancy in magnitude and direction. For learned synthetic sets, however, the composed error decomposes exactly into this local discrepancy and an aggregate source residual. Under endpoint matching the residual exceeds the structural term by more than an order of magnitude, and under distribution matching the two terms partly cancel. Joint distillation also retains an accuracy advantage when both sets are distilled from the same dataset, where the local discrepancy is exactly zero. Training fidelity and downstream accuracy are therefore distinct requirements, neither established by evaluating each set on its own.

View source

Similar papers

#machine learning Preprint Sep 2026

Data Unlearning via Inverse Distillation

Multi-step matching models, including flow and diffusion models, produce high-quality outputs but incur substantial inference costs and may reproduce unwanted components of their training datasets. We introduce Inverse Distillation Unlearning (IDU), a unified framework that simultaneously distills a teacher multi-step...

Aleksei Leonov, N. Kornilov, Zhen-He Zhang et al. · 0 citations
Preprint Sep 2026

PSM: Dataset Distillation Based on Precise Statistical Matching by Difficulty

Dataset distillation (DD) condenses a large original dataset into a small distilled dataset with high training utility. Decoupled statistical matching methods substantially reduce distillation time and memory overhead while achieving strong performance. However, they typically supervise all distilled samples using runn...

Hong-Xu Ma, Guang Li, Shi-Jie Wang et al. · 0 citations
Sep 2026

Optimal Transport-based Difficulty-aware Contribution Allocation for Dataset Distillation.

This work reformulate homogeneous distance minimization as a bi-level optimization problem via a matching-and-approximating paradigm and introduces a difficulty-aware marginal reweighting mechanism to emphasize informative instances while preserving global geometric consistency.

Xiao Cui, Yu-Lei Qin, Mo Zhu et al. · 1 citation
#machine learning Preprint Oct 2026

Simplifying and Improving On-Policy Distillation for Few-Step Diffusion

Few-step distillation reduces the sampling cost of diffusion and flow models, but existing approaches often require auxiliary score models or specialized architectures. We show that simple on-policy velocity regression already provides a strong foundation for 4-NFE generation. To represent teacher velocity variation wi...

Jia-Wei Zhang, Zi-Yu Wan, Nan-Ye Ma et al. · 0 citations
Preprint Oct 2026

Functional Cross-layer Experts Routing for One-step Diffusion Distillation

DeMoE is proposed, which pairs a persistent shared expert with conditionally routed expert slices across image FFNs, trained under a one-step distribution-matching objective with executed-route supervision, demonstrating that structured internal computation reallocation provides a superior compression paradigm for diff...

Zi-Le Huang, Ser-Nam Lim · 0 citations
#artificial intelligence Preprint Oct 2026

Consistent Distribution Matching for Data-Free Diffusion Distillation

Flow and diffusion models suffer from slow inference due to computationally expensive numerical integration. Distillation provides a promising way for a student model to learn from a teacher's dynamics, enabling one-step or few-step generation. However, existing methods often depend on curated distillation datasets, co...

Yu-Xiang Fu, Qi Yan, Zike Wu et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.