- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Cumulative Utility Parity (CUP), a fairness-aware federated learning framework for intermittent client participation. It introduces availability-normalized cumulative utility as a fairness objective and prioritizes clients based on historical utility deficits and missed participation opportunities. Cached model updates further compensate for unavailable clients. Theoretical analysis characterizes utility disparity and allocation targets, while experiments on non-IID CIFAR-10 evaluate fairness and predictive performance.
Critical strengths
-
The paper addresses a meaningful fairness problem by introducing availability-normalized cumulative utility, extending fairness evaluation beyond instantaneous performance.
-
The experiments use real-world availability traces and demonstrate improved cumulative fairness. The caching mechanism also provides practical benefits with limited runtime overhead.
Critical weaknesses
-
The methodological novelty is limited, as the proposed scheduling strategy closely resembles existing fairness-aware client selection methods. Its distinction from FairFedCS remains insufficiently justified.
-
The theoretical analysis does not guarantee that the practical scheduler achieves utility parity. Moreover, the limited experimental settings and lack of cache-enabled baseline comparisons weaken the empirical evidence.
Questions for authors
-
How does clipped local loss reduction reflect meaningful client contributions under heterogeneous data distributions?
-
Does the proposed scheduler achieve the theoretical max–min allocation target derived in Lemma 2?
-
How much of the improvement comes from caching rather than the scheduling mechanism? Would cache-enabled baselines show similar gains?
-
Do the fairness improvements persist under end-to-end model training and longer communication horizons?