1 citations · 2 across the 4 of their papers we have counts for
5 papers
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…
Performance Model for Similarity Caching
Younes Ben Mazziane, Sara Alouf, Giovanni Neglia +1
Similarity caching allows requests for an item to be served by a similar item. Applications include recommendation systems, multimedia retrieval, and machine learning. Recently, ma…
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…
Computing the Hit Rate of Similarity Caching
Younes Ben Mazziane, Sara Alouf, Giovanni Neglia +1
Similarity caching allows requests for an item \(i\) to be served by a similar item \(i'\). Applications include recommendation systems, multimedia retrieval, and machine learning.…
A Formal Analysis of the Count-Min Sketch with Conservative Updates
Younes Ben Mazziane, Sara Alouf, Giovanni Neglia
Count-Min Sketch with Conservative Updates (CMS-CU) is a popular algorithm to approximately count items' appearances in a data stream. Despite CMS-CU's widespread adoption, the the…