Every Cache Entry Earns Its Place: Global Allocation of Resolution and Coverage for KV Cache Compression
As a co-first author, I helped develop GraceKV, which formulates KV cache compression under a fixed cache budget as a global resource allocation problem, adaptively balancing information coverage and local resolution across layers, KV heads, and context positions. It requires no additional training, runs entirely on GPU, and retains useful task behavior even in a 128x stress test, though the loss varies by task.