Method · Distribution and feature matching
Dataset Distillation via Adversarial Prediction Matching
Mingyang Chen, Bo Huang, Junda Lu, Bing Li, Yi Wang, Minhao Cheng, Wei Wang
arXiv 2023 · first public 2023-12-14 · arXiv 2312.08912
In one paragraph
Minimizes the prediction discrepancy on real data between a model trained on the full dataset and one trained on the distilled set, using a single-level adversarial framework in place of nested bi-level optimization or long trajectory unrolling. Reports distilled sets at 10% of the original size reaching 94% of full-data accuracy on average across datasets including ImageNet-1K, at 2.5x less memory and 5x less runtime than the prior state of the art, with ImageNet-1K distillation possible in 6.5GB of GPU memory.
Where it sits
- Distribution and feature matching (Surrogate matching)
- Setting: Image classification
Design choices
| Optimization regime | single-level |
Abstract (verbatim from arXiv)
Dataset distillation is the technique of synthesizing smaller condensed datasets from large original datasets while retaining necessary information to persist the effect. In this paper, we approach the dataset distillation problem from a novel perspective: we regard minimizing the prediction discrepancy on the real data distribution between models, which are respectively trained on the large original dataset and on the small distilled dataset, as a conduit for condensing information from the raw data into the distilled version. An adversarial framework is proposed to solve the problem efficiently. In contrast to existing distillation methods involving nested optimization or long-range gradient unrolling, our approach hinges on single-level optimization. This ensures the memory efficiency of our method and provides a flexible tradeoff between time and memory budgets, allowing us to distil ImageNet-1K using a minimum of only 6.5GB of GPU memory. Under the optimal tradeoff strategy, it requires only 2.5$\times$ less memory and 5$\times$ less runtime compared to the state-of-the-art. Empirically, our method can produce synthetic datasets just 10% the size of the original, yet achieve, on average, 94% of the test accuracy of models trained on the full original datasets including ImageNet-1K, significantly surpassing state-of-the-art. Additionally, extensive tests reveal that our distilled datasets excel in cross-architecture generalization capabilities.
BibTeX (generated; prefer the venue's official entry)
@article{chen2023dataset,
title = {Dataset Distillation via Adversarial Prediction Matching},
author = {Mingyang Chen and Bo Huang and Junda Lu and Bing Li and Yi Wang and Minhao Cheng and Wei Wang},
journal = {arXiv preprint arXiv:2312.08912},
year = {2023}
}Nearby in Distribution and feature matching
RAHA — Rank-Aware Hyperbolic Alignment for Vision-Language Dataset Distillation
Jongoh Jeong, Sun-Kyung Lee, Kuk-Jin Yoon · ECCV 2026notableVision–languagepaper ↗code ↗
MDM — Multimodal Distribution Matching for Vision-Language Dataset Distillation
Jongoh Jeong, Hoyong Kwon, Minseok Kim et al. · CVPR 2026notableVision–languagepaper ↗code ↗
Harmonic Dataset Distillation for Time Series Forecasting
Seungha Hong, Sanghwan Jang, Wonbin Kweon et al. · AAAI 2026notableTime seriespaper ↗
Algorithmic Guarantees for Distilling Supervised and Offline RL Datasets
Aaryan Gupta, Rishi Saket, Aravindan Raghuveer · ICLR 2026notableOther datapaper ↗