Pith. sign in

REVIEW 3 cited by

Dataset Pruning: Reducing Training Data by Examining Generalization Influence

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.09329 v2 pith:35RUCORF submitted 2022-05-19 cs.LG

classification cs.LG
keywords trainingdatageneralizationdatasetmodelpruningsampleconstruct
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The great success of deep learning heavily relies on increasingly larger training data, which comes at a price of huge computational and infrastructural costs. This poses crucial questions that, do all training data contribute to model's performance? How much does each individual training sample or a sub-training-set affect the model's generalization, and how to construct the smallest subset from the entire training data as a proxy training set without significantly sacrificing the model's performance? To answer these, we propose dataset pruning, an optimization-based sample selection method that can (1) examine the influence of removing a particular set of training samples on model's generalization ability with theoretical guarantee, and (2) construct the smallest subset of training data that yields strictly constrained generalization gap. The empirically observed generalization gap of dataset pruning is substantially consistent with our theoretical expectations. Furthermore, the proposed method prunes 40% training examples on the CIFAR-10 dataset, halves the convergence time with only 1.3% test accuracy decrease, which is superior to previous score-based sample selection methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. OPERA: Online Data Pruning for Efficient Retrieval Model Adaptation

    cs.IR 2026-03 conditional novelty 6.0 of 10

    Dynamic hierarchical data pruning improves NDCG@10 and Recall@20 for dense retrievers while reaching full performance in half the iterations.

  2. MEGG: Replay via Maximally Extreme GGscore in Incremental Learning for Neural Recommendation Models

    cs.IR 2025-09 conditional novelty 5.0 of 10

    A gradient-alignment influence score (GGscore) that selects the highest- and lowest-scoring old interactions for replay improves incremental neural recommendation slightly over random replay, mainly at large replay ratios.

  3. Influence Functions for Preference Dataset Pruning

    cs.LG 2025-07 conditional novelty 4.0 of 10

    Conjugate-gradient influence functions can mildly improve reward-model accuracy after pruning 10% of a preference dataset, but the gain is not statistically significant and gradient similarity better identifies helpfu...

Pith tools