Home/EURASIP Journal on Advances in Signal Processing/Article Record
Peer-Reviewed Article January 13, 2019

FROST—Fast row-stochastic optimization with uncoordinated step-sizes

Are you an author of this work?Link to your sovereign AfriScholar profile
Published in: EURASIP Journal on Advances in Signal Processing
Publisher: Springer Science+Business Media • Egypt • 1110-8657
DOI: https://doi.org/10.1186/s13634-018-0596-y

Abstract

In this paper, we discuss distributed optimization over directed graphs, where doubly stochastic weights cannot be constructed. Most of the existing algorithms overcome this issue by applying push-sum consensus, which utilizes column-stochastic weights. The formulation of column-stochastic weights requires each agent to know (at least) its out-degree, which may be impractical in, for example, broadcast-based communication protocols. In contrast, we describe FROST (Fast Row-stochastic-Optimization with uncoordinated STep-sizes), an optimization algorithm applicable to directed graphs that does not require the knowledge of out-degrees, the implementation of which is straightforward as each agent locally assigns weights to the incoming information and locally chooses a suitable step-size. We show that FROST converges linearly to the optimal solution for smooth and strongly convex functions given that the largest step-size is positive and sufficiently small.

Download Full Text PDFView at PublisherCrossref RecordCrossref XML

Verified Citation Velocity

Recorded scholarly citations in African and international peer-reviewed literature

102
Total Citations

Citations are continuously tracked and harvested across continental OJS endpoints and OpenAlex feeds.