Choosing the Sample with Lowest Loss makes SGD Robust

By Vatsal Shah, Xiaoxia Wu, Sujay Sanghavi. 2020

51 citations recorded by the source corpus.

The presence of outliers can potentially significantly skew the parameters of machine learning models trained via stochastic gradient descent (SGD). In this paper we propose a simple variant of the simple SGD method: in each step, first choose a set of k samples, then from these choose the one with the smallest current loss, and do an SGD-like update with this chosen sample. Vanilla SGD corresponds to k = 1, i.e. no choice; k >= 2 represents a new algorithm that is however effectively minimizing a non-convex surrogate loss. Our main contribution is a theoretical analysis of the robustness properties of this idea for ML problems which are sums of convex losses; these are backed up with linear regression and small-scale neural network experiments

Subfields: Statistics and Probability, Optimization & Training

How researchers see this paper

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

In Statistics and Probability

  1. Gauri Joshi
  2. Sebastian U. Stich
  3. Martin Jaggi
  4. Reza Shokri
  5. Jianyu Wang

In Optimization & Training

  1. Jianyu Wang
  2. Gauri Joshi
  3. Sebastian U. Stich
  4. Martin Jaggi
  5. Yae Jee Cho
  6. Peter Richtárik
  7. Aryan Mokhtari
  8. Mehrdad Mahdavi

Citations in the corpus