mlsanityData to 7 Oct 2026

TopoPrune: Robust Data Pruning via Unified Latent Space Topology

arXiv 2602.02739 ↗First posted 2 Feb 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Geometric data pruning methods, while practical for leveraging pretrained models, are fundamentally unstable. Their reliance on extrinsic geometry renders them highly sensitive to latent space perturbations, causing performance to degrade during cross-architecture transfer or in the presence of feature noise. We introduce TopoPrune, a framework which resolves this challenge by leveraging topology to capture the stable, intrinsic structure of data. TopoPrune operates at two scales, (1) utilizing a topology-aware manifold approximation to establish a global low-dimensional embedding of the dataset. Subsequently, (2) it employs differentiable persistent homology to perform a local topological optimization on the manifold embeddings, ranking samples by their structural complexity. We demonstrate that our unified dual-scale topological approach ensures high accuracy and precision, particularly at significant dataset pruning rates (e.g., 90%). Furthermore, through the inherent stability properties of topology, TopoPrune is (a) exceptionally robust to noise perturbations of latent feature embeddings and (b) demonstrates superior transferability across diverse network architectures. This study demonstrates a promising avenue towards stable and principled topology-based frameworks for robust data-efficient learning.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 64 of its 93 references that are in the map. First posted on arXiv 2 Feb 2026.

Builds on

64 of 93 references.

References · 64

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  5. 2022LAION-5B: An open large-scale dataset for training next generation image-text modelscited by 4,131
  6. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  7. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
  8. 2021Swin Transformer V2: Scaling Up Capacity and Resolutioncited by 1,215
  9. 2021EfficientNetV2: Smaller Models and Faster Trainingcited by 1,127
  10. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
  11. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
  12. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
38 more
  1. 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 492
  2. 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 452
  3. 2020Dataset Cartography: Mapping and Diagnosing Datasets with Training Dynamicscited by 423
  4. 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 337
  5. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  6. 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 259
  7. 2014Understanding image representations by measuring their equivariance and equivalencecited by 240
  8. 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 233
  9. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
  10. 2021Revisiting Model Stitching to Compare Neural Representationscited by 203
  11. 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 191
  12. 2020Understanding How Dimension Reduction Tools Work: An Empirical Approach to Deciphering t-SNE, UMAP, TriMAP, and PaCMAP for Data Visualizationcited by 170
  13. 2022DeepCore: A Comprehensive Library for Coreset Selection in Deep Learningcited by 146
  14. 2015A roadmap for the computation of persistent homologycited by 126
  15. 2019Topological Autoencoderscited by 124
  16. 2022Coverage-centric Coreset Selection for High Pruning Ratescited by 115
  17. 2020Topology of deep neural networkscited by 111
  18. 2023A Holistic Approach to Unifying Automatic Concept Extraction and Concept Importance Estimationcited by 108
  19. 2021Intrinsic Dimension, Persistent Homology and Generalization in Neural Networkscited by 70
  20. 2023Data Pruning via Moving-one-Sample-outcited by 67
  21. 2021Representation Topology Divergence: A Method for Comparing Neural Network Representationscited by 66
  22. 2023Large-scale Dataset Pruning with Dynamic Uncertaintycited by 63
  23. 2022Adaptive Second Order Coresets for Data-efficient Machine Learningcited by 60
  24. 2021Detecting Corrupted Labels Without Training a Model to Predictcited by 57
  25. 2022Information-theoretic Online Memory Selection for Continual Learningcited by 42
  26. 2023Loss-Curvature Matching for Dataset Selection and Condensationcited by 32
  27. 2023Learning Topology-Preserving Data Representationscited by 30
  28. 2023Memorization Through the Lens of Curvature of Loss Function Around Samplescited by 24
  29. 2025Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertaintycited by 22
  30. 2022On the effectiveness of persistent homologycited by 20
  31. 2023You Only Condense Once: Two Rules for Pruning Condensed Datasetscited by 20
  32. 2024Beyond Euclid: An Illustrated Guide to Modern Machine Learning with Geometric, Topological, and Algebraic Structurescited by 20
  33. 2022An Introduction to Multiparameter Persistencecited by 15
  34. 2023Stable Vectorization of Multiparameter Persistent Homology using Signed Barcodes as Measurescited by 15
  35. 2024Understanding Visual Feature Reliance through the Lens of Complexitycited by 15
  36. 2020The Simplex Tree: an Efficient Data Structure for General Simplicial Complexescited by 14
  37. 2024ELFS: Label-Free Coreset Selection with Proxy Training Dynamicscited by 9
  38. 2023Fair Wasserstein Coresetscited by 8

50 most cited of 64 All 64 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.