{ "schema_version": 1, "builder_plan": { "scenario": "Long customer conversations exhaust memory or limit concurrent requests.", "change": "Change only the attention cache policy, after checking model and runtime support.", "baseline": "The same model with its ordinary attention cache.", "steps": [ "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.", "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.", "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.", "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test." ], "measure": "Peak cache memory, long-context answer quality, first-token latency, and requests completed.", "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation." }, "builder_review": null, "arxiv_id": "2610.19605", "title": "PN-Mix: Pair-Norm Guided Mixed-Precision Key Cache Quantization for Efficient Long-Output LLM Inference", "summary": "PN-Mix replaces fixed-precision or purely key-statistics-based mixed-precision KV cache quantization with saliency allocation driven by query-key pair-norm products at the RoPE channel-pair level, identified once during prefill and reused during decoding. The cost is a one-time prefill saliency analysis, implementation of per-channel-pair mixed-precision kernels, and residual accuracy loss at very low bit rates compared to full-precision caching. It can fail on non-RoPE or non-decoder-only architectures, on workloads whose saliency profile shifts between prefill and long decoding, and if custom kernel overhead negates the memory-bandwidth savings on a single-GPU serving stack.", "rationale": "The method directly targets KV cache memory and bandwidth bottlenecks in long-output inference on a single GPU with a plausible quality gain over existing low-bit baselines, but the realized benefit depends on the reader's model, output lengths, and availability of efficient mixed-precision kernels, so workload-specific validation is required before production adoption.", "technique": "Pair-norm guided mixed-precision key-cache quantization", "family": "cache_kv", "recommendation": "testar", "published": "2026-10-14", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.19605", "independent_implementations": 0, "total_implementations": 1, "stars": 0, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "PN-Mix replaces fixed-precision or purely key-statistics-based mixed-precision KV cache quantization with saliency allocation driven by query-key pair-norm products at the RoPE channel-pair level, identified once during prefill and reused during decoding. The cost is a one-time prefill saliency analysis, implementation of per-channel-pair mixed-precision kernels, and residual accuracy loss at very low bit rates compared to full-precision caching. It can fail on non-RoPE or non-decoder-only architectures, on workloads whose saliency profile shifts between prefill and long decoding, and if custom kernel overhead negates the memory-bandwidth savings on a single-GPU serving stack.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.19605", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "PN-Mix at 2.26-bit average key precision matches or exceeds prior mixed-precision methods using 2.32-2.39 bits on reasoning, code-generation, and AIME benchmarks, and degrades gracefully down to 1.5 bits where baselines drop sharply below 2.25 bits.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.19605", "source_page": null, "source_excerpt": "" } ], "exposure_map": [ { "dimension": "quality", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compute", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "latency", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "operations", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compatibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "security", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "data_and_training", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "reproducibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" } ], "risks": [], "minimum_test": [], "open_questions": [], "independent_tests": [], "lab_reproductions": [], "report_available": false, "validation_tier": "unknown", "evidence_tier": "unknown", "infrastructure_basis": "unknown", "equations": [], "equations_status": "not_fetched", "core_kind": "", "equations_fetched_at": "", "equations_source_url": "", "equations_source_sha256": "", "exposures_reviewed_at": "", "exposures_source_sha256": "" }