A graph-based unified dataset pruning framework that formulates pruning as MWCP, derives a greedy algorithm with formal approximation guarantees, and demonstrates substantial training acceleration on ImageNet.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Selecting Samples on Graphs: A Unified Dataset Pruning Framework for Lossless Training Acceleration
A graph-based unified dataset pruning framework that formulates pruning as MWCP, derives a greedy algorithm with formal approximation guarantees, and demonstrates substantial training acceleration on ImageNet.