IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v21y2024i1d10.1007_s10287-023-00493-9.html
   My bibliography  Save this article

Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters

Author

Listed:
  • Olga Yufereva

    (N. N. Krasovskii Institute of Mathematics and Mechanics)

  • Michael Persiianov

    (Moscow Institute of Physics and Technology)

  • Pavel Dvurechensky

    (Weierstrass Institute for Applied Analysis and Stochastics)

  • Alexander Gasnikov

    (Moscow Institute of Physics and Technology
    Skoltech
    Institute of information transmission problems)

  • Dmitry Kovalev

    (Université catholique de Louvain (UCL))

Abstract

Inspired by recent advances in distributed algorithms for approximating Wasserstein barycenters, we propose a novel distributed algorithm for this problem. The main novelty is that we consider time-varying computational networks, which are motivated by examples when only a subset of sensors can observe each time step, and yet, the goal is to average signals (e.g., satellite pictures of some area) by approximating their barycenter. We embed this problem into a class of non-smooth dual-friendly distributed optimization problems over time-varying networks and develop a first-order method for this class. We prove non-asymptotic accelerated in the sense of Nesterov convergence rates and explicitly characterize their dependence on the parameters of the network and its dynamics. In the experiments, we demonstrate the efficiency of the proposed algorithm when applied to the Wasserstein barycenter problem.

Suggested Citation

  • Olga Yufereva & Michael Persiianov & Pavel Dvurechensky & Alexander Gasnikov & Dmitry Kovalev, 2024. "Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters," Computational Management Science, Springer, vol. 21(1), pages 1-31, June.
    • Handle: RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00493-9
    DOI: 10.1007/s10287-023-00493-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-023-00493-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10287-023-00493-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00493-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.