Distributed Learning with Sparse Communications by Identification

DOI10.1137/20M1347772OpenAlexW3170809487MaRDI QIDQ4959464

Dmitry Grishchenko, Jérôme Malick, Massih-Reza Amini, Franck Iutzeler

Publication date: 13 September 2021

Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.03871

zbMATH Keywords

optimizationproximal algorithmsasynchronous algorithmsstructure-promoting regularization

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Numerical optimization and variational techniques (65K10) Distributed algorithms (68W15)

Uses Software

• ARock
• Celer

Cites Work

• On optimal probabilities in stochastic coordinate descent methods
• Randomized progressive hedging methods for multi-stage stochastic programming
• Nonsmoothness in machine learning: specific structure, proximal identification, and applications
• Error bounds for proximal point subproblems and associated inexact proximal point algorithms
• Descentwise inexact proximal algorithms for smooth optimization
• ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
• Low Complexity Regularization of Linear Inverse Problems
• Distributed Coordinate Descent Method for Learning with Big Data
• ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
• Optimization with Sparsity-Inducing Penalties
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
• Identifiable Surfaces in Constrained Optimization
• New Proximal Point Algorithms for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice
• Improved asynchronous parallel optimization analysis for stochastic incremental methods
• De-noising by soft-thresholding
• A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm
• An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration
• An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
• An accelerated communication-efficient primal-dual optimization framework for structured machine learning
• Convex analysis and monotone operator theory in Hilbert spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item