Search Results for author:
Found 2 papers, 1 papers with code
$\texttt{LeadCache}$: Regret-Optimal Caching in Networks
We show that $\texttt{LeadCache}$ is regret-optimal up to a factor of $\tilde{O}(n^{3/8}),$ where $n$ is the number of users.
LeadCache: Regret-Optimal Caching in Networks
We show that $\texttt{LeadCache}$ is regret-optimal up to a factor of $\tilde{O}(n^{3/8}),$ where $n$ is the number of users.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
