One Method to Rule Them All: Variance Reduction for Data, Parameters and Many New Methods

By Filip Hanzely, Peter Richtárik. 2019

27 citations recorded by the source corpus.

We propose a remarkably general variance-reduced method suitable for solving regularized empirical risk minimization problems with either a large number of training examples, or a large model dimension, or both. In special cases, our method reduces to several known and previously thought to be unrelated methods, such as {\tt SAGA}, {\tt LSVRG}, {\tt JacSketch}, {\tt SEGA} and {\tt ISEGA}, and their arbitrary sampling and proximal generalizations. However, we also highlight a large number of new specific algorithms with interesting properties. We provide a single theorem establishing linear convergence of the method under smoothness and quasi strong convexity assumptions. With this theorem we recover best-known and sometimes improved rates for known methods arising in special cases. As a by-product, we provide the first unified method and theory for stochastic gradient and stochastic coordinate descent type methods.

Subfields: Artificial Intelligence, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Peter Richtárik
  2. Sebastian U. Stich
  3. Sai Praneeth Karimireddy
  4. Filip Hanzely
  5. Ananda Theertha Suresh
  6. Sashank J. Reddi
  7. Mehryar Mohri
  8. Dmitry Kovalev

In Statistics and Probability

  1. Filip Hanzely
  2. Peter Richtárik
  3. Sebastian U. Stich
  4. Dmitry Kovalev
  5. Ananda Theertha Suresh
  6. Xun Qian
  7. Sai Praneeth Karimireddy
  8. Sashank J. Reddi

Citations in the corpus