Dataset Condensation Atlas

Method · Optimization and training recipes

Teddy

Teddy: Efficient Large-Scale Dataset Distillation via Taylor-Approximated Matching

Ruonan Yu, Songhua Liu, Jingwen Ye, Xinchao Wang

ECCV 2024 · first public 2024-10-10 · arXiv 2410.07579

paper ↗catalogued✓ abstract read

In one paragraph

Replaces the multi-step-gradient dependence of bi-level, trajectory-style dataset distillation with a memory-efficient first-order Taylor approximation, and replaces repeated per-iteration model training with a pre-cached pool of weak models generated from a single base model, reporting up to 12.8-point gains and 46.6% less runtime over prior methods on Tiny-ImageNet and full-size ImageNet-1K.

Where it sits

Abstract (verbatim from arXiv)

Dataset distillation or condensation refers to compressing a large-scale dataset into a much smaller one, enabling models trained on this synthetic dataset to generalize effectively on real data. Tackling this challenge, as defined, relies on a bi-level optimization algorithm: a novel model is trained in each iteration within a nested loop, with gradients propagated through an unrolled computation graph. However, this approach incurs high memory and time complexity, posing difficulties in scaling up to large datasets such as ImageNet. Addressing these concerns, this paper introduces Teddy, a Taylor-approximated dataset distillation framework designed to handle large-scale dataset and enhance efficiency. On the one hand, backed up by theoretical analysis, we propose a memory-efficient approximation derived from Taylor expansion, which transforms the original form dependent on multi-step gradients to a first-order one. On the other hand, rather than repeatedly training a novel model in each iteration, we unveil that employing a pre-cached pool of weak models, which can be generated from a single base model, enhances both time efficiency and performance concurrently, particularly when dealing with large-scale datasets. Extensive experiments demonstrate that the proposed Teddy attains state-of-the-art efficiency and performance on the Tiny-ImageNet and original-sized ImageNet-1K dataset, notably surpassing prior methods by up to 12.8%, while reducing 46.6% runtime. Our code will be available at https://github.com/Lexie-YU/Teddy.

BibTeX (generated; prefer the venue's official entry)
@article{yu2024teddy,
  title   = {Teddy: Efficient Large-Scale Dataset Distillation via Taylor-Approximated Matching},
  author  = {Ruonan Yu and Songhua Liu and Jingwen Ye and Xinchao Wang},
  journal = {ECCV 2024},
  year    = {2024}
}

Nearby in Optimization and training recipes

2026-05

C^2R — Mind Your Margin and Boundary: Are Your Distilled Datasets Truly Robust?

Muquan Li, Yingyi Ma, Yihong Huang et al. · ICML 2026notablepaper ↗

2026-04

COBRA — Fair Dataset Distillation via Cross-Group Barycenter Alignment

Mohammad Hossein Moslemi, Nima Hosseini Dashtbayaz, Zhimin Mei et al. · ICML 2026notablepaper ↗code ↗

2026-03

PTM-ST — Multimodal Dataset Distillation via Phased Teacher Models

Shengbin Guo, Hang Zhao, Senqiao Yang et al. · ICLR 2026notableVision–languagepaper ↗code ↗

2026-03

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

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

2025-05

PRISM — PRISM: Video Dataset Condensation with Progressive Refinement and Insertion for Sparse Motion

Jaehyun Choi, Jiwan Hur, Gyojin Han et al. · CVPR 2026notableVideopaper ↗