The Bounded-Cache Transformer uses a fixed-size key-value memory updated by outer-product writes, claiming constant memory and preserved quality without providing experimental data.
Language models are unsupervised multitask learners
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Method for Building Large Language Models with Predefined KV Cache Capacity
The Bounded-Cache Transformer uses a fixed-size key-value memory updated by outer-product writes, claiming constant memory and preserved quality without providing experimental data.