mlsanityData to 7 Oct 2026

Stable Coresets via Posterior Sampling: Aligning Induced and Full Loss Landscapes

arXiv 2511.17399 ↗First posted 21 Nov 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

As deep learning models continue to scale, the growing computational demands have amplified the need for effective coreset selection techniques. Coreset selection aims to accelerate training by identifying small, representative subsets of data that approximate the performance of the full dataset. Among various approaches, gradient based methods stand out due to their strong theoretical underpinnings and practical benefits, particularly under limited data budgets. However, these methods face challenges such as naive stochastic gradient descent (SGD) acting as a surprisingly strong baseline and the breakdown of representativeness due to loss curvature mismatches over time. In this work, we propose a novel framework that addresses these limitations. First, we establish a connection between posterior sampling and loss landscapes, enabling robust coreset selection even in high data corruption scenarios. Second, we introduce a smoothed loss function based on posterior sampling onto the model weights, enhancing stability and generalization while maintaining computational efficiency. We also present a novel convergence analysis for our sampling-based coreset selection method. Finally, through extensive experiments, we demonstrate how our approach achieves faster training and enhanced generalization across diverse datasets than the current state of the art.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 52 of its 74 references that are in the map. First posted on arXiv 21 Nov 2025.

Builds on

52 of 74 references.

References · 52

  1. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  2. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  3. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  4. 2015A large annotated corpus for learning natural language inferencecited by 1,837
  5. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  6. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  7. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
  8. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
  9. 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
  10. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
  11. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
  12. 2019Deep Ensembles: A Loss Landscape Perspectivecited by 438
38 more
  1. 2018How Does Batch Normalization Help Optimization?cited by 355
  2. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
  3. 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 337
  4. 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 291
  5. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 289
  6. 2017How to Escape Saddle Points Efficientlycited by 284
  7. 2021GRAD-MATCH: Gradient Matching based Data Subset Selection for Efficient Deep Model Trainingcited by 269
  8. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
  9. 2019Understanding and Improving Layer Normalizationcited by 213
  10. 2017EMNIST: an extension of MNIST to handwritten letterscited by 212
  11. 2013Revisiting Natural Gradient for Deep Networkscited by 157
  12. 2020Training BatchNorm and Only BatchNorm: On the Expressive Power of Random Features in CNNscited by 103
  13. 2020Neural Mechanics: Symmetry and Broken Conservation Laws in Deep Learning Dynamicscited by 93
  14. 2017Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descentcited by 66
  15. 2022Adaptive Second Order Coresets for Data-efficient Machine Learningcited by 60
  16. 2018Stability and Convergence Trade-off of Iterative Optimization Algorithmscited by 53
  17. 2016Restricted Strong Convexity Implies Weak Submodularitycited by 51
  18. 2017"Convex Until Proven Guilty": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functionscited by 46
  19. 2022Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscapecited by 39
  20. 2017Neon2: Finding Local Minima via First-Order Oraclescited by 36
  21. 2023Loss-Curvature Matching for Dataset Selection and Condensationcited by 32
  22. 2021On the Generalization of Models Trained with SGD: Information-Theoretic Bounds and Implicationscited by 31
  23. 2022A Closer Look at Learned Optimization: Stability, Robustness, and Inductive Biasescited by 30
  24. 2019Instance Enhancement Batch Normalization: an Adaptive Regulator of Batch Noisecited by 28
  25. 2020RelatIF: Identifying Explanatory Training Examples via Relative Influencecited by 28
  26. 2023Normalization Layers Are All That Sharpness-Aware Minimization Needscited by 27
  27. 2023Repeated Random Sampling for Minimizing the Time-to-Accuracy of Learningcited by 26
  28. 2022Stability and Generalization of Stochastic Optimization with Nonconvex and Nonsmooth Problemscited by 25
  29. 2017Scalable Greedy Feature Selection via Weak Submodularitycited by 19
  30. 2020An accelerated first-order method for non-convex optimization on manifoldscited by 15
  31. 2021SVP-CF: Selection via Proxy for Collaborative Filtering Datacited by 14
  32. 2023Provable Data Subset Selection For Efficient Neural Network Trainingcited by 14
  33. 2024Revisiting Random Weight Perturbation for Efficiently Improving Generalizationcited by 13
  34. 2018Approximate Fisher Information Matrix to Characterise the Training of Deep Neural Networkscited by 12
  35. 2019Towards Understanding the Importance of Noise in Training Neural Networkscited by 10
  36. 2013Training Neural Networks with Stochastic Hessian-Free Optimizationcited by 9
  37. 2022Uniform Stability for First-Order Empirical Risk Minimizationcited by 8
  38. 2022On the Algorithmic Stability and Generalization of Adaptive Optimization Methodscited by 5

50 most cited of 52 All 52 (JSON)

Built on by

Not cited yet.