Dataset Condensation Atlas

Method · Optimization and training recipes

MIM4DD

MIM4DD: Mutual Information Maximization for Dataset Distillation

Yuzhang Shang, Zhihang Yuan, Yan Yan

NeurIPS 2023 · first public 2023-12-27 · arXiv 2312.16627

paper ↗catalogued✓ abstract read

In one paragraph

Adds a mutual-information objective, estimated via an InfoNCE-style contrastive loss between same-label (positive) and different-label (negative) real/synthetic sample pairs, as a plug-in regularizer for existing gradient- and trajectory-matching distillation methods, on the argument that maximizing shared information is a more principled compression criterion than the heuristic indicators these methods already match.

Where it sits

Abstract (verbatim from arXiv)

Dataset distillation (DD) aims to synthesize a small dataset whose test performance is comparable to a full dataset using the same model. State-of-the-art (SoTA) methods optimize synthetic datasets primarily by matching heuristic indicators extracted from two networks: one from real data and one from synthetic data (see Fig.1, Left), such as gradients and training trajectories. DD is essentially a compression problem that emphasizes maximizing the preservation of information contained in the data. We argue that well-defined metrics which measure the amount of shared information between variables in information theory are necessary for success measurement but are never considered by previous works. Thus, we introduce mutual information (MI) as the metric to quantify the shared information between the synthetic and the real datasets, and devise MIM4DD numerically maximizing the MI via a newly designed optimizable objective within a contrastive learning framework to update the synthetic dataset. Specifically, we designate the samples in different datasets that share the same labels as positive pairs and vice versa negative pairs. Then we respectively pull and push those samples in positive and negative pairs into contrastive space via minimizing NCE loss. As a result, the targeted MI can be transformed into a lower bound represented by feature maps of samples, which is numerically feasible. Experiment results show that MIM4DD can be implemented as an add-on module to existing SoTA DD methods.

BibTeX (generated; prefer the venue's official entry)
@article{shang2023mutual,
  title   = {MIM4DD: Mutual Information Maximization for Dataset Distillation},
  author  = {Yuzhang Shang and Zhihang Yuan and Yan Yan},
  journal = {NeurIPS 2023},
  year    = {2023}
}

Nearby in Optimization and training recipes

2026-05

C^2R — Mind Your Margin and Boundary: Are Your Distilled Datasets Truly Robust?

Muquan Li, Yingyi Ma, Yihong Huang et al. · ICML 2026notablepaper ↗

2026-04

COBRA — Fair Dataset Distillation via Cross-Group Barycenter Alignment

Mohammad Hossein Moslemi, Nima Hosseini Dashtbayaz, Zhimin Mei et al. · ICML 2026notablepaper ↗code ↗

2026-03

PTM-ST — Multimodal Dataset Distillation via Phased Teacher Models

Shengbin Guo, Hang Zhao, Senqiao Yang et al. · ICLR 2026notableVision–languagepaper ↗code ↗

2026-03

FD2 — FD$^2$: A Dedicated Framework for Fine-Grained Dataset Distillation

Hongxu Ma, Guang Li, Shijie Wang et al. · ECCV 2026notablepaper ↗

2025-05

PRISM — PRISM: Video Dataset Condensation with Progressive Refinement and Insertion for Sparse Motion

Jaehyun Choi, Jiwan Hur, Gyojin Han et al. · CVPR 2026notableVideopaper ↗