Stochastic Optimization Using a Trust-Region Method and Random Models

Abstract

In this paper, we propose and analyze a trust-region model-based algorithm for solving unconstrained stochastic optimization problems. Our framework utilizes random models of an objective function $f(x)$, obtained from stochastic observations of the function or its gradient. Our method also utilizes estimates of function values to gauge progress that is being made. The convergence analysis relies on requirements that these models and these estimates are sufficiently accurate with sufficiently high, but fixed, probability. Beyond these conditions, no assumptions are made on how these models and estimates are generated. Under these general conditions we show an almost sure global convergence of the method to a first order stationary point. In the second part of the paper, we present examples of generating sufficiently accurate random models under biased or unbiased noise assumptions. Lastly, we present some computational results showing the benefits of the proposed method compared to existing approaches that are based on sample averaging or stochastic gradients.

Revised version posted September 23, 2016. Originally posted April 17, 2015

Cited by in corpus (4)

• Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Information
• Inexact Non-Convex Newton-Type Methods
• Black-Box Optimization in Machine Learning with Trust Region Based Derivative Free Algorithm
• A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity