paper-with-me

홈 › Papers

Diversified Batch Selection for Training Acceleration

2024-06-07 · Feng Hong, Yueming Lyu, Jiangchao Yao, Ya zhang, Ivor W. Tsang, Yanfeng Wang

The remarkable success of modern machine learning models on large datasets often demands extensive training time and resource consumption. To save cost, a prevalent research line, known as online batch selection, explores selecting informative subsets during the training process. Although recent efforts achieve advancements by measuring the impact of each sample on generalization, their reliance on additional reference models inherently limits their practical applications, when there are no such ideal models available. On the other hand, the vanilla reference-model-free methods involve independently scoring and selecting data in a sample-wise manner, which sacrifices the diversity and induces the redundancy. To tackle this dilemma, we propose Diversified Batch Selection (DivBS), which is reference-model-free and can efficiently select diverse and representative samples. Specifically, we define a novel selection objective that measures the group-wise orthogonalized representativeness to combat the redundancy issue of previous sample-wise criteria, and provide a principled selection-efficient realization. Extensive experiments across various tasks demonstrate the significant superiority of DivBS in the performance-speedup trade-off. The code is publicly available.

📄 PDF Abstract BibTeX arXiv:2406.04872

Code (1)

Feng-Hong/DivBS 공식 구현 pytorch

Tasks

Diversity

Similar Papers 제목 키워드 기반

Data-Efficient Training by Evolved Sampling

2025-09-27 · Ziheng Cheng, Zhong Li, Jiang Bian arxiv

Data selection is designed to accelerate learning with preserved performance. To achieve this, a fundamental thought is to identify informative data samples with significant contributions to the training. In this work, w…

InfoBatch: Lossless Training Speed Up by Unbiased Dynamic Data Pruning

2023-03-08 · Ziheng Qin, Kai Wang, Zangwei Zheng, Jianyang Gu 외

Data pruning aims to obtain lossless performances with less overall cost. A common approach is to filter out samples that make less contribution to the training. This could lead to gradient expectation bias compared to t…

Semantic Segmentation

SOBER: Highly Parallel Bayesian Optimization and Bayesian Quadrature over Discrete and Mixed Spaces

2023-01-27 · Masaki Adachi, Satoshi Hayakawa, Saad Hamid, Martin Jørgensen 외

Batch Bayesian optimisation and Bayesian quadrature have been shown to be sample-efficient methods of performing optimisation and quadrature where expensive-to-evaluate objective functions can be queried in parallel. How…

Bayesian OptimisationBayesian OptimizationDrug Discovery

Perfect Parallelization in Mini-Batch SGD with Classical Momentum Acceleration

2026-05-18 · Sachin Garg, Michał Dereziński arxiv

Accelerating stochastic gradient methods with classical momentum schemes, such as Polyak's heavy ball, has proven highly successful in training large-scale machine learning models, particularly when combined with the har…

Accelerating SGD with momentum for over-parameterized learning

2018-10-31 · ICLR 2020 1 · Chaoyue Liu, Mikhail Belkin

Nesterov SGD is widely used for training modern neural networks and other machine learning models. Yet, its advantages over SGD have not been theoretically clarified. Indeed, as we show in our paper, both theoretically a…