paper-with-me

Papers

A Progressive Batching L-BFGS Method for Machine Learning

2018-02-15 · ICML 2018 7 · Raghu Bollapragada, Dheevatsa Mudigere, Jorge Nocedal, Hao-Jun Michael Shi, Ping Tak Peter Tang

The standard L-BFGS method relies on gradient approximations that are not dominated by noise, so that search directions are descent directions, the line search is reliable, and quasi-Newton updating yields useful quadratic models of the objective function. All of this appears to call for a full batch approach, but since small batch sizes give rise to faster algorithms with better generalization properties, L-BFGS is currently not considered an algorithm of choice for large-scale machine learning applications. One need not, however, choose between the two extremes represented by the full batch or highly stochastic regimes, and may instead follow a progressive batching approach in which the sample size increases during the course of the optimization. In this paper, we present a new version of the L-BFGS algorithm that combines three basic components - progressive batching, a stochastic line search, and stable quasi-Newton updating - and that performs well on training logistic regression and deep neural networks. We provide supporting convergence theory for the method.

📄 PDF Abstract BibTeX arXiv:1802.05374

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine Learning

Similar Papers 제목 키워드 기반

Large-scale L-BFGS using MapReduce

2014-12-01 · NeurIPS 2014 12 · Weizhu Chen, Zhenghao Wang, Jingren Zhou

L-BFGS has been applied as an effective parameter estimation method for various machine learning algorithms since 1980s. With an increasing demand to deal with massive instances and variables, it is important to scale up…

BIG-bench Machine Learningparameter estimation

An Adaptive Memory Multi-Batch L-BFGS Algorithm for Neural Network Training

2020-12-14 · Federico Zocco, Seán McLoone

Motivated by the potential for parallel implementation of batch-based algorithms and the accelerated convergence achievable with approximated second order information a limited memory version of the BFGS algorithm has be…

Stochastic Damped L-BFGS with Controlled Norm of the Hessian Approximation

2020-12-10 · Sanae Lotfi, Tiphaine Bonniot de Ruisselet, Dominique Orban, Andrea Lodi

We propose a new stochastic variance-reduced damped L-BFGS algorithm, where we leverage estimates of bounds on the largest and smallest eigenvalues of the Hessian approximation to balance its quality and conditioning. Ou…

regression

ED-Batch: Efficient Automatic Batching of Dynamic Neural Networks via Learned Finite State Machines

2023-02-08 · Siyuan Chen, Pratik Fegade, Tianqi Chen, Phillip B. Gibbons 외

Batching has a fundamental influence on the efficiency of deep neural network (DNN) execution. However, for dynamic DNNs, efficient batching is particularly challenging as the dataflow graph varies per input instance. As…

CPUDynamic neural networksGPU

LazyBatching: An SLA-aware Batching System for Cloud Machine Learning Inference

2020-10-25 · Yujeong Choi, Yunseong Kim, Minsoo Rhu

In cloud ML inference systems, batching is an essential technique to increase throughput which helps optimize total-cost-of-ownership. Prior graph batching combines the individual DNN graphs into a single one, allowing m…

BIG-bench Machine LearningScheduling