Sign inGet started
Paper · arXiv

Adaptive Data Admission and Retention for Streaming Federated Learning

We study streaming federated learning with limited client memory, where newly generated training data incur time-varying sampling costs and must be selectively admitted and retained over time. We consider a joint server-side admission and client-side memory-management framework with the objective of minimizing the cumulative excess population risk under a sampling-cost budget and buffer constraints. We first derive a learning-error bound that explicitly captures the effects of instantaneous training sample size, distinct-sample growth, and reuse imbalance through a characterization of the effective sample size. Through a surrogate penalty obtained from this bound, we develop an Active-Con...

AuthorsZhuoyi Zhao, Ben Liang
Primary categorycs.LG
Published27 July 2026
Last updated at source27 July 2026
cs.LGcs.AIcs.NI
Embed this entry
<iframe src="https://silytics.si/embed/item/a79b3538-26ee-4c6a-a79b-f22a9da395d5" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.