Dataset Condensation Atlas

Method · Trajectory matching

MCT

Towards Stable and Storage-efficient Dataset Distillation: Matching Convexified Trajectory

Wenliang Zhong, Haoyu Tang, Qinghai Zheng, Mingzhu Xu, Yupeng Hu, Liqiang Nie

CVPR 2025 · first public 2024-06-28 · arXiv 2406.19827

paper ↗code ↗catalogued✓ abstract read

In one paragraph

Diagnoses three problems with matching training trajectories (MTT) — instability of SGD-generated expert trajectories, slow convergence, and high storage cost for stored trajectories — and replaces the target trajectory with a convex combination of expert trajectories derived from linearized neural-tangent-kernel dynamics, giving a smaller, continuously samplable, more stable target for the student to match.

Where it sits

Builds on

Abstract (verbatim from arXiv)

The rapid evolution of deep learning and large language models has led to an exponential growth in the demand for training data, prompting the development of Dataset Distillation methods to address the challenges of managing large datasets. Among these, Matching Training Trajectories (MTT) has been a prominent approach, which replicates the training trajectory of an expert network on real data with a synthetic dataset. However, our investigation found that this method suffers from three significant limitations: 1. Instability of expert trajectory generated by Stochastic Gradient Descent (SGD); 2. Low convergence speed of the distillation process; 3. High storage consumption of the expert trajectory. To address these issues, we offer a new perspective on understanding the essence of Dataset Distillation and MTT through a simple transformation of the objective function, and introduce a novel method called Matching Convexified Trajectory (MCT), which aims to provide better guidance for the student trajectory. MCT leverages insights from the linearized dynamics of Neural Tangent Kernel methods to create a convex combination of expert trajectories, guiding the student network to converge rapidly and stably. This trajectory is not only easier to store, but also enables a continuous sampling strategy during distillation, ensuring thorough learning and fitting of the entire expert trajectory. Comprehensive experiments across three public datasets validate the superiority of MCT over traditional MTT methods.

BibTeX (generated; prefer the venue's official entry)
@article{zhong2024towards,
  title   = {Towards Stable and Storage-efficient Dataset Distillation: Matching Convexified Trajectory},
  author  = {Wenliang Zhong and Haoyu Tang and Qinghai Zheng and Mingzhu Xu and Yupeng Hu and Liqiang Nie},
  journal = {CVPR 2025},
  year    = {2024}
}

Nearby in Trajectory matching

2026-03

PTM-ST — Multimodal Dataset Distillation via Phased Teacher Models

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

2026-01

AMD — Asynchronous Matching with Dynamic Sampling for Multimodal Dataset Distillation

Ding Qi, Jian Li, Shuguang Dou et al. · ICLR 2026notableVision–languagepaper ↗

2025-05

RepBlend — Beyond Modality Collapse: Representations Blending for Multimodal Dataset Distillation

Xin Zhang, Ziruo Zhang, Jiawei Du et al. · NeurIPS 2025notableVision–languagepaper ↗

2024-10

MKDT — Dataset Distillation via Knowledge Distillation: Towards Efficient Self-Supervised Pre-Training of Deep Networks

Siddharth Joshi, Jiayi Ni, Baharan Mirzasoleiman · ICLR 2025notablePre-training & transferpaper ↗code ↗

2024-08

LTDD — Distilling Long-tailed Datasets

Zhenghao Zhao, Haoxuan Wang, Yuzhang Shang et al. · CVPR 2025notablepaper ↗code ↗