Sparse Uncertainty-Informed Sampling from Federated Streaming Data
Not on the map. Why?
Abstract (arXiv)
We present a numerically robust, computationally efficient approach for non-I.I.D. data stream sampling in federated client systems, where resources are limited and labeled data for local model adaptation is sparse and expensive. The proposed method identifies relevant stream observations to optimize the underlying client model, given a local labeling budget, and performs instantaneous labeling decisions without relying on any memory buffering strategies. Our experiments show enhanced training batch diversity and an improved numerical robustness of the proposal compared to existing strategies over large-scale data streams, making our approach an effective and convenient solution in FL environments.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 11 references that are in the map. First posted on arXiv 30 Aug 2024.
Builds on
5 of 11 references.
References · 5
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2020The Future of Digital Health with Federated Learningcited by 625
- 2021Federated Learning for Open Bankingcited by 138
- 2023Streaming Active Learning with Deep Neural Networkscited by 20
- 2023Federated Learning for Data Streamscited by 15
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.