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

Preconditioning meets biased compression for efficient distributed optimization

Author

Listed:
  • Vitali Pirau

    (Moscow Institute of Physics and Technology)

  • Aleksandr Beznosikov

    (Moscow Institute of Physics and Technology)

  • Martin Takáč

    (Mohamed bin Zayed University of Artificial Intelligence)

  • Vladislav Matyukhin

    (Moscow Institute of Physics and Technology)

  • Alexander Gasnikov

    (Moscow Institute of Physics and Technology)

Abstract

Methods with preconditioned updates show up well in badly scaled and/or ill-conditioned convex optimization problems. However, theoretical analysis of these methods in distributed setting is not yet provided. We close this issue by studying preconditioned version of the Error Feedback (EF) method, a popular convergence stabilization mechanism for distributed learning with biased compression. We combine EF and EF21 algorithms with preconditioner based on Hutchinson’s approximation to the diagonal of the Hessian. An experimental comparison of the algorithms with the ResNet computer vision model is provided.

Suggested Citation

  • Vitali Pirau & Aleksandr Beznosikov & Martin Takáč & Vladislav Matyukhin & Alexander Gasnikov, 2024. "Preconditioning meets biased compression for efficient distributed optimization," Computational Management Science, Springer, vol. 21(1), pages 1-22, June.
  • Handle: RePEc:spr:comgts:v:21:y:2024:i:1:d:10.1007_s10287-023-00496-6
    DOI: 10.1007/s10287-023-00496-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-023-00496-6
    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-00496-6?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-00496-6. 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.