Pith. sign in

REVIEW 7 cited by

D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruning

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 2310.07931 v1 pith:QO6XCM2M submitted 2023-10-11 cs.LG cs.AIcs.CLcs.CV

D2 Pruning: Message Passing for Balancing Diversity and Difficulty in Data Pruning

classification cs.LG cs.AIcs.CLcs.CV
keywords datapruningcoresetdatasetdifficultyselectiondiversitymodels
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Analytical theories suggest that higher-quality data can lead to lower test errors in models trained on a fixed data budget. Moreover, a model can be trained on a lower compute budget without compromising performance if a dataset can be stripped of its redundancies. Coreset selection (or data pruning) seeks to select a subset of the training data so as to maximize the performance of models trained on this subset, also referred to as coreset. There are two dominant approaches: (1) geometry-based data selection for maximizing data diversity in the coreset, and (2) functions that assign difficulty scores to samples based on training dynamics. Optimizing for data diversity leads to a coreset that is biased towards easier samples, whereas, selection by difficulty ranking omits easy samples that are necessary for the training of deep learning models. This demonstrates that data diversity and importance scores are two complementary factors that need to be jointly considered during coreset selection. We represent a dataset as an undirected graph and propose a novel pruning algorithm, D2 Pruning, that uses forward and reverse message passing over this dataset graph for coreset selection. D2 Pruning updates the difficulty scores of each example by incorporating the difficulty of its neighboring examples in the dataset graph. Then, these updated difficulty scores direct a graph-based sampling method to select a coreset that encapsulates both diverse and difficult regions of the dataset space. We evaluate supervised and self-supervised versions of our method on various vision and language datasets. Results show that D2 Pruning improves coreset selection over previous state-of-the-art methods for up to 70% pruning rates. Additionally, we find that using D2 Pruning for filtering large multimodal datasets leads to increased diversity in the dataset and improved generalization of pretrained models.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

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

  1. Beyond What to Select: A Plug-and-play Oscillatory Data-Volume Scheduling for Efficient Model Training

    cs.LG 2026-05 unverdicted novelty 7.0

    PODS is a plug-and-play oscillatory data-volume scheduler that alternates low-ratio regularization phases with high-ratio recovery phases to improve data selection efficiency across training tasks.

  2. Coresets Before Score Sets: Evaluation-Unsupervised Prompt Subset Selection for LLM Benchmarks

    cs.AI 2026-07 accept novelty 6.0

    Facility location on semantic prompt embeddings selects evaluation-unsupervised prompt coresets that preserve LLM scores and rankings better than twelve baselines across 35 benchmarks.

  3. Mitigating Spurious Correlations with Memorization-Guided Dataset De-Biasing

    cs.LG 2026-06 unverdicted novelty 6.0

    Proposes memorization-guided two-stage scoring to select debiased training subsets, enabling ERM models to achieve better performance than SOTA debiasing techniques using only 10% of data.

  4. MAGIC: Multimodal Alignment & Grounding-aware Instruction Coreset for Vision-Language Models

    cs.CV 2026-05 unverdicted novelty 6.0

    MAGIC selects coreset subsets for VLM instruction tuning via Multimodal Gain, Bridging Relevance, and Skill-Neuron Signatures, reporting 100.3% and 101.6% relative performance to full finetuning at 20% budget on LLaVA...

  5. Seeing Realism from Simulation: Efficient Video Transfer for Vision-Language-Action Data Augmentation

    cs.CV 2026-05 unverdicted novelty 6.0

    A video transfer pipeline augments simulated VLA data into realistic videos while preserving actions, yielding consistent performance gains on robot benchmarks such as 8% on Robotwin 2.0.

  6. Select Smarter, Not More: Prompt-Aware Evaluation Scheduling with Submodular Guarantees

    cs.AI 2026-04 unverdicted novelty 6.0

    POES frames prompt evaluation as online adaptive testing and uses a provably submodular objective to pick informative examples, delivering 6.2% higher average accuracy and 35-60% token savings versus naive full-set scoring.

  7. DOSE: Data Selection for Multi-Modal LLMs via Off-the-Shelf Models

    cs.CV 2026-04 unverdicted novelty 5.0

    Off-the-shelf models assess quality and alignment to select diverse multimodal training data, letting models trained on the filtered subset match or exceed full-dataset results on standard benchmarks.