Dataset Condensation Atlas

Method · Distribution and feature matching

GeoDM

GeoDM: Geometry-aware Distribution Matching for Dataset Distillation

Xuhui Li, Zhengquan Luo, Zihui Cui, Zhiqiang Xu

ICML 2026 · first public 2025-12-09 · arXiv 2512.08317

paper ↗catalogued✓ abstract read

In one paragraph

Extends distribution matching to a product of Euclidean, hyperbolic and spherical manifolds with learnable curvature per geometry, so the synthetic-data manifold can capture the flat, hierarchical and cyclical structure of the real data rather than only Euclidean statistics, adding an optimal-transport loss; reports a smaller generalization-error bound than Euclidean distribution matching and gains over state-of-the-art distillation methods on standard benchmarks.

Where it sits

Builds on

Abstract (verbatim from arXiv)

Dataset distillation aims to synthesize a compact subset of the original data, enabling models trained on it to achieve performance comparable to those trained on the original large dataset. Existing distribution-matching methods are confined to Euclidean spaces, making them only capture linear structures and overlook the intrinsic geometry of real data, e.g., curvature. However, high-dimensional data often lie on low-dimensional manifolds, suggesting that dataset distillation should have the distilled data manifold aligned with the original data manifold. In this work, we propose a geometry-aware distribution-matching framework, called \textbf{GeoDM}, which operates in the Cartesian product of Euclidean, hyperbolic, and spherical manifolds, with flat, hierarchical, and cyclical structures all captured by a unified representation. To adapt to the underlying data geometry, we introduce learnable curvature and weight parameters for three kinds of geometries. At the same time, we design an optimal transport loss to enhance the distribution fidelity. Our theoretical analysis shows that the geometry-aware distribution matching in a product space yields a smaller generalization error bound than the Euclidean counterparts. Extensive experiments conducted on standard benchmarks demonstrate that our algorithm outperforms state-of-the-art data distillation methods and remains effective across various distribution-matching strategies for the single geometries.

BibTeX (generated; prefer the venue's official entry)
@article{li2025geodm,
  title   = {GeoDM: Geometry-aware Distribution Matching for Dataset Distillation},
  author  = {Xuhui Li and Zhengquan Luo and Zihui Cui and Zhiqiang Xu},
  journal = {ICML 2026},
  year    = {2025}
}

Nearby in Distribution and feature matching

2026-06

RAHA — Rank-Aware Hyperbolic Alignment for Vision-Language Dataset Distillation

Jongoh Jeong, Sun-Kyung Lee, Kuk-Jin Yoon · ECCV 2026notableVision–languagepaper ↗code ↗

2026-05

MDM — Multimodal Distribution Matching for Vision-Language Dataset Distillation

Jongoh Jeong, Hoyong Kwon, Minseok Kim et al. · CVPR 2026notableVision–languagepaper ↗code ↗

2026-03

Sneakdoor — SNEAKDOOR: Stealthy Backdoor Attacks against Distribution Matching-based Dataset Condensation

He Yang, Dongyi Lv, Song Ma et al. · NeurIPS 2025notablepaper ↗code ↗

2026-03

Harmonic Dataset Distillation for Time Series Forecasting

Seungha Hong, Sanghwan Jang, Wonbin Kweon et al. · AAAI 2026notableTime seriespaper ↗

2025-11

Algorithmic Guarantees for Distilling Supervised and Offline RL Datasets

Aaryan Gupta, Rishi Saket, Aravindan Raghuveer · ICLR 2026notableOther datapaper ↗