Online and Stochastic Universal Gradient Methods for Minimizing Regularized Hölder Continuous Finite Sums in Machine Learning

Abstract

Listen

Translate article

AbstractOnline and stochastic gradient methods have emerged as potent tools in large scale optimization with both smooth convex and nonsmooth convex problems from the classes \(C^{1,1}(\mathbb {R}^p)\) and \(C^{1,0}(\mathbb {R}^p)\) respectively. However, to our best knowledge, there is few paper using incremental gradient methods to optimization the intermediate classes of convex problems with Hölder continuous functions \(C^{1,v}(\mathbb {R}^p)\). In order to fill the difference and the gap between the methods for smooth and nonsmooth problems, in this work, we propose several online and stochastic universal gradient methods, which we do not need to know the actual degree of the smoothness of the objective function in advance. We expanded the scope of the problems involved in machine learning to Hölder continuous functions and to propose a general family of first-order methods. Regret and convergent analysis shows that our methods enjoy strong theoretical guarantees. For the first time, we establish algorithms that enjoys a linear convergence rate for convex functions that have Hölder continuous gradients.KeywordsGradient MethodOnline AlgorithmConvex ProblemContinuous GradientDual AverageThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.