mlsanityData to 7 Oct 2026

SAGE: Streaming Agreement-Driven Gradient Sketches for Representative Subset Selection

arXiv 2510.02470 ↗First posted 2 Oct 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Training modern neural networks on large datasets is computationally and energy intensive. We present SAGE, a streaming data-subset selection method that maintains a compact Frequent Directions (FD) sketch of gradient geometry in O(ℓ D) memory and prioritizes examples whose sketched gradients align with a consensus direction. The approach eliminates N × N pairwise similarities and explicit N × ℓ gradient stores, yielding a simple two-pass, GPU-friendly pipeline. Leveraging FD's deterministic approximation guarantees, we analyze how agreement scoring preserves gradient energy within the principal sketched subspace. Across multiple benchmarks, SAGE trains with small kept-rate budgets while retaining competitive accuracy relative to full-data training and recent subset-selection baselines, and reduces end-to-end compute and peak memory. Overall, SAGE offers a practical, constant-memory alternative that complements pruning and model compression for efficient training.

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

Builds on

18 of 26 references.

References · 18

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2020Scaling Laws for Neural Language Modelscited by 6,411
  3. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  4. 2016Deep Learning with Differential Privacycited by 2,682
  5. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  6. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  7. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
  8. 2020Gradient Surgery for Multi-Task Learningcited by 1,210
  9. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
  10. 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 617
  11. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
  12. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
6 more
  1. 2014Sketching as a Tool for Numerical Linear Algebracited by 285
  2. 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
  3. 2014Lazier Than Lazy Greedycited by 97
  4. 2019BackPACK: Packing more into backpropcited by 77
  5. 2015Frequent Directions : Simple and Deterministic Matrix Sketchingcited by 39
  6. 2025GRAFT: Gradient-Aware Fast MaxVol Technique for Dynamic Data Samplingcited by 2

Built on by

Not cited yet.