G-2020-51
Stochastic adaptive regularization with dynamic sampling for machine learning
, , and BibTeX reference
In this paper, we consider both first- and second-order techniques to address continuous optimization problems arising in machine learning. In the first-order case, we propose a framework of transition from deterministic or semi-deterministic to stochastic quadratic regularization methods. We leverage the two-phase nature of stochastic optimization to propose a novel first-order algorithm with adaptive sampling and adaptive step size. In the second-order case, we propose a novel stochastic damped L-BFGS method that improves on previous algorithms in the highly nonconvex context of deep learning. Both algorithms are evaluated on well-known deep learning datasets and exhibit promising performance.
Published October 2020 , 17 pages
This cahier was revised in June 2021
Research Axis
Research application
Document
G2051R.pdf (700 KB)