IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i18p3807-d1233332.html
   My bibliography  Save this article

Privacy-Preserving Distributed Learning via Newton Algorithm

Author

Listed:
  • Zilong Cao

    (School of Mathematics, Northwest University, Xi’an 710127, China)

  • Xiao Guo

    (School of Mathematics, Northwest University, Xi’an 710127, China)

  • Hai Zhang

    (School of Mathematics, Northwest University, Xi’an 710127, China)

Abstract

Federated learning (FL) is a prominent distributed learning framework. The main barriers of FL include communication cost and privacy breaches. In this work, we propose a novel privacy-preserving second-order-based FL method, called GDP-LocalNewton . To improve the communication efficiency, we use Newton’s method to iterate and allow local computations before aggregation. To ensure strong privacy guarantee, we make use of the notion of differential privacy (DP) to add Gaussian noise in each iteration. Using advanced tools of Gaussian differential privacy (GDP), we prove that the proposed algorithm satisfies the strong notion of GDP. We also establish the convergence of our algorithm. It turns out that the convergence error comes from the local computation and Gaussian noise for DP. We conduct experiments to show the merits of the proposed algorithm.

Suggested Citation

  • Zilong Cao & Xiao Guo & Hai Zhang, 2023. "Privacy-Preserving Distributed Learning via Newton Algorithm," Mathematics, MDPI, vol. 11(18), pages 1-21, September.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:18:p:3807-:d:1233332
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/18/3807/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/18/3807/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jinshuo Dong & Aaron Roth & Weijie J. Su, 2022. "Gaussian differential privacy," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(1), pages 3-37, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:gam:jmathe:v:11:y:2023:i:18:p:3807-:d:1233332. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.