Decomposed Distribution Matching in Dataset Condensation
Sahar Rahimi Malakshan, Mohammad Saeed Ebrahimi Saadabadi, Ali, Dabouei, Nasser M. Nasrabadi

TL;DR
This paper improves dataset condensation by decomposing distribution matching into content and style, addressing style discrepancy and diversity limitations, leading to significant accuracy gains across multiple datasets.
Contribution
It introduces a method that matches style information and enhances intra-class diversity in dataset condensation, overcoming previous performance limitations.
Findings
Achieved up to 5.5% accuracy improvement on various datasets.
Effectively matches style information using statistical moments of feature maps.
Enhances intra-class diversity by maximizing Kullback-Leibler divergence.
Abstract
Dataset Condensation (DC) aims to reduce deep neural networks training efforts by synthesizing a small dataset such that it will be as effective as the original large dataset. Conventionally, DC relies on a costly bi-level optimization which prohibits its practicality. Recent research formulates DC as a distribution matching problem which circumvents the costly bi-level optimization. However, this efficiency sacrifices the DC performance. To investigate this performance degradation, we decomposed the dataset distribution into content and style. Our observations indicate two major shortcomings of: 1) style discrepancy between original and condensed data, and 2) limited intra-class diversity of condensed dataset. We present a simple yet effective method to match the style information between original and condensed data, employing statistical moments of feature maps as well-established…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTime Series Analysis and Forecasting
