REVIEW 3 cited by
Dataset Distillation via the Wasserstein Metric
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Dataset Distillation (DD) aims to generate a compact synthetic dataset that enables models to achieve performance comparable to training on the full large dataset, significantly reducing computational costs. Drawing from optimal transport theory, we introduce WMDD (Wasserstein Metric-based Dataset Distillation), a straightforward yet powerful method that employs the Wasserstein metric to enhance distribution matching. We compute the Wasserstein barycenter of features from a pretrained classifier to capture essential characteristics of the original data distribution. By optimizing synthetic data to align with this barycenter in feature space and leveraging per-class BatchNorm statistics to preserve intra-class variations, WMDD maintains the efficiency of distribution matching approaches while achieving state-of-the-art results across various high-resolution datasets. Our extensive experiments demonstrate WMDD's effectiveness and adaptability, highlighting its potential for advancing machine learning applications at scale.
Forward citations
Cited by 3 Pith papers
-
Improving Noise Efficiency in Privacy-preserving Dataset Distillation
Dosser improves differentially private dataset distillation by decoupling sampling from optimization and projecting signals into a learned subspace.
-
Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computation
A mini-batch Wasserstein gradient-flow algorithm computes scalable and label-aware Wasserstein barycenters, with empirical gains on domain adaptation.
-
A Discrepancy-Based Perspective on Dataset Condensation
Dataset condensation is reframed as minimizing distribution discrepancies, and existing methods are sorted into a taxonomy; no new algorithm or experiments are provided.
Discussion (0). Sign in to comment.