1 citations · 2 across the 4 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2025
Efficient and Optimal No-Regret Caching under Partial Observation
Younes Ben Mazziane, Francescomaria Faticanti, Sara Alouf +1
Online learning algorithms have been successfully used to design caching policies with sublinear regret in the total number of requests, with no statistical assumption about the re…
cs.LG2023
No-Regret Caching with Noisy Request Estimates
Younes Ben Mazziane, Francescomaria Faticanti, Giovanni Neglia +1
Online learning algorithms have been successfully used to design caching policies with regret guarantees. Existing algorithms assume that the cache knows the exact request sequence…