← Search

Adrian Łańcucki

3 accepted papers

2025

Inference-Time Hyper-Scaling with KV Cache Compression

NeurIPS 2025poster

Inference-time scaling trades efficiency for increased reasoning accuracy by generating longer or more parallel sequences. However, in Transformer LLMs, generation cost is bottlenecked by the size of the key–value (KV) cache, rather than the number of generated tokens. Hence, we explore inference-ti…

Cited by 0SourceScholar
2024

Dynamic Memory Compression: Retrofitting LLMs for Accelerated Inference

ICML 2024poster

Transformers have emerged as the backbone of large language models (LLMs). However, generation remains inefficient due to the need to store in memory a cache of key–value representations for past tokens, whose size scales linearly with the input sequence length and batch size. As a solution, we prop…