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

A High-Performance Federated Learning Aggregation Algorithm Based on Learning Rate Adjustment and Client Sampling

Author

Listed:
  • Yulian Gao

    (School of Information Science, Yunnan University, Kunming 650500, China)

  • Gehao Lu

    (School of Information Science, Yunnan University, Kunming 650500, China)

  • Jimei Gao

    (School of Computer and Software Engineering, Xihua University, Chengdu 610097, China)

  • Jinggang Li

    (School of Information Science, Yunnan University, Kunming 650500, China)

Abstract

Federated learning is a distributed learning framework designed to protect user privacy, widely applied across various domains. However, existing federated learning algorithms face challenges, including slow convergence, significant loss fluctuations during aggregation, and imbalanced client sampling. To address these issues, this paper introduces a high-performance federated learning aggregation algorithm. This algorithm combines a cyclic adaptive learning rate adjustment strategy with client-weighted random sampling, addressing the aforementioned problems. Weighted random sampling assigns client weights based on their sampling frequency, balancing client sampling rates and contributions to enhance model aggregation. Additionally, it adapts the learning rate based on client loss variations and communication rounds, accelerating model convergence and reducing communication costs. To evaluate this high-performance algorithm, experiments are conducted using well-known datasets MNIST and CIFAR-10. The results demonstrate significant improvements in convergence speed and loss stability. Compared to traditional federated learning algorithms, our approach achieves faster and more stable convergence while effectively reducing training costs.

Suggested Citation

  • Yulian Gao & Gehao Lu & Jimei Gao & Jinggang Li, 2023. "A High-Performance Federated Learning Aggregation Algorithm Based on Learning Rate Adjustment and Client Sampling," Mathematics, MDPI, vol. 11(20), pages 1-29, October.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:20:p:4344-:d:1263184
    as

    Download full text from publisher

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

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

    References listed on IDEAS

    as
    1. Mercier, Quentin & Poirion, Fabrice & Désidéri, Jean-Antoine, 2018. "A stochastic multiple gradient descent algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 808-817.
    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.
    1. Suyun Liu & Luis Nunes Vicente, 2022. "Accuracy and fairness trade-offs in machine learning: a stochastic multi-objective approach," Computational Management Science, Springer, vol. 19(3), pages 513-537, July.
    2. Chen, Jian & Tang, Liping & Yang, Xinmin, 2023. "A Barzilai-Borwein descent method for multiobjective optimization problems," European Journal of Operational Research, Elsevier, vol. 311(1), pages 196-209.

    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:20:p:4344-:d:1263184. 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.