Stagewise Training With Exponentially Growing Training Sets

Document Type

Article

Publication Title

IEEE Transactions on Neural Networks and Learning Systems

Abstract

In the world of big data, training large-scale machine learning problems has gained considerable attention. Numerous innovative optimization strategies have been presented in recent years to accelerate the large-scale training process. However, the possibility of further accelerating the training process of various optimization algorithms remains an unresolved subject. To begin addressing this difficult problem, we exploit the researched findings that when training data are independent and identically distributed, the learning problem on a smaller dataset is not significantly different from the original one. Upon that, we propose a stagewise training technique that grows the size of the training set exponentially while solving nonsmooth subproblem. We demonstrate that our stagewise training via exponentially growing the size of the training sets (STEGSs) are compatible with a large number of proximal gradient descent and gradient hard thresholding (GHT) techniques. Interestingly, we demonstrate that STEGS can greatly reduce overall complexity while maintaining statistical accuracy or even surpassing the intrinsic error introduced by GHT approaches. In addition, we analyze the effect of the training data growth rate on the overall complexity. The practical results of applying $l_{2,1}$ -and $l_0$ -norms to a variety of large-scale real-world datasets not only corroborate our theories but also demonstrate the benefits of our STEGS framework.

DOI

10.1109/TNNLS.2024.3402108

Publication Date

1-1-2024

Keywords

Approximation algorithms, Computational complexity, Gradient hard thresholding (GHT) algorithms, Optimization, proximal algorithms, Risk minimization, stagewise training strategy, stochastic optimization, Training, Training data, Upper bound

This document is currently not available here.

Share

COinS