Metraipolis › archive › dc_45d37ae5d520

GLOBE: Trajectory-Aligned Gradient Matching with Structured SparseOptimization for Coreset Selection — arXiv:2608.02690

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.02690
License (as archived)
CC0-1.0
Archived
2026-10-31T12:42:07.398Z
SHA-256 of the archived text
f043e1a9c7cc6111aee48e05a1fd3a790d5713f9e5d75f88fe91be8ade8c81a9
Stable URL of this page
https://metraipolis.com/documento/dc_45d37ae5d520

How to cite

GLOBE: Trajectory-Aligned Gradient Matching with Structured SparseOptimization for Coreset Selection — arXiv:2608.02690 — arXiv (en), https://arxiv.org/abs/2608.02690 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_45d37ae5d520 (Metraipolis archive dc_45d37ae5d520, sha256 f043e1a9c7cc6111aee48e05a1fd3a790d5713f9e5d75f88fe91be8ade8c81a9)
BibTeX
@misc{dc45d37ae5d520,
  title = {GLOBE: Trajectory-Aligned Gradient Matching with Structured SparseOptimization for Coreset Selection — arXiv:2608.02690},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.02690},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_45d37ae5d520; sha256 f043e1a9c7cc6111aee48e05a1fd3a790d5713f9e5d75f88fe91be8ade8c81a9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.02690. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

On-device training of deep neural networks is fundamentally constrained by the computational and memory costs of large-scale datasets. Coreset selection offers a practical solution by retaining only a compact subset of real training samples. However, existing gradient-based methods commonly rely on gradients computed at a single model snapshot and employ greedy or pursuit-based selection procedures, limiting their ability to capture evolving optimization dynamics and handle strongly correlated samples. We propose GLOBE (Gradient Local-Balanced Extraction), a trajectory-aligned coreset selection framework that formulates sample selection as a globally optimized sparse weighting problem. GLOBE represents each sample by a gradient trajectory constructed across multiple training checkpoints, thereby capturing its influence throughout different stages of optimization. To preserve the training behavior of the full dataset, we introduce a multi-order matching objective that jointly aligns the first-order mean and projected uncentered second-order moments of gradient trajectories. GLOBE further combines Group LASSO, Elastic Net regularization, and nonnegative budget constraints to induce group- and sample-level sparsity while stabilizing the weights of correlated trajectories. Finally, class-balanced Top-K selection maintains adequate category coverage under limited sampling budgets. Experiments across six benchmarks and five evaluation architectures demonstrate that GLOBE consistently outperforms existing coreset selection methods in downstream test accuracy, particularly at low retention ratios. These results highlight the effectiveness of combining dynamic gradient information, multi-order distribution matching, and structured sparsity for data-efficient learning.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-05 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.02690 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T12:31:30.311Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).