2020
DOI: 10.48550/arxiv.2002.11343
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

HFEL: Joint Edge Association and Resource Allocation for Cost-Efficient Hierarchical Federated Edge Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
16
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(16 citation statements)
references
References 17 publications
0
16
0
Order By: Relevance
“…The package loss rate 𝛾 is given as a background network parameter. Then from the definitions of 𝐢 𝑒 and 𝐢 𝑛 in (8) and (11), the joint optimization problem for FL implementation over a wireless network can be expressed as follows.…”
Section: Problem Formulationmentioning
confidence: 99%
See 3 more Smart Citations
“…The package loss rate 𝛾 is given as a background network parameter. Then from the definitions of 𝐢 𝑒 and 𝐢 𝑛 in (8) and (11), the joint optimization problem for FL implementation over a wireless network can be expressed as follows.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Due to different conditions of the clients, the specific system cost in each global epoch may be varied. Thus, in the definition of 𝐢 𝑒 and 𝐢 𝑛 in ( 8) and (11), the expectation on 𝑃 𝑑 is taken to get the expected cost for each global epoch.…”
Section: A Sub-problems For Hyper-parameters and Scheduling Policymentioning
confidence: 99%
See 2 more Smart Citations
“…Literature in FL cost optimization mainly focused on learning time and on-device energy consumption in mobile edge networks. The optimization of learning time was studied in [8], [27]- [33], and joint optimization for learning time and energy consumption was considered in [34]- [37]. These works considered resource (e.g., transmission power, communication bandwidth, and CPU frequency) allocation (e.g., [27], [28], [34]- [37]), cost-aware client selection (e.g., [29], [30]), client scheduling (e.g., [31]- [33]), and model pruning [8] for prespecified (i.e., non-optimized) design parameters (K and E in our case) of the FL algorithm.…”
Section: Related Workmentioning
confidence: 99%