Method · Kernel and closed-form inner solvers
FRePo
Dataset Distillation using Neural Feature Regression
Yongchao Zhou, Ehsan Nezhadarya, Jimmy Ba
NeurIPS 2022 · first public 2022-06-01 · arXiv 2206.00719
In one paragraph
Replaces the closed-form kernel-ridge-regression solver of prior kernel-based distillation with regression onto the features of a pool of finite-width networks (neural Feature Regression with Pooling), reducing memory by an order of magnitude and training time by two orders of magnitude while improving accuracy on CIFAR-100, Tiny-ImageNet and ImageNet-1K.
Explained
What came before
Responds directly to kip-2021's exact-NTK closed-form inner solver, which the paper states requires "thousands of GPU hours and sophisticated implementation of the distributed kernel computation framework" for modern architectures, and to dd-2018-style unrolled BPTT, which needs the whole training trajectory in memory. Also responds to surrogate-matching alternatives (dc-2021, dsa-2021 gradient matching; CAFE/DM distribution matching; mtt-2022 trajectory matching), arguing each surrogate can introduce its own bias and typically overfits to a single learning algorithm, training stage, or architecture.
The problem
Meta-gradient computation for dataset distillation is expensive (unrolled BPTT) or requires an intractable exact kernel (KIP-style NTK for deep nets); separately, distilled data tends to overfit to the specific algorithm, training stage, or architecture used during synthesis, hurting cross-architecture transfer.
How it works
Splits the matching network into a feature extractor $f(\cdot,\theta)$ and a linear head, and instead of learning the head by gradient descent, solves for it via kernel ridge regression on the extractor's own features (a "conjugate kernel," not the NTK): $\mathcal{L}=\tfrac12\|Y_t-K^\theta_{X_tX_s}(K^\theta_{X_sX_s}+\lambda I)^{-1}Y_s\|_2^2$. Backpropagating this loss through the fixed feature extractor gives the meta-gradient for the synthetic images $X_s$ (and, since the loss is smooth in $Y_s$, learned labels), with no need to unroll the extractor's own training. A "model pool" of $m$ feature extractors at different initializations and training stages is maintained; each step samples one pool member, uses it for the KRR meta-gradient, takes one online training step on it with the current synthetic data, and reinitializes it once it has been updated more than $K$ steps -- diversifying which extractor is matched against, unlike a single periodically-reset model. Stored artifact: only the synthetic images and (optionally) learned labels; the pool is discarded after training.
Evidence
CIFAR-100 x 1 IPC x FRePo x learned labels x 28.7% (Table 1) vs. MTT 24.3%, KIP 15.7%, DSA 16.8%, DM 12.2%; Tiny-ImageNet x 1 IPC: 15.4% (FRePo) vs. MTT 8.8%, DSA 6.6%; CUB-200 x 1 IPC: 12.4% (FRePo) vs. MTT 2.2% -- the paper's headline claim that FRePo is exceptionally strong on complex, many-class label spaces at 1 IPC. Cross-architecture transfer (Table 2, CIFAR-10 x 10 IPC, trained on Conv-BN): FRePo beats DSA/DM/MTT/KIP on every unseen evaluation architecture (Conv-NN 65.5% vs. MTT's 41.6%; AlexNet 61.9% vs. KIP's 57.2%; VGG-BN 59.4% vs. MTT's 46.6%), and the paper notes instance normalization -- used by DSA/DM/MTT -- specifically hurts their cross-architecture transfer, while FRePo's images "look natural" and carry less architectural bias. Resized ImageNet-1K (64x64): 1-2 IPC (1k/2k images) reaches 7.5%/9.7% top-1 vs. 1.1%/1.4% for an equally sized random real subset (no comparison to MTT is given at this scale in-paper). Cost: on CIFAR-100 at 1 IPC, FRePo matches MTT's accuracy (~24%) in 38 seconds vs. MTT's 3,805 seconds (~100x faster) and reaches 92% of its own final accuracy in 385 seconds, with roughly 10x lower peak GPU memory (Fig. 3). Downstream: 5-/10-step class-incremental continual learning on CIFAR-100 (41.6%/38.0% final accuracy vs. DM's 33.9%/34.0%) and membership- inference defense (attack AUC near 0.5, i.e., near random guessing, on MNIST/FashionMNIST at 500 images) both improve over DSA/DM at matched budget. Ablation: label learning is unnecessary on simple, few-class datasets (MNIST) but becomes crucial on complex many-class datasets (CIFAR-100, Tiny-ImageNet), isolating label richness as the mechanism behind the many-class gains.
Limitations
Requires a wider network architecture than prior methods for the KRR component to behave well (a narrow feature dimension causes a significant accuracy drop, per Appendix C.6), so comparisons are not always at matched architecture width. No data augmentation is used during synthesis (only at evaluation), unlike dsa-2021/mtt-2022. Diversifying the model pool with multiple architectures (rather than just different seeds/stages of one architecture) was tried but found unstable, since meta-gradients from different architectures can disagree sharply -- so the reported cross-architecture generalization comes from a single-architecture pool, not explicit multi-architecture training. Splitting per-class distillation across sequential continual-learning steps was observed to underperform distilling the same total budget in one pass, suggesting the joint, whole-dataset view is important. ImageNet-1K results are at only 1-2 IPC and use hard evaluation without any teacher-relabeling or soft-label scheme (unlike tesla-2023's contemporaneous ImageNet-1K soft-label approach), leaving unclear how far the closed-form-KRR proxy scales past very low IPC on datasets with 1,000 classes.
Written by the atlas from the paper's full text. Check the paper for exact numbers.
Where it sits
- Kernel and closed-form inner solvers (Bi-level performance matching)
- Setting: Image classification
Design choices
| What is stored | pixels |
| Labels | mixed |
| Prior / networks used | random-networks |
| Optimization regime | bilevel |
| Largest scale evaluated | tiny-imagenet, imagenet-subsets, imagenet-1k |
Abstract (verbatim from arXiv)
Dataset distillation aims to learn a small synthetic dataset that preserves most of the information from the original dataset. Dataset distillation can be formulated as a bi-level meta-learning problem where the outer loop optimizes the meta-dataset and the inner loop trains a model on the distilled data. Meta-gradient computation is one of the key challenges in this formulation, as differentiating through the inner loop learning procedure introduces significant computation and memory costs. In this paper, we address these challenges using neural Feature Regression with Pooling (FRePo), achieving the state-of-the-art performance with an order of magnitude less memory requirement and two orders of magnitude faster training than previous methods. The proposed algorithm is analogous to truncated backpropagation through time with a pool of models to alleviate various types of overfitting in dataset distillation. FRePo significantly outperforms the previous methods on CIFAR100, Tiny ImageNet, and ImageNet-1K. Furthermore, we show that high-quality distilled data can greatly improve various downstream applications, such as continual learning and membership inference defense. Please check out our webpage at https://sites.google.com/view/frepo.
BibTeX (generated; prefer the venue's official entry)
@article{zhou2022dataset,
title = {Dataset Distillation using Neural Feature Regression},
author = {Yongchao Zhou and Ehsan Nezhadarya and Jimmy Ba},
journal = {NeurIPS 2022},
year = {2022}
}Nearby in Kernel and closed-form inner solvers
MMDD — Efficient Multi-modal Dataset Distillation via Analytic Parameter Matching
Deyu Bo, Xinchao Wang · ICML 2026notableVision–languagepaper ↗code ↗
Provable KRR DD — Provable and Efficient Dataset Distillation for Kernel Ridge Regression
Yilan Chen, Wei Huang, Tsui-Wei Weng · NeurIPS 2024notablepaper ↗
Rethinking Backdoor Attacks on Dataset Distillation: A Kernel Method Perspective
Ming-Yu Chung, Sheng-Yen Chou, Chia-Mu Yu et al. · ICLR 2024notablepaper ↗
KRR-ST — Self-Supervised Dataset Distillation for Transfer Learning
Dong Bok Lee, Seanie Lee, Joonho Ko et al. · ICLR 2024corePre-training & transferpaper ↗code ↗