- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes an online communication scheduler for buffered asynchronous hierarchical federated learning. It adjusts edge holding times and cloud aggregation deadlines using effective evidence, information age, event frequency and model disagreement. The two timers track closed-form targets through bounded log-domain updates, without using training-loss or validation feedback.
Critical strengths
The paper makes a useful distinction between waiting for client updates at the edge and waiting for edge updates in the cloud. The scheduler uses information already available at the aggregation nodes, so it does not require training-loss feedback, validation accuracy, or additional model transmissions, and the timer update itself involves only simple scalar calculations.
Critical weaknesses
-
The rationale for J(x)=A/x+Bx is reasonable, but the paper does not show why this particular rule should improve the actual communication–learning trade-off. Proving that the surrogate is convex does not establish that connection. The relative age term also raises a concern that it equals one when the current and previous ages are the same, regardless of whether the updates are fresh or consistently stale. It is unclear how the controller handles sustained high staleness.
-
The cloud waiting-time proof does not match the stated aggregation rule. Equation (3) requires a quorum before the adaptive deadline can trigger aggregation; otherwise, the system relies on T(hard). Lemma 4, which instead claims a bound based on the adaptive deadline whenever a dirty edge exists. This needs either a corrected bound or an additional assumption.
-
The experiments provide limited evidence of the proposed scheduler's benefit. The comparison with Non-Adaptive is useful, but separate edge-only and cloud-only ablations are needed to understand where the gains come from.
Questions for authors
Under the buffer-capacity, quorum and hard-deadline conditions, how often do T(hold) and T(max) actually determine when aggregation occurs? What evidence from trigger statistics and separate edge/cloud ablations shows that the proposed evidence–freshness rule reduces communication or time to a fixed target accuracy, rather than merely changing the timer values?