<--- Back to Details
First PageDocument Content
Mathematical optimization / Operations research / Convex analysis / Convex optimization / Gradient descent / Big O notation / Regularized least squares / Random coordinate descent / Online machine learning
Date: 2015-09-16 19:38:43
Mathematical optimization
Operations research
Convex analysis
Convex optimization
Gradient descent
Big O notation
Regularized least squares
Random coordinate descent
Online machine learning

A Lower Bound for the Optimization of Finite Sums Alekh Agarwal Microsoft Research NYC, New York, NY. ALEKHA @ MICROSOFT. COM

Add to Reading List

Source URL: jmlr.org

Download Document from Source Website

File Size: 231,26 KB

Share Document on Facebook

Similar Documents