Exploiting Strong Convexity from Data with Primal-Dual First-Order AlgorithmsDownload PDFOpen Website

2017 (modified: 11 Nov 2022)ICML 2017Readers: Everyone
Abstract: We consider empirical risk minimization of linear predictors with convex loss functions. Such problems can be reformulated as convex-concave saddle point problems and solved by primal-dual first-or...
0 Replies

Loading