On the Convergence of a Family of Robust Losses for Stochastic Gradient Descent

By Bo Han, Ivor Wai-Hung Tsang, Ling Chen. 2016

22 citations recorded by the source corpus.

The convergence of Stochastic Gradient Descent SGD using convex loss functions has been widely studied. However, vanilla SGD methods using convex losses cannot perform well with noisy labels, which adversely affect the update of the primal variable in SGD methods. Unfortunately, noisy labels are ubiquitous in real world applications such as crowdsourcing. To handle noisy labels, in this paper, we present a family of robust losses for SGD methods. By employing our robust losses, SGD methods successfully reduce negative effects caused by noisy labels on each update of the primal variable. We not only reveal the convergence rate of SGD methods using robust losses, but also provide the robustness analysis on two representative robust losses. Comprehensive experimental results on six real-world datasets show that SGD methods using robust losses are obviously more robust than other baseline methods in most situations with fast convergence.

Subfields: Artificial Intelligence, Computational Mechanics

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. Philip S. Yu
  2. Lichao Sun
  3. Lingjuan Lyu
  4. Qiang Yang
  5. Han Yu
  6. Ivor Wai-Hung Tsang
  7. Xiaokui Xiao
  8. Jun Zhao

In Computational Mechanics

  1. Chris J. M. Yoon
  2. Philip S. Yu
  3. Qiang Yang
  4. Ivor Wai-Hung Tsang
  5. Clement Fung
  6. Bo Han
  7. Ling Chen
  8. Ivan Beschastnikh

Citations in the corpus