paper-with-me

Papers

A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization

2018-03-04 · Ching-pei Lee, Cong Han Lim, Stephen J. Wright

We propose a communication- and computation-efficient distributed optimization algorithm using second-order information for solving ERM problems with a nonsmooth regularization term. Current second-order and quasi-Newton methods for this problem either do not work well in the distributed setting or work only for specific regularizers. Our algorithm uses successive quadratic approximations, and we describe how to maintain an approximation of the Hessian and solve subproblems efficiently in a distributed manner. The proposed method enjoys global linear convergence for a broad range of non-strongly convex problems that includes the most commonly used ERMs, thus requiring lower communication complexity. It also converges on non-convex problems, so has the potential to be used on applications such as deep learning. Initial computational results on convex problems demonstrate that our method significantly improves on communication cost and running time over the current state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:1803.01370

Code (1)

leepei/dplbfgs 공식 구현

Tasks

Distributed Optimization

Similar Papers 제목 키워드 기반

A Distributed Quasi-Newton Algorithm for Primal and Dual Regularized Empirical Risk Minimization

2019-12-12 · Ching-pei Lee, Cong Han Lim, Stephen J. Wright

We propose a communication- and computation-efficient distributed optimization algorithm using second-order information for solving empirical risk minimization (ERM) problems with a nonsmooth regularization term. Our alg…

Distributed Optimization

Quasi-Newton Methods for Machine Learning: Forget the Past, Just Sample

2019-01-28 · Albert S. Berahas, Majid Jahani, Peter Richtárik, Martin Takáč

We present two sampled quasi-Newton methods (sampled LBFGS and sampled LSR1) for solving empirical risk minimization problems that arise in machine learning. Contrary to the classical variants of these methods that seque…

BenchmarkingBIG-bench Machine LearningBinary ClassificationDistributed Computing+1

Distributed quasi-Newton robust estimation under differential privacy

2024-08-22 · Chuhan Wang, Lixing Zhu, Xuehu Zhu

For distributed computing with Byzantine machines under Privacy Protection (PP) constraints, this paper develops a robust PP distributed quasi-Newton estimation, which only requires the node machines to transmit five vec…

Distributed Computing

Exploiting Local Convergence of Quasi-Newton Methods Globally: Adaptive Sample Size Approach

2021-06-10 · NeurIPS 2021 12 · Qiujiang Jin, Aryan Mokhtari

In this paper, we study the application of quasi-Newton methods for solving empirical risk minimization (ERM) problems defined over a large dataset. Traditional deterministic and stochastic quasi-Newton methods can be ex…

A Stochastic Newton Algorithm for Distributed Convex Optimization

2021-10-07 · NeurIPS 2021 12 · Brian Bullins, Kumar Kshitij Patel, Ohad Shamir, Nathan Srebro 외

We propose and analyze a stochastic Newton algorithm for homogeneous distributed stochastic convex optimization, where each machine can calculate stochastic gradients of the same population objective, as well as stochast…

regression