A robust multi-batch L-BFGS method for machine learning. (2nd January 2020)

• Record Type: Journal Article
• Authors: Berahas, Albert S.; Takáč, Martin
• Is Part Of: Optimization methods and software. Volume 35:Number 1(2020)
• Page Start: 191
• Page End: 219
• Publication Date: 2020-01-02
• Subjects: L-BFGS -- multi-batch -- fault-tolerant -- sampling -- consistency -- overlap; 90C30 -- 90C06 -- 90C53; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2019.1658107
• Languages: English
• ISSNs: 1055-6788

Abstract

ABSTRACT: This paper describes an implementation of the L-BFGS method designed to deal with two adversarial situations. The first occurs in distributed computing environments where some of the computational nodes devoted to the evaluation of the function and gradient are unable to return results on time. A similar challenge occurs in a multi-batch approach in which the data points used to compute function and gradients are purposely changed at each iteration to accelerate the learning process. Difficulties arise because L-BFGS employs gradient differences to update the Hessian approximations, and when these gradients are computed using different data points the updating process can be unstable. This paper shows how to perform stable quasi-Newton updating in the multi-batch setting, studies the convergence properties for both convex and non-convex functions, and illustrates the behaviour of the algorithm in a distributed computing platform on binary classification logistic regression and neural network training problems that arise in machine learning.