logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Gossip-based asynchronous algorithms for distributed composite optimization

delete2025-02-01
delete0
PRE
AI
X
Xianju Fang
B
Baoyong Zhang *
D
Deming Yuan
DOI：10.1016/j.neucom.2024.128952delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The distributed composite optimization problem associated a multi-agent network is investigated in this paper. Different from conventional optimization issues, the cost function of composite optimization consists of a convex function and a regularization function (possibly nonsmooth). The gossip protocol is also introduced to enhance the robustness of the network, and a gossip-based distributed composite mirror descent algorithm is presented to deal with the previous problem, which adopts the asynchronous communication method. Moreover, the algorithm performance is analyzed and the theoretical results on the corresponding error bounds are obtained. Finally, the distributed logistic regression is provided as an example to validate the practicability of the proposed algorithm.
Keywords:
Asynchronous algorithm
Composite optimization
Distributed optimization
Gossip protocol
Mirror descent

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

No organization information available