{
  "annotation_id": "35bb95d0-c7ed-4595-b73c-dc2cd4fc3583",
  "date_created": "2026-02-17T05:53:23.793000Z",
  "date_modified": "2026-02-17T05:53:23.793000Z",
  "file_hash": "daaccf2d884b2b4cc66f51e6d6414da3871019de05c007a3186dc23745cfd318",
  "private": false,
  "record": {
    "abstract": "Compressing the KV cache is a required step to deploy large language models on edge devices. Current quantization methods compress storage but fail to reduce bandwidth as attention calculation requires dequantizing keys from INT4/INT8 to FP16 before use. We observe that attention scoring is mathematically equivalent to the inner product similarity search and we can apply some compression techniques from vector databases to compress KV-cache better. We propose LOOKAT, which applies product quantization and asymmetric distance computation, to transformer architecture by decomposing key vectors into subspaces, learning codebooks and computing attention tables via lookup tables. This transforms attention from memory-bound to compute-bound. LOOKAT achieves 64 $\\times$ compression at 95.7\\% output fidelity and 32 $\\times$ compression at 95.0\\% fidelity when tested on GPT-2. LOOKAT requires no architecture changes or training while maintaining rank correlation $\\rho \u003e 0.95$. Theoretical analysis confirms that rank correlation degrades as $O(d_k/mK)$, with guarantees validated across sequence lengths up to 1024 tokens.",
    "arxiv_id": "2601.10155",
    "authors": [
      "Aryan Karmore"
    ],
    "categories": [
      "cs.LG",
      "cs.AI"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "LOOKAT: Lookup-Optimized Key-Attention for Memory-Efficient Transformers",
    "url": "https://arxiv.org/abs/2601.10155",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9abed167-8e66-43b8-ba91-e341d66350f1",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}