A Probabilistic Interpretation of KV Cache Eviction
This paper formalizes the problem of KV eviction and proves that it is computationally hard, and shows that this probabilistic version of KV eviction coupled with decode time correction is more robust to different tasks compared to existing eviction methods and achieves competitive performance at the same compression budget.
Renato Lui Geh, Alexander K. Chen, Daniel Mingyi Israel et al.
· 0 citations