Fetching the paper…
Reading the bibliography…
In this work, we study a novel class of projection-based algorithms for linearly constrained problems (LCPs) which have a lot of applications in statistics, optimization, and machine learning.
Gradient methods for minimizing functionals
Boris Teodorovich Polyak · 1963
Earlier work this paper cites.
An algorithm for solving linearly constrained optimization problems
Roger Fletcher · 1972
Earlier work this paper cites.
A feasible conjugate-direction method to solve linearly constrained minimization problems
Michael J Best · 1975
Earlier work this paper cites.
Large-scale linearly constrained optimization
Bruce A Murtagh and Michael A Saunders · 1978
Earlier work this paper cites.
Linear programming and extensions
George Bernard Dantzig · 1998
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner · 1998
Earlier work this paper cites.
Convex optimization
Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Optimal transport: old and new
Cédric Villani · 2008
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedic and Asuman Ozdaglar · 2009
Earlier work this paper cites.
Sparse regression with exact clustering
Yiyuan She et al · 2010
Earlier work this paper cites.
Parallelized stochastic gradient descent
Martin Zinkevich, Markus Weimer, Lihong Li, and Alex J Smola · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Stephen Boyd, Neal Parikh, and Eric Chu · 2011
Earlier work this paper cites.
Dual averaging for distributed optimization: Convergence analysis and network scaling
John C Duchi, Alekh Agarwal, and Martin J Wainwright · 2011
Earlier work this paper cites.
The solution path of the generalized lasso
Ryan J Tibshirani, Jonathan Taylor, et al · 2011
Earlier work this paper cites.
Stochastic gradient descent with only one projection
Mehrdad Mahdavi, Tianbao Yang, Rong Jin, Shenghuo Zhu, and Jinfeng Yi · 2012
Earlier work this paper cites.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Earlier work this paper cites.
Optimization with first-order surrogate functions
Julien Mairal · 2013
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Yurii Nesterov · 2013
Earlier work this paper cites.
Accelerated dual descent for network flow optimization
Michael Zargham, Alejandro Ribeiro, Asuman Ozdaglar, and Ali Jadbabaie · 2013
Earlier work this paper cites.
Practical augmented Lagrangian methods for constrained optimization
Ernesto G Birgin and José Mario Martínez · 2014
Earlier work this paper cites.
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Earlier work this paper cites.
Communication-efficient distributed dual coordinate ascent
Martin Jaggi, Virginia Smith, Martin Takác, Jonathan Terhorst, Sanjay Krishnan, Thomas Hofmann, and Michael I Jordan · 2014
Earlier work this paper cites.
Stochastic proximal gradient descent with acceleration techniques
Atsushi Nitanda · 2014
Earlier work this paper cites.
Proximal algorithms
Neal Parikh and Stephen Boyd · 2014
Earlier work this paper cites.
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
Peter Richtárik and Martin Taká v · 2014
Earlier work this paper cites.
Communication-efficient distributed optimization using an approximate Newton-type method
Ohad Shamir, Nati Srebro, and Tong Zhang · 2014
Earlier work this paper cites.
A differential equation for modeling nesterov’s accelerated gradient method: Theory and insights
Weijie Su, Stephen Boyd, and Emmanuel Candes · 2014
Earlier work this paper cites.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Earlier work this paper cites.
Communication complexity of distributed convex learning and optimization
Yossi Arjevani and Ohad Shamir · 2015
Cited alongside, same era.
Playing with duality: An overview of recent primal? dual approaches for solving large-scale optimization problems
Nikos Komodakis and Jean-Christophe Pesquet · 2015
Cited alongside, same era.
A universal catalyst for first-order optimization
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2015
Cited alongside, same era.
Adding vs. averaging in distributed primal-dual optimization
Chenxin Ma, Virginia Smith, Martin Jaggi, Michael Jordan, Peter Richtárik, and Martin Takác · 2015
Cited alongside, same era.
Extra: An exact first-order algorithm for decentralized consensus optimization
Wei Shi, Qing Ling, Gang Wu, and Wotao Yin · 2015
Cited alongside, same era.
Disco: Distributed optimization for self-concordant empirical loss
Reinforcement learning: An introduction
Richard S Sutton and Andrew G Barto · 2018
Later among the works it cites.
Federated learning with non-iid data
Yue Zhao, Meng Li, Liangzhen Lai, Naveen Suda, Damon Civin, and Vikas Chandra · 2018
Later among the works it cites.
Communication-efficient accurate statistical estimation
Jianqing Fan, Yongyi Guo, and Kaizheng Wang · 2019
Later among the works it cites.
On the convergence of local descent methods in federated learning
Farzin Haddadpour and Mehrdad Mahdavi · 2019
Later among the works it cites.
Advances and open problems in federated learning
Peter Kairouz, H Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Arjun Nitin Bhagoji, Keith Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, et al · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yuchen Zhang and Xiao Lin · 2015
Cited alongside, same era.
Optimal black-box reductions between optimization objectives
Zeyuan Allen-Zhu and Elad Hazan · 2016
Cited alongside, same era.
Improved svrg for non-strongly-convex or sum-of-non-convex objectives
Zeyuan Allen-Zhu and Yang Yuan · 2016
Cited alongside, same era.
Aide: Fast and communication efficient distributed optimization
Sashank J Reddi, Jakub Kone v · 2016
Cited alongside, same era.
Tight complexity bounds for optimizing composite objectives
Blake E Woodworth and Nati Srebro · 2016
Cited alongside, same era.
Katyusha: The first direct acceleration of stochastic gradient methods
Zeyuan Allen-Zhu · 2017
Cited alongside, same era.
A globally and quadratically convergent primal–dual augmented lagrangian algorithm for equality constrained optimization
Paul Armand and Riadh Omheni · 2017
Cited alongside, same era.
Later among the works it cites.
Scaffold: Stochastic controlled averaging for on-device federated learning
Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J Reddi, Sebastian U Stich, and Ananda Theertha Suresh · 2019
Later among the works it cites.
On the convergence of FedAvg on Non-IID data
Xiang Li, Kaixuan Huang, Wenhao Yang, Shusen Wang, and Zhihua Zhang · 2019
Later among the works it cites.
Communication efficient decentralized training with multiple local updates
Xiang Li, Wenhao Yang, Shusen Wang, and Zhihua Zhang · 2019
Later among the works it cites.
Variance reduced local sgd with lower communication complexity
Xianfeng Liang, Shuheng Shen, Jingchang Liu, Zhen Pan, Enhong Chen, and Yifei Cheng · 2019
Later among the works it cites.
Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
Cuong V Nguyen, Huan Xu, Canyi Lu, Jiashi Feng, et al · 2019
Later among the works it cites.
Unified optimal analysis of the (stochastic) gradient method
Sebastian U Stich · 2019
Later among the works it cites.
Sebastian U Stich and Sai Praneeth Karimireddy · 2019
Later among the works it cites.
Federated machine learning: Concept and applications
Qiang Yang, Yang Liu, Tianjian Chen, and Yongxin Tong · 2019
Later among the works it cites.
Linear convergence of primal–dual gradient methods and their performance in distributed optimization
Sulaiman A Alghunaim and Ali H Sayed · 2020
Later among the works it cites.
Tighter theory for local sgd on identical and heterogeneous data
Ahmed Khaled Ragab Bayoumi, Konstantin Mishchenko, and Peter Richtárik · 2020
Later among the works it cites.
An efficient augmented lagrangian-based method for linear equality-constrained lasso
Zengde Deng, Man-Chung Yue, and Anthony Man-Cho So · 2020
Later among the works it cites.
Variance-reduced methods for machine learning
Robert M Gower, Mark Schmidt, Francis Bach, and Peter Richtárik · 2020
Later among the works it cites.
Penalized and constrained optimization: An application to high-dimensional website advertising
Gareth M James, Courtney Paulson, and Paat Rusmevichientong · 2020
Later among the works it cites.
A unified theory of decentralized sgd with changing topology and local updates
Anastasia Koloskova, Nicolas Loizou, Sadra Boreiri, Martin Jaggi, and Sebastian U Stich · 2020
Later among the works it cites.
Federated learning: Challenges, methods, and future directions
Tian Li, Anit Kumar Sahu, Ameet Talwalkar, and Virginia Smith · 2020
Later among the works it cites.
Finding second-order stationary points efficiently in smooth nonconvex linearly constrained optimization problems
Songtao Lu, Meisam Razaviyayn, Bo Yang, Kejun Huang, and Mingyi Hong · 2020
Later among the works it cites.
Fedsplit: An algorithmic framework for fast federated optimization
Reese Pathak and Martin J Wainwright · 2020
Later among the works it cites.
Minibatch vs local sgd for heterogeneous distributed learning
Blake Woodworth, Kumar Kshitij Patel, and Nathan Srebro · 2020
Later among the works it cites.
Is local sgd better than minibatch sgd?
Blake Woodworth, Kumar Kshitij Patel, Sebastian U Stich, Zhen Dai, Brian Bullins, H Brendan McMahan, Ohad Shamir, and Nathan Srebro · 2020
Later among the works it cites.
Federated accelerated stochastic gradient descent
Honglin Yuan and Tengyu Ma · 2020
Later among the works it cites.
Fedpd: A federated learning framework with optimal rates and adaptivity to non-iid data
Xinwei Zhang, Mingyi Hong, Sairaj Dhople, Wotao Yin, and Yang Liu · 2020
Later among the works it cites.
Sharper generalization bounds for learning with gradient-dominated objective functions
Anonymous · 2021
Closest in time.