Fixed Anchors Are Not Enough: Dynamic Retrieval and Persistent Homology for Dataset Distillation
Not on the map. Why?
Abstract (arXiv)
Decoupled dataset distillation (DD) compresses large corpora into a few synthetic images by matching a frozen teacher's statistics. However, current residual-matching pipelines rely on static real patches, creating a fit-complexity gap and a pull-to-anchor effect that reduce intra-class diversity and hurt generalization. To address these issues, we introduce RETA -- a Retrieval and Topology Alignment framework for decoupled DD. First, Dynamic Retrieval Connection (DRC) selects a real patch from a prebuilt pool by minimizing a fit-complexity score in teacher feature space; the chosen patch is injected via a residual connection to tighten feature fit while controlling injected complexity. Second, Persistent Topology Alignment (PTA) regularizes synthesis with persistent homology: we build a mutual k-NN feature graph, compute persistence images of components and loops, and penalize topology discrepancies between real and synthetic sets, mitigating pull-to-anchor effect. Across CIFAR-100, Tiny-ImageNet, ImageNet-1K, and multiple ImageNet subsets, RETA consistently outperforms various baselines under comparable time and memory, especially reaching 64.3% top-1 accuracy on ImageNet-1K with ResNet-18 at 50 images per class, +3.1% over the best prior.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Feb 2026.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 10.
10 papers.
- 2026CNMBI: Determining the Number of Clusters Using Center Pairwise Matching and Boundary Filteringcited by 1
- 2026Deep Image Clustering Based on Curriculum Learning and Density Informationcited by 1
- 2026All for 1-Bit: Towards Genuine 1-Bit Post-Training Quantization for LLMscited by 1
- 2026Omnimodal Dataset Distillation via High-order Proxy Alignmentcited by 0
- 2026Can We Build Scene Graphs, Not Classify Them? FlowSG: Progressive Image-Conditioned Scene Graph Generation with Flow Matchingcited by 0
- 2026ReLIC-SGG: Relation Lattice Completion for Open-Vocabulary Scene Graph Generationcited by 0
- 2026ScriptHOI: Learning Scripted State Transitions for Open-Vocabulary Human-Object Interaction Detectioncited by 0
- 2026TileQ: Efficient Low-Rank Quantization of Mixture-of-Experts with 2D Tilingcited by 0
- 2026Show, Don't Ask: Generative Visual Disambiguation for Composed Image Retrieval with Turn-Valid Coveragecited by 0
- 2026Skeletal Prototypes on Iterative Nerve Expansionscited by 0
- 2026Skeletal Prototypes on Iterative Nerve Expansions14 Sep 2026
- 2026All for 1-Bit: Towards Genuine 1-Bit Post-Training Quantization for LLMs5 Sep 2026
- 2026Show, Don't Ask: Generative Visual Disambiguation for Composed Image Retrieval with Turn-Valid Coverage17 Jun 2026
- 2026TileQ: Efficient Low-Rank Quantization of Mixture-of-Experts with 2D Tiling10 May 2026
- 2026ScriptHOI: Learning Scripted State Transitions for Open-Vocabulary Human-Object Interaction Detection6 May 2026
- 2026ReLIC-SGG: Relation Lattice Completion for Open-Vocabulary Scene Graph Generation24 Apr 2026
- 2026Can We Build Scene Graphs, Not Classify Them? FlowSG: Progressive Image-Conditioned Scene Graph Generation with Flow Matching18 Apr 2026
- 2026Omnimodal Dataset Distillation via High-order Proxy Alignment12 Apr 2026
- 2026Deep Image Clustering Based on Curriculum Learning and Density Information31 Mar 2026
- 2026CNMBI: Determining the Number of Clusters Using Center Pairwise Matching and Boundary Filtering23 Mar 2026