GeoDM: Geometry-aware Distribution Matching for Dataset Distillation
Not on the map. Why?
Abstract (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 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.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 54 references that are in the map. First posted on arXiv 9 Dec 2025.
Builds on
21 of 54 references.
References · 21
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 674
- 2020Dataset Condensation with Gradient Matchingcited by 510
- 2022Dataset Distillation by Matching Training Trajectoriescited by 437
- 2018Hyperbolic Neural Networkscited by 393
- 2021Dataset Condensation with Distribution Matchingcited by 362
- 2021Dataset Condensation with Differentiable Siamese Augmentationcited by 290
- 2018Hyperspherical Variational Auto-Encoderscited by 188
- 2022Minimizing the Accumulated Trajectory Error to Improve Dataset Distillationcited by 142
- 2023Improved Distribution Matching for Dataset Condensationcited by 124
- 2019Continuous Hierarchical Representations with Poincar'e Variational Auto-Encoderscited by 111
- 2022Dataset Condensation with Contrastive Signalscited by 105
9 more
- 2023DREAM: Efficient Dataset Distillation by Representative Matchingcited by 93
- 2023Generalized Large-Scale Data Condensation via Various Backbone and Statistical Matchingcited by 69
- 2023Manifold learning: what, how, and whycited by 66
- 2023M3D: Dataset Condensation by Minimizing Maximum Mean Discrepancycited by 49
- 2025Dataset Distillation with Neural Characteristic Function: A Minmax Perspectivecited by 45
- 2023Dataset Distillation via the Wasserstein Metriccited by 31
- 2024Exploiting Inter-sample and Inter-feature Relations in Dataset Distillationcited by 31
- 2024Dataset Distillation by Automatic Training Trajectoriescited by 26
- 2023Riemannian Residual Neural Networkscited by 21
Built on by
Citing papers per year: 2026: 3.
3 papers.