mlsanityData to 7 Oct 2026

WiCER: Wiki-memory Compile, Evaluate, Refine Iterative Knowledge Compilation for LLM Wiki Systems

arXiv 2605.07068 ↗First posted 8 May 2026cs.CL cs.AIcited by 4

On the map: Efficient LLM inference and serving → KV cache optimization

Abstract (arXiv)

The LLM Wiki pattern, to compile and provide domain knowledge into a persistent artifact and serve it to LLMs via KV cache inference, promises context access at sub-second latency with zero retrieval failure. Realizing this requires solving the compilation gap: LLM compilation distilling raw documents into a wiki without catastrophically discarding critical facts. We characterize this gap across 17 RepLiQA domains (6,800 questions): we observe that full context KV cache inference outperforms RAG on curated knowledge (4.38 vs. 4.08 out of 5, 7.3 faster TTFT) but degrades below RAG at scale due to attention dilution, and blind compilation fails entirely (2.14 to 2.32 vs. 3.46, 53 to 60% catastrophic failure rate). To address the compilation gap, we propose WiCER (Wiki-memory Compile, Evaluate, Refine), an iterative algorithm inspired by counterexample-guided abstraction refinement (CEGAR) that closes this gap. WiCER evaluates compiled wikis against diagnostic probes, identifies dropped facts, and forces their preservation in subsequent compilations. One to two iterations recover 80% of lost quality (mean 3.24 vs. 3.47 for raw full-context across the 15 topics with baselines), reducing catastrophic failures by 55% relative. An ablation across all 17 topics confirms that targeted diagnosis (+0.95), not generic pinning (+0.16), drives the gains. All code and benchmarks are released for reproducible research.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 24 of its 30 references that are in the map. First posted on arXiv 8 May 2026.

Builds on

24 of 30 references.

Closest ancestors · 4

Same direction, newest first

  1. 2024CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion26 May
  2. 2024ChunkAttention: Efficient Self-Attention with Prefix-Aware KV Cache and Two-Phase Partition23 Feb
  3. 2023CacheGen: KV Cache Compression and Streaming for Fast Large Language Model Serving11 Oct
  4. 2023Efficient Memory Management for Large Language Model Serving with PagedAttention12 Sep

Other references · 20

  1. 2024The Llama 3 Herd of Modelscited by 14,192
  2. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  3. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  4. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  5. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  6. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  7. 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
  8. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  9. 2023Retrieval-Augmented Generation for Large Language Models: A Surveycited by 2,185
  10. 2024From Local to Global: A Graph RAG Approach to Query-Focused Summarizationcited by 1,411
  11. 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,107
  12. 2023Can Large Language Models Be an Alternative to Human Evaluations?cited by 729
8 more
  1. 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 604
  2. 2022Efficiently Scaling Transformer Inferencecited by 529
  3. 2024RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrievalcited by 519
  4. 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
  5. 2023Prompt Cache: Modular Attention Reuse for Low-Latency Inferencecited by 255
  6. 2023BooookScore: A systematic exploration of book-length summarization in the era of LLMscited by 137
  7. 2024Don't Do RAG: When Cache-Augmented Generation is All You Need for Knowledge Taskscited by 38
  8. 2024RepLiQA: A Question-Answering Dataset for Benchmarking LLMs on Unseen Reference Contentcited by 26

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026KVFetch: Temporal Prefetching for the Missing Half of KV Cache Compression
  2. 2024SCBench: A KV Cache-Centric Analysis of Long-Context Methods
  3. 2026WikiKV: Schema-Evolving Path-Indexed Storage for Hierarchical Knowledge Navigation
  4. 2024ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression
  5. 2025Towards Efficient Key-Value Cache Management for Prefix Prefilling in LLM Inference
  6. 2025ChunkKV: Semantic-Preserving KV Cache Compression for Efficient Long-Context LLM Inference
  7. 2025Beyond RAG: Task-Aware KV Cache Compression for Comprehensive Knowledge Reasoning
  8. 2026C2KV: Compressed and Composable KV Cache Reuse for Efficient LLM Inference