Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.07756 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913197230915584 |
|---|---|
| author | Marnissi, Ouiame Hammouti, Hajar EL Bergou, El Houcine |
| author_facet | Marnissi, Ouiame Hammouti, Hajar EL Bergou, El Houcine |
| contents | In this paper, we study the performance of federated learning over wireless networks, where devices with a limited energy budget train a machine learning model. The federated learning performance depends on the selection of the clients participating in the learning at each round. Most existing studies suggest deterministic approaches for the client selection, resulting in challenging optimization problems that are usually solved using heuristics, and therefore without guarantees on the quality of the final solution. We formulate a new probabilistic approach to jointly select clients and allocate power optimally so that the expected number of participating clients is maximized. To solve the problem, a new alternating algorithm is proposed, where at each step, the closed-form solutions for user selection probabilities and power allocations are obtained. Our numerical results show that the proposed approach achieves a significant performance in terms of energy consumption, completion time and accuracy as compared to the studied benchmarks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_07756 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Joint Probability Selection and Power Allocation for Federated Learning Marnissi, Ouiame Hammouti, Hajar EL Bergou, El Houcine Machine Learning In this paper, we study the performance of federated learning over wireless networks, where devices with a limited energy budget train a machine learning model. The federated learning performance depends on the selection of the clients participating in the learning at each round. Most existing studies suggest deterministic approaches for the client selection, resulting in challenging optimization problems that are usually solved using heuristics, and therefore without guarantees on the quality of the final solution. We formulate a new probabilistic approach to jointly select clients and allocate power optimally so that the expected number of participating clients is maximized. To solve the problem, a new alternating algorithm is proposed, where at each step, the closed-form solutions for user selection probabilities and power allocations are obtained. Our numerical results show that the proposed approach achieves a significant performance in terms of energy consumption, completion time and accuracy as compared to the studied benchmarks. |
| title | Joint Probability Selection and Power Allocation for Federated Learning |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2401.07756 |