Research map / Architectures and efficiency / Pruning and efficient tuning
OrderDP: A Theoretically Guaranteed Lossless Dynamic Data Pruning Framework
Chenhan Jin, Shengze Xu, Qingsong Wang, Fan JIA, Dingshuo Chen, Tieyong Zeng
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use OrderDP instead of InfoBatch at 70% prune | ResNet-18 · CIFAR-10 | accuracy: 94.5 -> 95.0 | Improved |
| use OrderDP instead of InfoBatch at 70% prune | ResNet-18 · CIFAR-100 | accuracy: 75.9 -> 76.7 | Improved |
| use OrderDP instead of InfoBatch at 70% prune | ResNet-50 · CIFAR-100 | accuracy: 76.4 -> 77.9 | Improved |
| use OrderDP instead of InfoBatch at 40% prune | ResNet-50 · ImageNet-1K | accuracy: 75.6 -> 76.4 | Improved |
| use OrderDP instead of InfoBatch at 60% prune | ResNet-50 · ImageNet-1K | accuracy: 74.9 -> 76.0 | Improved |
| use OrderDP instead of InfoBatch at 30% prune | ResNet-50 · ImageNet-1K | accuracy: 76.4 -> 76.4 | No clear effect |
| use OrderDP instead of InfoBatch for training cost saving | ResNet-50 · CIFAR-10 | saved cost (%): 37.1 -> 42.6 | Improved |
| use OrderDP instead of InfoBatch for training cost saving | ResNet-50 · ImageNet-1K | saved cost (%): 34.3 -> 39.8 | Improved |
| use OrderDP instead of InfoBatch for training cost saving | ResNet-18 · CIFAR-100 | saved cost (%): 30.8 -> 35.8 | Improved |
| use OrderDP across optimizers (AdamW) | ResNet-50 · CIFAR-10 | accuracy: 94.3 -> 94.4 | No clear effect |
| use OrderDP under Timm training recipe with 29.8% prune | R-50 Timm · ImageNet-1K | accuracy: 78.4 -> 78.3 | No clear effect |
| use OrderDP on Swin-T with 22.1% prune | Swin-T · ImageNet-1K | accuracy: 81.5 -> 81.4 | No clear effect |
Earlier methods this paper compares with
Named baselines from earlier accepted papers in this paper's results tables: better than 1 of 1 on most shared results.
- InfoBatch — InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning (ICLR 2024) · better on 12 of 15 shared results
Matched by method name in results tables read by AI. Authors' own tables tend to favour the newer method, and a comparison can be missed when a method is renamed.
Closest papers by meaning
- Exploring Learning Complexity for Efficient Downstream Dataset Pruning (ICLR 2025 · similarity 0.89)
- InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning (ICLR 2024 · similarity 0.89)
- Lightweight Dataset Pruning without Full Training via Example Difficulty and Prediction Uncertainty (ICML 2025 · similarity 0.89)
- Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruning (CVPR 2024 · similarity 0.88)
- DRoP: Distributionally Robust Data Pruning (ICLR 2025 · similarity 0.87)
- Distilling the Knowledge in Data Pruning (ICML 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
