Stochastic Model-Based Minimization of Weakly Convex Functions 5: Under μ-Strong Convexity, Model-Based Minimization with β_t = μ(t+1)/2 Reaches Expected Function Gap O(1/(μT))Research Paper
Many problems in statistical learning and signal processing minimize an expectation plus a regularizer or constraint , with access to only through samples . The standard tool is the stochastic (proximal) subgradient method, which replaces at the current point by a random linear function. Two other methods use…