Dataset Condensation Atlas

Method · Decoupled teacher-driven synthesis

E2D

Accelerating Large-Scale Dataset Distillation via Exploration-Exploitation Optimization

Muhammad J. Alahmadi, Peng Gao, Feiyi Wang, Dongkuan Xu

arXiv 2026 · first public 2026-02-17 · arXiv 2602.15277

paper ↗code ↗catalogued✓ abstract read

In one paragraph

Speeds up decoupled dataset distillation with a two-phase Exploration-Exploitation Distillation (E2D) schedule: initialization from full real images preserves semantic content, an exploration phase applies uniform updates to locate high-loss regions, and an exploitation phase concentrates further updates there. Reports surpassing prior decoupled methods on ImageNet-1K while running about 18x faster, and improving accuracy on ImageNet-21K at roughly 4.3x the speed.

Where it sits

Abstract (verbatim from arXiv)

Dataset distillation compresses the original data into compact synthetic datasets, reducing training time and storage while retaining model performance, enabling deployment under limited resources. Although recent decoupling-based distillation methods enable dataset distillation at large scale, they continue to face an efficiency gap: optimization-based decoupling methods achieve higher accuracy but demand intensive computation, whereas optimization-free decoupling methods are efficient but sacrifice accuracy. To overcome this trade-off, we propose Exploration--Exploitation Distillation (E$^2$D), a simple, practical method that minimizes redundant computation through an efficient pipeline that begins with full-image initialization to preserve semantic integrity and feature diversity. It then uses a two-phase optimization strategy: an exploration phase that performs uniform updates and identifies high-loss regions, and an exploitation phase that focuses updates on these regions to accelerate convergence. We evaluate E$^2$D on large-scale benchmarks, surpassing the state-of-the-art on ImageNet-1K while being $18\times$ faster, and on ImageNet-21K, our method substantially improves accuracy while remaining $4.3\times$ faster. These results demonstrate that targeted, redundancy-reducing updates, rather than brute-force optimization, bridge the gap between accuracy and efficiency in large-scale dataset distillation. Code is available at https://github.com/ncsu-dk-lab/E2D.

BibTeX (generated; prefer the venue's official entry)
@article{alahmadi2026accelerating,
  title   = {Accelerating Large-Scale Dataset Distillation via Exploration-Exploitation Optimization},
  author  = {Muhammad J. Alahmadi and Peng Gao and Feiyi Wang and Dongkuan Xu},
  journal = {arXiv preprint arXiv:2602.15277},
  year    = {2026}
}

Nearby in Decoupled teacher-driven synthesis

2026-07

CIM — Condensing Large-Scale Datasets Directly with Minimal Information Loss

Xinyi Shang, Peng Sun, Bei Shi et al. · ECCV 2026notablepaper ↗code ↗

2026-03

FD2 — FD$^2$: A Dedicated Framework for Fine-Grained Dataset Distillation

Hongxu Ma, Guang Li, Shijie Wang et al. · ECCV 2026notablepaper ↗

2026-02

Fixed Anchors Are Not Enough: Dynamic Retrieval and Persistent Homology for Dataset Distillation

Muquan Li, Hang Gou, Yingyi Ma et al. · CVPR 2026notablepaper ↗

2026-01

Grounding and Enhancing Informativeness and Utility in Dataset Distillation

Shaobo Wang, Yantai Yang, Guo Chen et al. · ICLR 2026notablepaper ↗

2026-01

OGM — Beyond Soft Label: Dataset Distillation via Orthogonal Gradient Matching

Deyu Bo, Xinchao Wang · CVPR 2026notablepaper ↗