Dataset Distillation via the Wasserstein Metric
원문 초록
Dataset Distillation (DD) emerges as a powerful strategy to encapsulate the expansive information of large datasets into significantly smaller, synthetic equivalents, thereby preserving model performance with reduced computational overhead. Pursuing this objective, we introduce the Wasserstein distance, a metric grounded in optimal transport theory, to enhance distribution matching in DD. Our approach employs the Wasserstein barycenter to provide a geometrically meaningful method for quantifying distribution differences and capturing the centroid of distribution sets efficiently. By embedding synthetic data in the feature spaces of pretrained classification models, we facilitate effective distribution matching that leverages prior knowledge inherent in these models. Our method not only maintains the computational advantages of distribution matching-based techniques but also achieves new state-of-the-art performance across a range of high-resolution datasets. Extensive testing demonstrates the effectiveness and adaptability of our method, underscoring the untapped potential of Wasserstein metrics in dataset distillation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Task-Specific Generative Dataset Distillation with Difficulty-Guided Sampling
Dataset Distillation via Vision-Language Category Prototype
FADRM: Fast and Accurate Data Residual Matching for Dataset Distillation
CaO$_2$: Rectifying Inconsistencies in Diffusion-Based Dataset Distillation
Dataset distillation for memorized data: Soft labels can leak held-out teacher knowledge
Flowing Datasets with Wasserstein over Wasserstein Gradient Flows
토론
이 논문과 연결된 포럼 글이 아직 없습니다.