More communication-efficient distributed sparse learning

DOI10.1016/j.ins.2024.120523MaRDI QIDQ6546022

Guang Yang, Xing-Cai Zhou

Publication date: 29 May 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

distributed learningerror feedbackcommunication efficientgradient sparseindependent coordinate blocktop \(k\)

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed testing and estimation under sparse high dimensional models
• Communication-efficient algorithms for decentralized and stochastic optimization
• Distributed Coordinate Descent Method for Learning with Big Data
• Accelerated, Parallel, and Proximal Coordinate Descent
• Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
• Communication-Efficient Distributed Statistical Inference
• Classification of gene microarrays by penalized logistic regression
• Convergence of a block coordinate descent method for nondifferentiable minimization
• A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
• Sign stochastic gradient descents without bounded gradient assumption for the finite sum minimization
• First-Order Newton-Type Estimator for Distributed Estimation and Inference
• Byzantine-robust variance-reduced federated learning over distributed non-i.i.d. data
• Communication-efficient surrogate quantile regression for non-randomly distributed system

This page was built for publication: More communication-efficient distributed sparse learning