paper-with-me

홈 › Papers

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

2024-06-28 · CVPR 2025 1 · Wenliang Zhong, Haoyu Tang, Qinghai Zheng, Mingzhu Xu, Yupeng Hu, Liqiang Nie

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.

📄 PDF Abstract BibTeX arXiv:2406.19827

Code (0)

등록된 구현이 없습니다.

Tasks

Dataset Distillation

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Dataset Distillation with Convexified Implicit Gradients

2023-02-13 · Noel Loo, Ramin Hasani, Mathias Lechner, Daniela Rus

We propose a new dataset distillation algorithm using reparameterization and convexification of implicit gradients (RCIG), that substantially improves the state-of-the-art. To this end, we first formulate dataset distill…

Dataset DistillationDataset Distillation - 1IPC

Efficient Dataset Distillation for Pre-Trained Self-Supervised Models via Statistical Flow Matching

2026-02-05 · Qianxin Xia, Jiawei Du, Xin Zhang, Yuhan Zhang 외 arxiv

Dataset distillation seeks to synthesize a highly compact dataset that achieves performance comparable to the original dataset on downstream tasks. For the classification task that use pre-trained self-supervised models …

A Convexified Matching Approach to Imputation and Individualized Inference

2024-07-07 · YoonHaeng Hur, Tengyuan Liang

We introduce a new convexified matching method for missing value imputation and individualized inference inspired by computational optimal transport. Our method integrates favorable features from mainstream imputation ap…

counterfactualImputation

DREAM+: Efficient Dataset Distillation by Bidirectional Representative Matching

2023-10-23 · Yanqing Liu, Jianyang Gu, Kai Wang, Zheng Zhu 외

Dataset distillation plays a crucial role in creating compact datasets with similar training performance compared with original large-scale ones. This is essential for addressing the challenges of data storage and traini…

Dataset DistillationTransfer Learning

DREAM: Efficient Dataset Distillation by Representative Matching

2023-02-28 · ICCV 2023 1 · Yanqing Liu, Jianyang Gu, Kai Wang, Zheng Zhu 외

Dataset distillation aims to synthesize small datasets with little information loss from original large-scale ones for reducing storage and training costs. Recent state-of-the-art methods mainly constrain the sample synt…

Dataset DistillationDiversity