English

Batch-Max: Higher LLM Throughput using Larger Batch Sizes and KV Cache Compression

Computation and Language 2025-07-04 v3

Abstract

Several works have developed eviction policies to remove key-value (KV) pairs from the KV cache for more efficient inference. The focus has been on compressing the KV cache after the input prompt has been processed for faster token generation. In settings with limited GPU memory, and when the input context is longer than the generation length, we show that by also compressing the KV cache during the input processing phase, larger batch sizes can be used resulting in significantly higher throughput while still maintaining the original model's accuracy.

Keywords

Cite

@article{arxiv.2412.05693,
  title  = {Batch-Max: Higher LLM Throughput using Larger Batch Sizes and KV Cache Compression},
  author = {Michael R. Metel and Boxing Chen and Mehdi Rezagholizadeh},
  journal= {arXiv preprint arXiv:2412.05693},
  year   = {2025}
}
R2 v1 2026-06-28T20:26:38.614Z