no code implementations • NeurIPS 2021 • Debjit Paria, Abhishek Sinha
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.
1 code implementation • 17 Sep 2020 • Debjit Paria, Abhishek Sinha
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.