Pith. sign in

REVIEW 10 cited by

Selection via Proxy: Efficient Data Selection for Deep Learning

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 1906.11829 v4 pith:ZHVCFC6G submitted 2019-06-26 cs.LG stat.ML

Selection via Proxy: Efficient Data Selection for Deep Learning

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

Data selection methods, such as active learning and core-set selection, are useful tools for machine learning on large datasets. However, they can be prohibitively expensive to apply in deep learning because they depend on feature representations that need to be learned. In this work, we show that we can greatly improve the computational efficiency by using a small proxy model to perform data selection (e.g., selecting data points to label for active learning). By removing hidden layers from the target model, using smaller architectures, and training for fewer epochs, we create proxies that are an order of magnitude faster to train. Although these small proxy models have higher error rates, we find that they empirically provide useful signals for data selection. We evaluate this "selection via proxy" (SVP) approach on several data selection tasks across five datasets: CIFAR10, CIFAR100, ImageNet, Amazon Review Polarity, and Amazon Review Full. For active learning, applying SVP can give an order of magnitude improvement in data selection runtime (i.e., the time it takes to repeatedly train and select points) without significantly increasing the final error (often within 0.1%). For core-set selection on CIFAR10, proxies that are over 10x faster to train than their larger, more accurate targets can remove up to 50% of the data without harming the final accuracy of the target, leading to a 1.6x end-to-end training time improvement.

discussion (0)

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

Forward citations

Cited by 10 Pith papers

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

  1. Multimodal Distribution Matching for Vision-Language Dataset Distillation

    cs.CV 2026-05 unverdicted novelty 6.0

    MDM distills vision-language datasets via joint embedding clustering, weight-space model interpolation, and geometry-aware distribution matching on the unit hypersphere.

  2. 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.

  3. Beyond Loss Values: Robust Dynamic Pruning via Loss Trajectory Alignment

    cs.CV 2026-04 unverdicted novelty 6.0

    AlignPrune uses a Dynamic Alignment Score from loss trajectories to identify noisy samples more accurately than per-sample loss, improving pruning accuracy by up to 6.3% on noisy benchmarks.

  4. Rethinking Dataset Distillation for Classification: Do Distilled Sets Outperform Coresets?

    cs.LG 2026-06 unverdicted novelty 5.0

    Large-scale standardized benchmarks show state-of-the-art dataset distillation methods do not outperform coreset selection on ImageNet-scale data and have substantially higher construction costs.

  5. Exploring and Exploiting Stability in Latent Flow Matching

    cs.LG 2026-05 unverdicted novelty 5.0

    Latent Flow Matching models exhibit inherent stability to data reduction and model shrinkage due to the flow matching objective, enabling reduced-dataset training and two-stage inference with over 2x speedup while pre...

  6. Exploring and Exploiting Stability in Latent Flow Matching

    cs.LG 2026-05 unverdicted novelty 5.0

    LFM models exhibit stability to data reduction and capacity shrinkage that is tied to the flow matching objective, enabling reduced-data training and coarse-to-fine inference with over 2x speedup.

  7. \emph{FoQuS}: A Forgetting-Quality Coreset Selection Framework for Automatic Modulation Recognition

    cs.LG 2025-09 reject novelty 5.0

    FoQuS uses three training-dynamics scores to select a 1% to 30% coreset for AMR and claims higher accuracy than ten existing coreset methods.

  8. Data-Efficient Stream-Based Active Distillation for Scalable Edge Model Deployment

    cs.CV 2025-09 conditional novelty 4.0

    Adding Farthest First diversity filtering after high-confidence stream sampling reduces teacher transmissions by 8x without losing student detection accuracy on WALT.

  9. Learning to Reason at the Frontier of Learnability

    cs.LG 2025-02 unverdicted novelty 4.0

    A curriculum sampling questions with high variance in success rate improves reinforcement learning performance for LLM reasoning tasks.

  10. Step-Video-T2V Technical Report: The Practice, Challenges, and Future of Video Foundation Model

    cs.CV 2025-02 unverdicted novelty 4.0

    Step-Video-T2V describes a 30B-parameter text-to-video model with custom Video-VAE, 3D DiT, flow matching, and Video-DPO that claims state-of-the-art results on a new internal benchmark.