mlsanityData to 14 Oct 2026

Spectral Gradient Surgery for Domain-Generalizable Dataset Distillation

arXiv 2605.18836 ↗First posted 13 May 2026cs.LG cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Dataset Distillation (DD) synthesizes a compact synthetic dataset that preserves the training utility of a full dataset. However, its standard formulation assumes that test data follow the same distribution as training data, an assumption that rarely holds in practice. A straightforward extension-applying post-hoc Domain Generalization (DG) techniques to distilled data-is ill-suited because existing DG methods rely on the natural diversity of real datasets, which compact synthetic sets inherently lack, while also incurring substantial augmentation overhead that conflicts with the efficiency objective of dataset distillation. To address this limitation, we introduce Domain Generalizable Dataset Distillation (DGDD), a new problem setting that explicitly targets out-of-distribution (OOD) generalization of distilled datasets. We study this problem through a widely adopted DD baseline of Distribution Matching (DM). We attribute the OOD vulnerability of DM to the entanglement of class-discriminative and domain-specific information within the compressed synthetic set, and propose Spectral Gradient Surgery (SGS) to disentangle the two. The key insight of SGS is that cross-domain agreement among domain-wise gradients in the spectral domain reveals which gradient components are shared across source domains-and are therefore class-discriminative-and which are domain-specific. Based on this observation, SGS augments the standard DM update with two complementary gradients: one that reinforces cross-domain shared components and another that explicitly promotes diversity within the distilled dataset. Extensive experiments on diverse-scale benchmarks demonstrate that SGS substantially improves OOD generalization while remaining plug-and-play compatible with existing DM methods.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 27 references that are in the map. First posted on arXiv 13 May 2026.

Builds on

22 of 27 references.

References · 22

  1. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  2. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  3. 2019Invariant Risk Minimizationcited by 1,854
  4. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  5. 2021Domain Generalization with MixStylecited by 566
  6. 2020Dataset Condensation with Gradient Matchingcited by 516
  7. 2022Dataset Distillation by Matching Training Trajectoriescited by 442
  8. 2021Dataset Condensation with Distribution Matchingcited by 365
  9. 2020Learning to Generate Novel Domains for Domain Generalizationcited by 296
  10. 2021Dataset Condensation with Differentiable Siamese Augmentationcited by 291
  11. 2021A Fourier-based Framework for Domain Generalizationcited by 290
  12. 2017CORe50: a New Dataset and Benchmark for Continuous Object Recognitioncited by 289
10 more
  1. 2021Gradient Matching for Domain Generalizationcited by 258
  2. 2021Fishr: Invariant Gradient Variances for Out-of-Distribution Generalizationcited by 186
  3. 2022Scaling Up Dataset Distillation to ImageNet-1K with Constant Memorycited by 181
  4. 2023DataDAM: Efficient Dataset Distillation with Attention Matchingcited by 84
  5. 2023M3D: Dataset Condensation by Minimizing Maximum Mean Discrepancycited by 49
  6. 2025Dataset Distillation with Neural Characteristic Function: A Minmax Perspectivecited by 45
  7. 2023AdvST: Revisiting Data Augmentations for Single Domain Generalizationcited by 16
  8. 2025Hyperbolic Dataset Distillationcited by 15
  9. 2024Towards Combating Frequency Simplicity-biased Learning for Domain Generalizationcited by 6
  10. 2025DAM: Domain-Aware Module for Multi-Domain Dataset Condensationcited by 1

Built on by

Not cited yet.