Non-smooth setting of stochastic decentralized convex optimization problem over time-varying Graphs
Aleksandr Lobanov (),
Andrew Veprikov (),
Georgiy Konin (),
Aleksandr Beznosikov (),
Alexander Gasnikov () and
Dmitry Kovalev ()
Additional contact information
Aleksandr Lobanov: Moscow Institute of Physics and Technology
Andrew Veprikov: Moscow Institute of Physics and Technology
Georgiy Konin: Moscow Institute of Physics and Technology
Aleksandr Beznosikov: Moscow Institute of Physics and Technology
Alexander Gasnikov: Moscow Institute of Physics and Technology
Dmitry Kovalev: Universite Catholique de Louvain
Computational Management Science, 2023, vol. 20, issue 1, No 48, 55 pages
Abstract:
Abstract Distributed optimization has a rich history. It has demonstrated its effectiveness in many machine learning applications, etc. In this paper we study a subclass of distributed optimization, namely decentralized optimization in a non-smooth setting. Decentralized means that m agents (machines) working in parallel on one problem communicate only with the neighbors agents (machines), i.e. there is no (central) server through which agents communicate. And by non-smooth setting we mean that each agent has a convex stochastic non-smooth function, that is, agents can hold and communicate information only about the value of the objective function, which corresponds to a gradient-free oracle. In this paper, to minimize the global objective function, which consists of the sum of the functions of each agent, we create a gradient-free algorithm by applying a smoothing scheme via $$l_2$$ l 2 randomization. We also verify in experiments the obtained theoretical convergence results of the gradient-free algorithm proposed in this paper.
Keywords: Stochastic Accelerated Decentralized Optimization Method; Time-varying graphs; Non-smooth opimization; Gradient-free algorithms (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10287-023-00479-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:comgts:v:20:y:2023:i:1:d:10.1007_s10287-023-00479-7
Ordering information: This journal article can be ordered from
http://www.springer. ... ch/journal/10287/PS2
DOI: 10.1007/s10287-023-00479-7
Access Statistics for this article
Computational Management Science is currently edited by Ruediger Schultz
More articles in Computational Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().