A Multi-Batch L-BFGS Method for Machine Learning
원문 초록
The question of how to parallelize the stochastic gradient descent (SGD) method has received much attention in the literature. In this paper, we focus instead on batch methods that use a sizeable fraction of the training set at each iteration to facilitate parallelism, and that employ second-order information. In order to improve the learning process, we follow a multi-batch approach in which the batch changes at each iteration. This can cause difficulties because L-BFGS employs gradient differences to update the Hessian approximations, and when these gradients are computed using different data points the process can be unstable. This paper shows how to perform stable quasi-Newton updating in the multi-batch setting, illustrates the behavior of the algorithm in a distributed computing platform, and studies its convergence properties for both the convex and nonconvex cases.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Correlations Are Ruining Your Gradient Descent
SacFL: Self-Adaptive Federated Continual Learning for Resource-Constrained End Devices
Tree-Guided $L_1$-Convex Clustering
Distributed LLMs and Multimodal Large Language Models: A Survey on Advances, Challenges, and Future Directions
Benchmarking Dynamic SLO Compliance in Distributed Computing Continuum Systems
Distributed Mixture-of-Agents for Edge Inference with Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.