Preprint
Machine Learning

Optimization Methods for Large-Scale Machine Learning

Léon Bottou(Meta (United States)), Frank E. Curtis(Lehigh University), Jorge M. Nocedal(Northwestern University)
January 1, 2018SIAM Review3,154 citations

3.2k

Citations

0

Influential Citations

SIAM Review

Venue

2018

Year

Abstract

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.

Analysis

Why This Paper Matters

Optimization is the engine behind modern machine learning, yet the optimization problems encountered in large-scale settings differ fundamentally from those in classical numerical optimization. This paper, authored by leading experts in the field, provides a timely and authoritative review that bridges the gap between optimization theory and machine learning practice. It argues that large-scale machine learning represents a distinctive setting where stochastic gradient (SG) methods thrive while conventional gradient-based nonlinear optimization techniques often falter. By articulating this viewpoint, the paper has become a foundational reference for researchers and practitioners seeking to understand why SG methods dominate and how to improve them.

The paper's significance is further amplified by its comprehensive treatment of the stochastic gradient algorithm, which, despite its simplicity, is versatile and central to training everything from linear classifiers to deep neural networks. The authors not only synthesize existing knowledge but also chart a course for future research by identifying two promising streams: techniques that diminish noise in stochastic directions and methods that leverage second-order derivative approximations. This forward-looking perspective has inspired numerous subsequent works and continues to shape the development of optimization algorithms for machine learning.

Moreover, the paper's impact is reflected in its high citation count (over 3,000) and its publication in SIAM Review, a venue that reaches both the optimization and machine learning communities. It serves as a critical bridge between these communities, fostering cross-disciplinary dialogue and collaboration.

Technical Contributions

  • Unified Theory of Stochastic Gradient Methods: The paper presents a comprehensive theoretical framework for SG algorithms, covering convergence properties, practical behavior, and the role of step-size selection.
  • Case Studies: Through detailed case studies on text classification and deep neural network training, the authors illustrate how optimization problems arise in machine learning and what makes them challenging, such as high dimensionality, non-convexity, and stochasticity.
  • Identification of Research Directions: The paper systematically reviews and categorizes two major streams of research for next-generation optimization: noise reduction techniques (e.g., variance reduction, momentum) and second-order methods (e.g., quasi-Newton, Hessian-free optimization).
  • Critical Analysis of Conventional Methods: It explains why traditional gradient-based nonlinear optimization techniques, which rely on accurate gradient computations, are often impractical in large-scale machine learning due to computational and memory constraints.

Results

As a review paper, it does not report new experimental results. Instead, it provides a synthesis of theoretical and empirical findings from the literature. The paper discusses the convergence rates of SG methods and compares them with batch gradient methods, highlighting the trade-offs between per-iteration cost and convergence speed. It also reviews empirical evidence from case studies, such as the effectiveness of SG for training deep networks and the challenges of hyperparameter tuning. The paper concludes by outlining open problems and potential avenues for algorithmic improvements, setting the stage for future empirical work.

Significance

The paper's significance lies in its clear articulation of the unique characteristics of optimization in large-scale machine learning and its identification of key research directions. It has influenced the development of advanced stochastic optimization algorithms, such as adaptive methods (e.g., Adam) and variance-reduced methods (e.g., SVRG), by providing a theoretical foundation and motivating the need for noise reduction and second-order information. Furthermore, it has become a standard reference for practitioners seeking to understand the principles behind the optimization algorithms they use daily. By bridging optimization and machine learning, the paper has fostered a deeper appreciation of the interplay between algorithm design and practical performance, ultimately contributing to the rapid progress in training large-scale models, including deep neural networks.