A Stochastic Trust Region Algorithm Based on Careful Step Normalization
Preprint
Abstract
An algorithm is proposed for solving stochastic and finite sum minimization problems. Based on a trust region methodology, the algorithm employs normalized steps, at least as long as the norms of the stochastic gradient estimates are within a specified interval. The complete algorithm---which dynamically chooses whether or not to employ normalized steps---is proved to have convergence guarantees that are similar to those possessed by a traditional stochastic gradient approach under various sets of conditions related to the accuracy of the stochastic gradient estimates and choice of stepsize sequence. The results of numerical experiments are presented when the method is employed to minimize convex and nonconvex machine learning test problems. These results illustrate that the method can outperform a traditional stochastic gradient approach.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Optimization Methods for Large-Scale Machine LearningSIAM Review, 2018
- Stochastic optimization using a trust-region method and random modelsMathematical Programming, 2017
- Stochastic derivative-free optimization using a trust region frameworkComputational Optimization and Applications, 2016
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic ProgrammingSIAM Journal on Optimization, 2013
- Sample size selection in optimization methods for machine learningMathematical Programming, 2012
- Robust Stochastic Approximation Approach to Stochastic ProgrammingSIAM Journal on Optimization, 2009