Bolstering Stochastic Gradient Descent with Model Building

Ilker Birbil, Özgür Martin, Gönenc Onay, Figen Öztoprak

Keywords: Stochastic Line Search, Stochastic Model Building, Non-convex Stochastic Optimization, Unconstrained Optimization

Abstract: Stochastic gradient descent method and its variants constitute the core optimization algorithms that achieve good convergence rates for solving machine learning problems. These rates are obtained especially when these algorithms are fine-tuned for the application at hand. Although this tuning process can require large computational costs, recent work has shown that these costs can be reduced by line search methods that iteratively adjust the stepsize. We propose an alternative approach to stochastic line search by using a new algorithm based on forward step model building. This model building step incorporates a second-order information that allows adjusting not only the stepsize but also the search direction. Noting that deep learning model parameters come in groups (layers of tensors), our method builds its model and calculates a new step for each parameter group. This novel diagonalization approach makes the selected step lengths adaptive. We provide convergence rate analysis, and experimentally show that the proposed algorithm achieves faster convergence and better generalization in most problems. Moreover, our experiments show that the proposed method is quite robust as it converges for a wide range of initial stepsizes.

One-sentence Summary: We propose an alternative approach to stochastic line search by using a new algorithm based on model building.

Community Implementations: [ 2 code implementations](https://www.catalyzex.com/paper/arxiv:2111.07058/code)