* Revision from January 2015 submission. Major changes: updated
literature follow and discussion of subsequent work, additional Lemma showing
the validity of one of the formulas, somewhat simplified presentation of
Lyapunov bound, included code needed for checking proofs rather than the
polynomials generated by the code, added error regions to the numerical
experiments Access Paper or Ask Questions
* The notable changes over the current version: - worked example of
convergence rates showing SAG can be faster than first-order methods -
pointing out that the storage cost is O(n) for linear models - the
more-stable line-search - comparison to additional optimal SG methods -
comparison to rates of coordinate descent methods in quadratic case Access Paper or Ask Questions
