aiqbench analysis
This research exposes the "answer-evidence gap" in large reasoning models, demonstrating that KV cache compression techniques can maintain final answer accuracy while significantly degrading the faithfulness of underlying reasoning chains and supporting rationales. The study highlights that token-eviction methods are particularly prone to losing access to critical parts of the reasoning trace compared to coverage-preserving quantization approaches. These findings urge developers to look beyond simple accuracy metrics when evaluating memory optimization strategies for complex AI tasks like mathematical derivation or clinical calculation.
Does Accuracy Equal Evidence? Reasoning Faithfulness under KV Cache Compression
arXiv:2608.01631v1 Announce Type: new Abstract: KV cache compression is commonly evaluated by final-answer accuracy, implicitly assuming that preserving the answer also preserves the reasoning that supports it. We test this assumption for large reasoning models and show that it can fail: under compression, correct answers and the validity of their visible supporting rationales can be preserved at different rates. We study this failure with a controlled fixed-trace replay protocol, which holds reasoning content fixed and isolates whether compression preserves usable information from an already available trace. We evaluate ten token-eviction KV compression methods and one quantization method on three models across mathematical reasoning, scientific QA, clinical calculation, and long-context retrieval. We measure final accuracy, answer-chain consistency, and perturbation faithfulness. Across tasks, token-eviction methods can preserve competitive final-answer accuracy while substantially degrading chain support or perturbation faithfulness. We call this the answer-evidence gap. A coverage-preserving quantization control is substantially less affected, suggesting that the failure is tied less to KV memory reduction itself than to losing access to parts of the reasoning trace. Code is available at https://github.com/famous-blue-raincoat/Safe_KV_Compress.
Title:Does Accuracy Equal Evidence? Reasoning Faithfulness under KV Cache Compression
Abstract:KV cache compression is commonly evaluated by final-answer accuracy, implicitly assuming that preserving the answer also preserves the reasoning that supports it. We test this assumption for large reasoning models and show that it can fail: under compression, correct answers and the validity of their visible supporting rationales can be preserved at different rates. We study this failure with a controlled fixed-trace replay protocol, which holds reasoning content fixed and isolates whether compression preserves usable information from an already available trace. We evaluate ten token-eviction KV compression methods and one quantization method on three models across mathematical reasoning, scientific QA, clinical calculation, and long-context retrieval. We measure final accuracy, answer-chain consistency, and perturbation faithfulness. Across tasks, token-eviction methods can preserve competitive final-answer accuracy while substantially degrading chain support or perturbation faithfulness. We call this the answer-evidence gap. A coverage-preserving quantization control is substantially less affected, suggesting that the failure is tied less to KV memory reduction itself than to losing access to parts of the reasoning trace. Code is available at this https URL.
Computation and Language (cs.CL)
arXiv:2608.01631 [cs.CL]
(or arXiv:2608.01631v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2608.01631 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 279 words
Related coverage
Not Pinning Your OpenRouter Provider Might Invalidate Your Research
LessWrong · Jul 23, 2026
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · Oct 8, 2026
[AINews] High Taste Testers Ep. 1
Latent Space · Oct 17, 2026

Hint-based CoT faithfulness evals still mostly work on Claude
LessWrong · Jul 30, 2026