Dataset Condensation Atlas

Method · Synthetic-set parameterization

HMN

Leveraging Hierarchical Feature Sharing for Efficient Dataset Condensation

Haizhong Zheng, Jiachen Sun, Shutong Wu, Bhavya Kailkhura, Zhuoqing Mao, Chaowei Xiao, Atul Prakash

ECCV 2024 · first public 2023-10-11 · arXiv 2310.07506

paper ↗catalogued✓ abstract read

In one paragraph

Stores condensed data in a three-tier Hierarchical Memory Network representing dataset-, class- and instance-level features, matching the hierarchical way real images share features within a classification system; the hierarchy also keeps images independent enough to allow instance-level pruning of redundant information, and it outperforms prior parameterization baselines on five public datasets.

Where it sits

Design choices

What is storedfactorized-bases
Abstract (verbatim from arXiv)

Given a real-world dataset, data condensation (DC) aims to synthesize a small synthetic dataset that captures the knowledge of a natural dataset while being usable for training models with comparable accuracy. Recent works propose to enhance DC with data parameterization, which condenses data into very compact parameterized data containers instead of images. The intuition behind data parameterization is to encode shared features of images to avoid additional storage costs. In this paper, we recognize that images share common features in a hierarchical way due to the inherent hierarchical structure of the classification system, which is overlooked by current data parameterization methods. To better align DC with this hierarchical nature and encourage more efficient information sharing inside data containers, we propose a novel data parameterization architecture, Hierarchical Memory Network (HMN). HMN stores condensed data in a three-tier structure, representing the dataset-level, class-level, and instance-level features. Another helpful property of the hierarchical architecture is that HMN naturally ensures good independence among images despite achieving information sharing. This enables instance-level pruning for HMN to reduce redundant information, thereby further minimizing redundancy and enhancing performance. We evaluate HMN on five public datasets and show that our proposed method outperforms all baselines.

BibTeX (generated; prefer the venue's official entry)
@article{zheng2023leveraging,
  title   = {Leveraging Hierarchical Feature Sharing for Efficient Dataset Condensation},
  author  = {Haizhong Zheng and Jiachen Sun and Shutong Wu and Bhavya Kailkhura and Zhuoqing Mao and Chaowei Xiao and Atul Prakash},
  journal = {ECCV 2024},
  year    = {2023}
}

Nearby in Synthetic-set parameterization

2026-03

Post Training Quantization for Efficient Dataset Condensation

Linh-Tam Tran, Sung-Ho Bae · AAAI 2026notablepaper ↗

2026-01

3DDP — Parameterization-Based Dataset Distillation of 3D Point Clouds through Learnable Shape Morphing

Dongwook Kim, Jae-Young Yim · ICLR 2026notableOther datapaper ↗code ↗

2025-07

Rate-utility DD — Dataset Distillation as Data Compression: A Rate-Utility Perspective

Youneng Bao, Yiping Liu, Zhuo Chen et al. · ICCV 2025notablepaper ↗code ↗

2025-03

DDiF — Distilling Dataset into Neural Field

Donghyeok Shin, HeeSun Bae, Gyuwon Sim et al. · ICLR 2025corepaper ↗code ↗

2024-06

H-GLaD — Hierarchical Features Matter: A Deep Exploration of Progressive Parameterization Method for Dataset Distillation

Xinhao Zhong, Hao Fang, Bin Chen et al. · CVPR 2025notablepaper ↗code ↗