Search Results for author:
Found 2 papers, 1 papers with code
No-Regret Caching with Noisy Request Estimates
Online learning algorithms have been successfully used to design caching policies with regret guarantees.
Federated Learning under Heterogeneous and Correlated Client Availability
To this purpose, CA-Fed dynamically adapts the weight given to each client and may ignore clients with low availability and large correlation.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
