Stochastic Trust Region Methods with Trust Region Radius Depending on Probabilistic Models
arXiv:1904.03342 · doi:10.4208/jcm.2012-m2020-0144
Abstract
We present a stochastic trust-region model-based framework in which its radius is related to the probabilistic models. Especially, we propose a specific algorithm, termed STRME, in which the trust-region radius depends linearly on the latest model gradient. The complexity of STRME method in non-convex, convex and strongly convex settings has all been analyzed, which matches the existing algorithms based on probabilistic properties. In addition, several numerical experiments are carried out to reveal the benefits of the proposed methods compared to the existing stochastic trust-region methods and other relevant stochastic gradient methods.
References in corpus (9)
- On the Convergence of Adam and Beyond
- SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
- Identifying and attacking the saddle point problem in high-dimensional non-convex optimization
- Stochastic Recursive Gradient Algorithm for Nonconvex Optimization
- Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Information
- A Stochastic Line Search Method with Convergence Rate Analysis
- Second-Order Methods with Cubic Regularization Under Inexact Information
- Stochastic Variance-Reduced Cubic Regularized Newton Method
- Adaptive Stochastic Optimization