Dataset Condensation Atlas

Method · Distribution and feature matching

CAFE

CAFE: Learning to Condense Dataset by Aligning Features

Kai Wang, Bo Zhao, Xiangyu Peng, Zheng Zhu, Shuo Yang, Shuo Wang, Guan Huang, Hakan Bilen, Xinchao Wang, Yang You

CVPR 2022 · first public 2022-03-03 · arXiv 2203.01531

paper ↗code ↗core✓ full text read

In one paragraph

Aligns multi-scale feature statistics between real and synthetic batches instead of matching gradients directly, while preserving synthetic-set discriminability with a classification loss and a dynamic bi-level optimization schedule that adaptively prevents over- and under-fitting, reporting up to an 11-point accuracy gain over prior methods on SVHN.

Explained

What came before

Gradient matching (dc-2021) and its differentiable-augmentation refinement (dsa-2021) synthesize images by matching per-step gradients between real and synthetic batches inside a bi-level loop.

The problem

The paper diagnoses that only a small number of hard or noisy samples produce dominant gradients late in training, so gradient matching overfits to those samples and lacks global supervision of the data distribution; because which samples are "hard" varies by architecture, this also hurts cross-architecture generalization.

The idea

Explicitly align real and synthetic feature statistics at every layer of a network instead of matching gradients, keep a discrimination loss so the synthetic feature centers remain valid classifiers, and replace the fixed inner/outer loop counts of gradient matching with a dynamic schedule that stops each loop once validation accuracy stops improving.

How it works

Optimizes synthetic pixel images. A 3-layer ConvNet is alternately trained on the current synthetic set (inner loop, re-initialized periodically) and used to compute a layer-wise feature alignment loss -- MSE between real and synthetic class-wise mean feature maps at every convolutional layer -- plus a discrimination loss in which synthetic feature centers classify real samples via cross-entropy. A "dynamic bi-level optimization" (Algorithm 1) uses performance queues over recent validation accuracy to decide when to end the inner and outer loops, rather than a fixed iteration budget. The scheme is still bi-level: unlike the later distribution-matching methods it inspired, a network is trained on the synthetic data throughout synthesis.

Evidence

SVHN, 1 IPC, ConvNet (avg of 100 trained networks): CAFE 42.6% vs. DC 31.2% (+11.4pp, Table 1). CIFAR-10, 50 IPC: CAFE 55.5% vs. DC 53.9%. CIFAR-100, 50 IPC: CAFE 37.9% vs. DC 42.8% (CAFE underperforms here). Training time (Table 5, CIFAR-10 IPC=50): DC ~460 min vs. CAFE ~367 min (gamma=10) or ~117 min (gamma=5) -- the speedup comes from adaptive early stopping of the loops, not from removing the inner loop. Ablation (Table 2, CIFAR-10 IPC=50): discrimination loss alone 49.78%, layer-wise feature alignment alone 53.96%, both 54.53%, adding the dynamic schedule 55.50%.

Limitations

Only evaluated at MNIST/CIFAR/SVHN (32x32) scale, no ImageNet. Still requires training a network on the synthetic set throughout synthesis, so it does not reach the efficiency of the bi-level-free distribution matching (dm-2023) it is grouped with. Underperforms plain gradient matching (DC) on CIFAR-100 at 50 IPC. Cross-architecture accuracy remains modest (25-40%) despite the gain over DC. The dynamic schedule adds tunable thresholds (lambda_1, lambda_2, gamma) with a reported sensitivity study but no principled way to set them without a validation split.

Written by the atlas from the paper's full text. Check the paper for exact numbers.

Where it sits

Design choices

What is storedpixels
Labelshard
Prior / networks usedrandom-networks
Optimization regimebilevel
Largest scale evaluatedmnist-cifar

Builds on

Built on by

Abstract (verbatim from arXiv)

Dataset condensation aims at reducing the network training effort through condensing a cumbersome training set into a compact synthetic one. State-of-the-art approaches largely rely on learning the synthetic data by matching the gradients between the real and synthetic data batches. Despite the intuitive motivation and promising results, such gradient-based methods, by nature, easily overfit to a biased set of samples that produce dominant gradients, and thus lack global supervision of data distribution. In this paper, we propose a novel scheme to Condense dataset by Aligning FEatures (CAFE), which explicitly attempts to preserve the real-feature distribution as well as the discriminant power of the resulting synthetic set, lending itself to strong generalization capability to various architectures. At the heart of our approach is an effective strategy to align features from the real and synthetic data across various scales, while accounting for the classification of real samples. Our scheme is further backed up by a novel dynamic bi-level optimization, which adaptively adjusts parameter updates to prevent over-/under-fitting. We validate the proposed CAFE across various datasets, and demonstrate that it generally outperforms the state of the art: on the SVHN dataset, for example, the performance gain is up to 11%. Extensive experiments and analyses verify the effectiveness and necessity of proposed designs.

BibTeX (generated; prefer the venue's official entry)
@article{wang2022cafe,
  title   = {CAFE: Learning to Condense Dataset by Aligning Features},
  author  = {Kai Wang and Bo Zhao and Xiangyu Peng and Zheng Zhu and Shuo Yang and Shuo Wang and Guan Huang and Hakan Bilen and Xinchao Wang and Yang You},
  journal = {CVPR 2022},
  year    = {2022}
}

Nearby in Distribution and feature matching

2026-06

RAHA — Rank-Aware Hyperbolic Alignment for Vision-Language Dataset Distillation

Jongoh Jeong, Sun-Kyung Lee, Kuk-Jin Yoon · ECCV 2026notableVision–languagepaper ↗code ↗

2026-05

MDM — Multimodal Distribution Matching for Vision-Language Dataset Distillation

Jongoh Jeong, Hoyong Kwon, Minseok Kim et al. · CVPR 2026notableVision–languagepaper ↗code ↗

2026-03

Sneakdoor — SNEAKDOOR: Stealthy Backdoor Attacks against Distribution Matching-based Dataset Condensation

He Yang, Dongyi Lv, Song Ma et al. · NeurIPS 2025notablepaper ↗code ↗

2026-03

Harmonic Dataset Distillation for Time Series Forecasting

Seungha Hong, Sanghwan Jang, Wonbin Kweon et al. · AAAI 2026notableTime seriespaper ↗

2025-11

Algorithmic Guarantees for Distilling Supervised and Offline RL Datasets

Aaryan Gupta, Rishi Saket, Aravindan Raghuveer · ICLR 2026notableOther datapaper ↗