SDCA without Duality
Shai Shalev-Shwartz School of Computer Science and Engineering, The Hebrew University, Jerusalem, Israel
Abstract
Stochastic Dual Coordinate Ascent is a popular method for solving regularized loss minimization for the case of convex losses. In this paper we show how a variant of SDCA can be applied for non-convex losses. We prove linear convergence rate even if individual loss functions are non-convex as long as the expected loss is convex.
原文 arXiv:1502.06177;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1502.06177v1