Distributed Learning of Non-convex Linear Models with One Round of Communication
- 30 April 2020
- book chapter
- Published by Springer Nature
- p. 197-212
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Sharper Generalization Bound for Divide-and-Conquer Ridge RegressionProceedings of the AAAI Conference on Artificial Intelligence, 2019
- SCOPE: Scalable Composite Optimization for Learning on SparkProceedings of the AAAI Conference on Artificial Intelligence, 2017
- Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition2016
- Finite Sample Bernstein – von Mises Theorem for Semiparametric ProblemsBayesian Analysis, 2015
- Scaling Distributed Machine Learning with the Parameter Server2014
- Communication-efficient algorithms for statistical optimization2012
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Degenerate Nonlinear Programming with a Quadratic Growth ConditionSIAM Journal on Optimization, 2000
- Elements of Large-Sample Theory1999
- Second-order Sufficiency and Quadratic Growth for Nonisolated MinimaMathematics of Operations Research, 1995