mlsanityData to 7 Oct 2026

Optimal Sample Selection Through Uncertainty Estimation and Its Application in Deep Learning

arXiv 2309.02476 ↗First posted 5 Sep 2023stat.ML cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Modern deep learning heavily relies on large labeled datasets, which often comse with high costs in terms of both manual labeling and computational resources. To mitigate these challenges, researchers have explored the use of informative subset selection techniques, including coreset selection and active learning. Specifically, coreset selection involves sampling data with both input (bx) and output (by), active learning focuses solely on the input data (bx). In this study, we present a theoretically optimal solution for addressing both coreset selection and active learning within the context of linear softmax regression. Our proposed method, COPS (unCertainty based OPtimal Sub-sampling), is designed to minimize the expected loss of a model trained on subsampled data. Unlike existing approaches that rely on explicit calculations of the inverse covariance matrix, which are not easily applicable to deep learning scenarios, COPS leverages the model's logits to estimate the sampling ratio. This sampling ratio is closely associated with model uncertainty and can be effectively applied to deep learning tasks. Furthermore, we address the challenge of model sensitivity to misspecification by incorporating a down-weighting approach for low-density samples, drawing inspiration from previous works. To assess the effectiveness of our proposed method, we conducted extensive empirical experiments using deep neural networks on benchmark datasets. The results consistently showcase the superior performance of COPS compared to baseline methods, reaffirming its efficacy.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 30 of its 61 references that are in the map. First posted on arXiv 5 Sep 2023.

Builds on

30 of 61 references.

References · 30

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Densely Connected Convolutional Networkscited by 6,691
  3. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  4. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  5. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  6. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  7. 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,303
  8. 2019Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Boundscited by 602
  9. 2020A Survey of Deep Active Learningcited by 547
  10. 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 514
  11. 2019Learning Loss for Active Learningcited by 335
  12. 2019Variational Adversarial Active Learningcited by 284
18 more
  1. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  2. 2021Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotationscited by 253
  3. 2020Coresets via Bilevel Optimization for Continual Learning and Streamingcited by 191
  4. 2018Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulatorcited by 86
  5. 2020Task-Aware Variational Adversarial Active Learningcited by 84
  6. 2016Coresets for Scalable Bayesian Logistic Regressioncited by 79
  7. 2020Stochastic Linear Bandits Robust to Adversarial Attackscited by 65
  8. 2022Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptionscited by 51
  9. 2023Model Agnostic Sample Reweighting for Out-of-Distribution Learningcited by 43
  10. 2013A Statistical Perspective on Algorithmic Leveragingcited by 38
  11. 2017Training Gaussian Mixture Models at Scale via Coresetscited by 38
  12. 2022Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processescited by 33
  13. 2017Optimal Subsampling for Large Sample Logistic Regressioncited by 28
  14. 2023Probabilistic Bilevel Coreset Selectioncited by 26
  15. 2020Optimal subsampling for quantile regression in big datacited by 8
  16. 2018More Efficient Estimation for Logistic Regression with Optimal Subsamplecited by 7
  17. 2016Local Uncertainty Sampling for Large-Scale Multi-Class Logistic Regressioncited by 5
  18. 2023Leveraging Importance Weights in Subset Selectioncited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 2; 2026: 1.

4 papers.