Optimization methods for large-scale machine learning

Léon Bottou, Frank E. Curtis, Jorge Nocedal

Research output: Contribution to journalReview articlepeer-review

654 Scopus citations

Abstract

This paper provides a review and commentary on the past, present, and future of numerical optimization algorithms in the context of machine learning applications. Through case studies on text classification and the training of deep neural networks, we discuss how optimization problems arise in machine learning and what makes them challenging. A major theme of our study is that large-scale machine learning represents a distinctive setting in which the stochastic gradient (SG) method has traditionally played a central role while conventional gradient-based nonlinear optimization techniques typically falter. Based on this viewpoint, we present a comprehensive theory of a straightforward, yet versatile SG algorithm, discuss its practical behavior, and highlight opportunities for designing algorithms with improved performance. This leads to a discussion about the next generation of optimization methods for large-scale machine learning, including an investigation of two main streams of research on techniques that diminish noise in the stochastic directions and methods that make use of second-order derivative approximations.

Original languageEnglish (US)
Pages (from-to)223-311
Number of pages89
JournalSIAM Review
Volume60
Issue number2
DOIs
StatePublished - 2018

Keywords

  • Algorithm complexity analysis
  • Machine learning
  • Noise reduction methods
  • Numerical optimization
  • Second-order methods
  • Stochastic gradient methods

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Optimization methods for large-scale machine learning'. Together they form a unique fingerprint.

Cite this