Pith. sign in

REVIEW 4 major objections 6 minor 146 references

DepthWeave-KV: Token-Adaptive Cross-Layer Residual Factorization for Long-Context KV Cache Compression

T0 review · 4 major / 6 minor · reviewed 2026-07-08 · glm-5.2

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read 8.3x KV Cache Compression Holds Quality in Long-Context LLMs

desk verdict Promising KV compression method with good design, but ablation inconsistencies and missing model details make results unverifiable. read the letter →

arxiv 2607.06523 v1 pith:3GB4ZE3A submitted 2026-07-07 cs.AI

Anna Cordoba , Adam Puente Tercero , Nerea Angulo Hijo , Mar Linares Tercero , Julia Barrientos , Ainhoa Miranda , Jesus Olivera This is my paper · ORCID
classification cs.AI
keywords compressiondepthweave-kvmemoryacrossresidualtokensattentioncache
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

DepthWeave-KV compresses the key-value cache in transformer language models by exploiting two forms of non-uniformity simultaneously. First, adjacent transformer layers share redundant structure, so instead of storing independent key-value tensors per layer, the method maintains shared low-rank channel bases across depth windows and reconstructs layer-specific states through lightweight mixing coefficients plus sparse, token-specific residuals. Second, not all tokens need the same reconstruction fidelity: a token-conditional depth router assigns higher residual rank to instruction-bearing and retrieval-critical tokens while aggressively compressing low-salience continuation tokens. An online attention-output probe mechanism periodically measures reconstruction error during generation and adjusts the router threshold without retraining the base model or requiring calibration data. A fused CUDA kernel ensures that the factorization itself does not introduce memory-traffic overhead at decode time. The paper claims this combination preserves near-full-cache quality (62.9% average task score vs. 63.8% for full cache, 96.1% Needle-in-a-Haystack retrieval accuracy) while reducing KV memory by 8.3x and improving decode throughput to 72.8 tokens/s at 64K context.

What carries the argument

Cross-depth residual factorization (shared low-rank bases + gated token-specific residuals), token-conditional depth router (Eq. 2), online attention-output probe error tracking (Eq. 3), fused CUDA kernel for basis lookup / residual dequantization / attention projection

What would settle it

A long-context benchmark containing rare, late-emerging retrieval targets that are not captured by the probe subset of heads would expose retrieval failures invisible to the online error tracker, causing Needle-in-a-Haystack accuracy to drop toward the levels of static-compression baselines.

Watch

Extended reading notes

Core claim

The central object is cross-depth residual factorization: a decomposition that separates the key-value cache into shared low-rank channel bases across neighboring transformer layers (capturing inter-layer redundancy) and token-specific gated residuals whose rank is dynamically assigned by a depth router based on token salience and online attention-output error. The paper demonstrates that cache compression quality depends on treating fidelity as both depth-dependent and token-dependent, and that an online probe measuring attention-output discrepancy (rather than raw KV-vector error) provides a calibration-free signal sufficient to adapt compression ratios during generation. The ablations are

Load-bearing premise

The online attention-output probe periodically materializes a higher-fidelity cache for a small subset of attention heads and assumes that the reconstruction error measured on this subset is representative of the full attention behavior, which may not hold for rare retrieval-critical tokens whose importance only emerges late in generation.

Editorial extensions

If this is right

  • Long-context LLM serving systems could adopt depth-aware, token-adaptive cache compression as a default, potentially enabling larger batch sizes and longer context windows under fixed GPU memory budgets.
  • The online probe mechanism suggests that compression ratios need not be fixed at prefill but can track generation-phase-dependent sensitivity, which may generalize to other dynamic resource allocation problems in inference.
  • If the attention-output error signal is robust across architectures, it could become a standard compression-quality metric replacing perplexity or raw reconstruction error, which the paper shows can mask retrieval failures.
  • The factorization approach is presented as complementary to quantization and token eviction, suggesting it could be composed with those methods for multiplicative memory savings.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper introduces DepthWeave-KV, a KV cache compression method that factorizes key/value states across neighboring transformer layers using shared low-rank channel bases, augmented by token-specific residuals whose ranks are assigned by a token-conditional depth router. An online attention-output probe mechanism adjusts compression aggressiveness during generation without retraining the base model. A fused CUDA kernel is provided to reduce decode-time memory traffic. The method is evaluated on LongBench, Needle-in-a-Haystack, L-Eval, and several QA/summarization benchmarks against nine compression baselines, reporting an average task score of 62.9% (vs. 63.8% for full cache) at 8.3× memory reduction and 96.1% needle retrieval accuracy.

Significance. The combination of cross-depth residual factorization with token-adaptive routing and calibration-free online error tracking is a reasonable and potentially useful contribution to the KV cache compression literature. The design is well-motivated by the observation that retrieval-critical tokens and depth-varying attention patterns require non-uniform treatment. The fused kernel design and the attention-output-based error metric (Eq. 3) are sensible engineering choices. However, the significance of the results is substantially undermined by reporting issues detailed below, most critically the unspecified base model and internally inconsistent ablation numbers.

major comments (4)
  1. §4, Experimental setup: The base model is never named. The text states 'all methods use the same base model' but does not identify it. The model's layer count, head count, and head dimension directly determine what an 8.3× compression ratio means in absolute terms, whether the depth-window factorization (§3, Eq. 1) is meaningful, and how the results compare to published baselines. Without this information, the central quality and memory claims cannot be independently contextualized or reproduced. This is load-bearing for every result in Tables 1 and 2.
  2. §4, Ablations paragraph vs. Table 2: The ablation text in §4 contains at least three numerical mismatches with Table 2 that are not rounding errors. (1) The text states removing token-conditional routing reduces average score to 61.1% and Needle accuracy to 91.8%, but Table 2 reports 61.2% and 92.4%. (2) The text states disabling online probes reduces Needle accuracy to 89.9%, but Table 2 reports 93.5% — a 3.6-point discrepancy that changes the qualitative conclusion about how important online error tracking is for retrieval. (3) The text states replacing cross-depth factorization with direct layer sharing yields 6.9× memory reduction and reconstruction error of 0.052, but Table 2 reports 5.9× and 0.044. Notably, §5's ablation discussion uses the Table 2 numbers, suggesting the §4 text reflects a stale version of the results. These inconsistencies must be resolved before the paper can be
  3. References: The bibliography contains numerous citations to topics entirely unrelated to KV cache compression or language modeling, including sea turtle anatomy (A et al., 2026a), PLC code generation (MF et al., 2026), infrared imaging (Y et al., 2026), neuron bifurcation analysis (MO et al., 2026), and others. This raises serious concerns about the integrity of the reference list and whether cited related work has been accurately represented. The authors should verify that every cited work is genuinely relevant and that no citations are fabricated or misplaced.
  4. §4, Tables 1–2: No error bars, confidence intervals, or significance tests are reported for any benchmark. Given that the headline margin over the strongest baseline (TailorKV) is 1.5 average-score points and 3.5 needle-accuracy points, some indication of variance across seeds or benchmark subsets is needed to assess whether these gains are robust.
minor comments (6)
  1. §3, Eq. (1): The notation uses Z ∈ {K, V} as a subscript/superscript variable, but the hat on X̂ is introduced without explicit definition of what X̂ represents (presumably the reconstructed key or value). Clarify.
  2. §3, Eq. (2): The router parameter u is described as 'learned' but the training procedure for u and the residual gates is only briefly mentioned ('trained once on unlabeled long-context text using a frozen teacher cache objective'). More detail on this training objective, data, and hyperparameters would aid reproducibility.
  3. §3: The probe interval p, depth window size w, and rank levels (ρ ∈ {0, 2, 4, 8}) are mentioned but their specific values for the main experiments are not stated. A configuration table would help.
  4. §4, Table 1: The decode throughput of 72.8 tok/s for DepthWeave-KV is higher than all baselines including Full KV Cache (42.1 tok/s). While the fused kernel explanation is plausible, the magnitude of the throughput gain (1.73× over full cache) deserves more discussion, including hardware specifications.
  5. Figure 2 is referenced but not visible in the text provided; ensure it clearly shows the data path described.
  6. §7: The future work discussion of probe representativeness for late-emerging retrieval tokens is a genuine limitation. Consider moving a brief statement of this limitation into the main results section rather than only discussing it in future work.

Simulated Author's Rebuttal

4 responses · 0 unresolved

We thank the referee for a careful and constructive report. The referee identifies four issues: (1) the base model is not named in the experimental setup, (2) ablation numbers in the §4 text are inconsistent with Table 2, (3) the bibliography contains citations to unrelated topics, and (4) no error bars or significance tests are reported. We agree that all four are legitimate concerns that must be addressed in revision. Below we respond point by point.

read point-by-point responses

  1. Referee: §4, Experimental setup: The base model is never named. The text states 'all methods use the same base model' but does not identify it. The model's layer count, head count, and head dimension directly determine what an 8.3× compression ratio means in absolute terms, whether the depth-window factorization (§3, Eq. 1) is meaningful, and how the results compare to published baselines. Without this information, the central quality and memory claims cannot be independently contextualized or reproduced. This is load-bearing for every result in Tables 1 and 2.

    Authors: The referee is correct. The base model identity, layer count, head count, head dimension, and hidden dimension are all omitted from the current manuscript, and these details are necessary to interpret the compression ratio, the depth-window size, and the comparability of our results to published baselines. This was an oversight in the experimental setup section. In the revised manuscript, we will explicitly name the base model and report its architecture (number of layers, attention heads, head dimension, hidden dimension, and context window). We will also clarify the depth-window size w used in our factorization and how it relates to the model's layer count, so that the 8.3× compression ratio and the ablation variants in Table 2 can be independently contextualized. We will additionally verify that all baseline numbers in Table 1 were obtained under the same model and configuration, or were taken from published results for the same model, and will state which is the case for each baseline. revision: yes

  2. Referee: §4, Ablations paragraph vs. Table 2: The ablation text in §4 contains at least three numerical mismatches with Table 2 that are not rounding errors. (1) The text states removing token-conditional routing reduces average score to 61.1% and Needle accuracy to 91.8%, but Table 2 reports 61.2% and 92.4%. (2) The text states disabling online probes reduces Needle accuracy to 89.9%, but Table 2 reports 93.5% — a 3.6-point discrepancy that changes the qualitative conclusion about how important online error tracking is for retrieval. (3) The text states replacing cross-depth residual factorization with direct layer sharing yields 6.9× memory reduction and reconstruction error of 0.052, but Table 2 reports 5.9× and 0.044. Notably, §5's ablation discussion uses the Table 2 numbers, suggesting the §4 text reflects a stale version of the results. These inconsistencies must be resolved before the纸can

    Authors: The referee is correct, and we appreciate the careful cross-checking. The §4 ablation paragraph does reflect a stale version of the results that was not updated to match the final Table 2 numbers. Specifically: (1) The correct numbers for the no-token-conditional-router variant are 61.2% average score and 92.4% Needle accuracy (as in Table 2), not 61.1% and 91.8%. The 91.8% figure in the §4 text actually corresponds to the no-residual-gates variant, which was conflated during revision. (2) The correct Needle accuracy for the no-online-probes variant is 93.5% (Table 2), not 89.9%. The 89.9% figure came from an earlier experimental run with a different probe interval; the final run used p=32 decode steps and showed a smaller but still meaningful degradation of 2.6 Needle points. We agree that this changes the qualitative emphasis: online error tracking provides a moderate improvement rather than a dramatic one, and the revised text will reflect this accurately. (3) The correct numbers for the cross-depth-factorization-removed variant are 5.9× memory reduction and 0.044 reconstruction error (Table 2), not 6.9× and 0.052. The §5 discussion already uses the correct Table 2 numbers, confirming that the §4 text is the stale version. In the revised manuscript, we will ensure that all ablation numbers in §4 are consistent with Table 2 and will remove any references to superseded experimental runs. We will also add a note clarifying which ablation variant each number corresponds to. revision: yes

  3. Referee: References: The bibliography contains numerous citations to topics entirely unrelated to KV cache compression or language modeling, including sea turtle anatomy (A et al., 2026a), PLC code generation (MF et al., 2026), infrared imaging (Y et al., 2026), neuron bifurcation analysis (MO et al., 2026), and others. This raises serious concerns about the integrity of the reference list and whether cited related work has been accurately represented. The authors should verify that every cited work is genuinely relevant and that no citations are fabricated or misplaced.

    Authors: The referee is correct. The bibliography contains multiple citations to works entirely unrelated to KV cache compression, language modeling, or any topic discussed in the paper. Examples include citations on sea turtle anatomy, PLC code generation, infrared imaging, neuron bifurcation analysis, and others. These appear to have been introduced through an automated reference management error during manuscript preparation and were not caught before submission. We will conduct a complete audit of the reference list, remove all irrelevant citations, and verify that every remaining citation is genuinely relevant and accurately represented in the text. We will also verify that no cited related work has been mischaracterized. We take this concern seriously and acknowledge that it should have been caught before submission. revision: yes

  4. Referee: §4, Tables 1–2: No error bars, confidence intervals, or significance tests are reported for any benchmark. Given that the headline margin over the strongest baseline (TailorKV) is 1.5 average-score points and 3.5 needle-accuracy points, some indication of variance across seeds or benchmark subsets is needed to assess whether these gains are robust.

    Authors: The referee is correct that no variance estimates are reported, and given the relatively small margins over the strongest baseline, this is a legitimate concern. In the revised manuscript, we will report results averaged over at least three random seeds for the main benchmarks (LongBench average, Needle-in-a-Haystack, and L-Eval) and will include standard deviations or confidence intervals in Tables 1 and 2. For Needle-in-a-Haystack specifically, we will also report variance across needle positions and context lengths, since the 3.5-point margin over TailorKV is the most important retrieval claim and should be supported by variance estimates. We note that for deterministic decoding (greedy, as used in our experiments), seed variance arises from the compression method's stochastic components (basis initialization, router threshold adaptation) rather than from the decoding itself, so the variance may be modest; but this should be demonstrated empirically rather than assumed. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the derivation chain is self-contained against external benchmarks and external ground-truth references.

full rationale

The paper's core claims are empirical results measured against external benchmarks (LongBench, Needle-in-a-Haystack, L-Eval, etc.) and external baselines (StreamingLLM, H2O, SnapKV, MiniCache, etc.). The method's three components do not exhibit circular dependencies: (1) Cross-depth residual factorization (Eq. 1) is an architectural design choice — shared low-rank bases plus gated residuals — not a claimed derivation from first principles. (2) The token-conditional router (Eq. 2) is trained on a frozen-teacher reconstruction objective and then evaluated on downstream task quality; the training objective (cache reconstruction) differs from the evaluation metric (task scores), so the results are not forced by the training setup. (3) Online error tracking (Eq. 3) compares the compressed cache against a temporarily materialized full-fidelity cache — an external ground truth, not a quantity defined by the method itself. The error signal feeds back into the router threshold, but this is a feedback control loop, not a circular definition: the reference (full cache) is independent of the compressed representation. No self-citations are load-bearing: the paper cites MiniCache (Liu et al., 2024a), KVSharer (Yang et al., 2024a), and other works by different author groups as motivation and baselines. The reconstruction error reported in Table 1 (0.027) is measured against the full cache via Eq. 3, which is a legitimate measurement against an external reference. The skeptic's concerns about ablation-text/Table-2 numerical mismatches and the unnamed base model are correctness and reproducibility risks, not circularity issues. No step in the derivation chain reduces to its own inputs by construction.

Assumptions & free parameters 6 free parameters · 3 assumptions · 2 invented entities

The method introduces several hand-tuned parameters (rank levels, window size, probe interval) and learned components (router parameter u) without full specification. The axioms rely on domain assumptions about layer redundancy and attention-output error as a quality proxy, which are plausible but not independently verified.

free parameters (6)
  • u (router parameter)
    Learned router parameter shared across layers in the window, trained on unlabeled long-context text.
  • tau_m (adaptive threshold)
    Window-specific threshold chosen to satisfy current memory budget, adjusted online.
  • rb (basis rank)
    Rank of shared basis channels, not explicitly specified.
  • w (depth window size)
    Size of overlapping depth windows, not explicitly specified.
  • p (probe interval)
    Number of decode steps between probes, not explicitly specified.
  • rho rank levels = 0, 2, 4, 8
    Residual rank levels for different token types, chosen by hand.
assumptions (3)
  • domain assumption Adjacent transformer layers contain correlated cache structure that can be captured by shared low-rank bases.
    Section 3: The method partitions layers into overlapping depth windows and assumes redundancy is mostly local in depth.
  • domain assumption Attention-output reconstruction error is a reliable proxy for downstream task quality and retrieval fidelity.
    Section 3: The online error tracking uses attention-output probes to adjust compression, assuming this metric captures behaviorally relevant distortion.
  • domain assumption Token salience can be inferred from accumulated attention mass, attention spikes, and delimiter indicators.
    Section 3: The router computes a score from these four online features to allocate residual rank.
invented entities (2)
  • Shared low-rank channel bases (B_K, B_V)
    purpose: Capture common component among adjacent layers to reduce per-layer storage.
    Introduced by this paper; no external evidence provided for their effectiveness beyond the paper's own benchmarks.
  • Token-conditional depth router
    purpose: Allocate reconstruction rank based on token salience and attention behavior.
    A novel routing mechanism; its effectiveness is only validated within the paper's experiments.

how reviews work

0 comments
Cite this review

Pith. "Pith review of DepthWeave-KV: Token-Adaptive Cross-Layer Residual Factorization for Long-Context KV Cache Compression." pith.science (2026). https://pith.science/paper/3GB4ZE3A

@misc{pith2026260706523,
  author       = {Pith},
  title        = {Pith review of: DepthWeave-KV: Token-Adaptive Cross-Layer Residual Factorization for Long-Context KV Cache Compression},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3GB4ZE3A}},
  note         = {Machine review of arXiv:2607.06523}
}
read the original abstract

Long-context language model inference is increasingly limited by the memory bandwidth and capacity required to store key-value caches, yet existing compression methods often apply uniform budgets across layers or tokens and degrade retrieval when lexical cues and semantic states require different preservation. We introduce DepthWeave-KV, a token-adaptive cache compression method that factorizes key and value states across neighboring transformer layers using shared low-rank channel bases while retaining lightweight token-specific residuals where attention behavior is sensitive. DepthWeave-KV combines cross-depth residual factorization with a token-conditional depth router that allocates higher reconstruction rank to instruction-bearing and retrieval-critical tokens, and uses calibration-free online error tracking from attention-output probes to adapt compression during generation without retraining the base model. A fused CUDA implementation jointly performs basis lookup, residual dequantization, and attention projection to reduce decode-time memory traffic. Across LongBench, Needle-in-a-Haystack, L-Eval, and long-form QA and summarization benchmarks, DepthWeave-KV achieves near-full-cache task quality with substantially lower memory use, improving average score and retrieval accuracy over prior compressed caches while reaching 8.3x KV memory reduction and 72.8 tokens per second at 64K context.

Figures

Figures reproduced from arXiv: 2607.06523 by the authors.

Figure 1
Figure 1. DepthWeave-KV overview: instead of compressing all layers and tokens uniformly, the method weaves shared depth bases across adjacent layers and spends residual capacity only on tokens whose attention behavior signals retrieval or instruction importance. Xiang et al., 2025; Wang et al., 2024; Akulov et al., 2025; Yu & Chai, 2025a;b). ChunkKV emphasizes semantic preser￾vation at segment granularity (Xiang et al., 2025… view at source ↗
Figure 2
Figure 2. summarizes the full data path. During prefill, DepthWeave-KV forms depth-window bases, projects keys and values into shared coefficient space, stores quantized residuals according to the router, and records probe statistics. During decoding, the fused kernel loads the shared basis rows, dequantizes only the routed residual channels, recon￾structs the needed key/value fragments, and immediately feeds them into the at… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

146 extracted references · 146 canonical work pages

  1. [1]

    2026 , journal =

    PolyKV: A Shared Asymmetrically-Compressed KV Cache Pool for Multi-Agent LLM Inference , author =. 2026 , journal =

    work page 2026

  2. [2]

    2024 , journal =

    MiniCache: KV Cache Compression in Depth Dimension for Large Language Models , author =. 2024 , journal =

    work page 2024

  3. [3]

    2026 , journal =

    Make Each Token Count: Towards Improving Long-Context Performance with KV Cache Eviction , author =. 2026 , journal =

    work page 2026

  4. [4]

    2026 , journal =

    ReST-KV: Robust KV Cache Eviction with Layer-wise Output Reconstruction and Spatial-Temporal Smoothing , author =. 2026 , journal =

    work page 2026

  5. [5]

    2026 , journal =

    The risk of KV cache compression , author =. 2026 , journal =

    work page 2026

  6. [6]

    2025 , journal =

    Attention Is All You Need for KV Cache in Diffusion LLMs , author =. 2025 , journal =

    work page 2025

  7. [7]

    2025 , journal =

    R-KV: Redundancy-aware KV Cache Compression for Reasoning Models , author =. 2025 , journal =

    work page 2025

  8. [8]

    2024 , journal =

    Lossless KV Cache Compression to 2\ author =. 2024 , journal =

    work page 2024

Show all 146 references
  1. [9]

    2026 , journal =

    Knowledge Packs: Zero-Token Knowledge Delivery via KV Cache Injection , author =. 2026 , journal =

    2026

  2. [10]

    2025 , journal =

    The Pitfalls of KV Cache Compression , author =. 2025 , journal =

    2025

  3. [11]

    2025 , journal =

    ChunkKV: Semantic-Preserving KV Cache Compression for Efficient Long-Context LLM Inference , author =. 2025 , journal =

    2025

  4. [12]

    2024 , journal =

    A Survey on Large Language Model Acceleration based on KV Cache Management , author =. 2024 , journal =

    2024

  5. [13]

    2024 , journal =

    KVSharer: Efficient Inference via Layer-Wise Dissimilar KV Cache Sharing , author =. 2024 , journal =

    2024

  6. [14]

    2025 , journal =

    Towards Efficient Large Language Model Serving: A Survey on System-Aware KV Cache Optimization , author =. 2025 , journal =

    2025

  7. [15]

    2025 , journal =

    TailorKV: A Hybrid Framework for Long-Context Inference via Tailored KV Cache Optimization , author =. 2025 , journal =

    2025

  8. [16]

    2026 , journal =

    Compressing Kv Cache for Long-Context LLM Inference with Inter-Layer Attention Similarity , author =. 2026 , journal =

    2026

  9. [17]

    2025 , journal =

    SpindleKV: A Novel KV Cache Reduction Method Balancing Both Shallow and Deep Layers , author =. 2025 , journal =

    2025

  10. [18]

    2024 , journal =

    Model Tells You Where to Merge: Adaptive KV Cache Merging for LLMs on Long-Context Tasks , author =. 2024 , journal =

    2024

  11. [19]

    2025 , journal =

    Hcattention: Extreme Kv Cache Compression Via Heterogeneous Attention Computing for Llms , author =. 2025 , journal =

    2025

  12. [20]

    2025 , journal =

    EvolKV: Evolutionary KV Cache Compression for LLM Inference , author =. 2025 , journal =

    2025

  13. [21]

    2025 , journal =

    Key, Value, Compress: A Systematic Exploration of KV Cache Compression Techniques , author =. 2025 , journal =

    2025

  14. [22]

    2026 , journal =

    The kv4 Trade-off Is Workload-Dependent: A Depth-and Workload-Resolved Study of 4-bit KV-Cache Quantization on a 4 GB Turing GPU , author =. 2026 , journal =

    2026

  15. [23]

    2025 , journal =

    TableKV: KV Cache Compression for In-Context Table Processing , author =. 2025 , journal =

    2025

  16. [24]

    2026 , journal =

    Q-KVComm: Efficient Multi-Agent Communication via Adaptive KV Cache Compression , author =. 2026 , journal =

    2026

  17. [25]

    2026 , journal =

    HCAttention: Extreme KV cache compression via heterogeneous attention computing for LLMs , author =. 2026 , journal =

    2026

  18. [26]

    2025 , journal =

    Enhancing Large Multimodal Models with Adaptive Sparsity and KV Cache Compression , author =. 2025 , journal =

    2025

  19. [27]

    2024 , journal =

    Eigen Attention: Attention in Low-Rank Space for KV Cache Compression , author =. 2024 , journal =

    2024

  20. [28]

    2025 , journal =

    KVCompose: Efficient Structured KV Cache Compression with Composite Tokens , author =. 2025 , journal =

    2025

  21. [29]

    2024 , journal =

    Residual vector quantization for KV cache compression in large language model , author =. 2024 , journal =

    2024

  22. [30]

    2024 , journal =

    More Tokens, Lower Precision: Towards the Optimal Token-Precision Trade-off in KV Cache Compression , author =. 2024 , journal =

    2024

  23. [31]

    2026 , journal =

    How Much Cache Does Reasoning Need? Depth-Cache Tradeoffs in KV-Compressed Transformers , author =. 2026 , journal =

    2026

  24. [32]

    2026 , journal =

    Stochastic KV Routing: Enabling Adaptive Depth-Wise Cache Sharing , author =. 2026 , journal =

    2026

  25. [33]

    2025 , journal =

    Reimagining Memory Access for LLM Inference: Compression-Aware Memory Controller Design , author =. 2025 , journal =

    2025

  26. [34]

    2026 , journal =

    HACK++: Towards More Effective Head-Aware Key-Value Compression for Efficient Visual Autoregressive Modeling , author =. 2026 , journal =

    2026

  27. [35]

    2026 , journal =

    From Layers to Submodules: Rethinking Granularity in Replacement-Based LLM Compression , author =. 2026 , journal =

    2026

  28. [36]

    2026 , journal =

    StructKV: Preserving the Structural Skeleton for Scalable Long-Context Inference , author =. 2026 , journal =

    2026

  29. [37]

    , author =

    Structural optimization principles for edge AI in motorsport telemetry. , author =. 2026 , journal =

    2026

  30. [38]

    , author =

    Building large-scale English-Romanian literary translation resources with open models. , author =. 2026 , journal =

    2026

  31. [39]

    , author =

    Limit-Cycle Proliferation Under Parametric Delayed Feedback in a Conductance-Based Neuron: Bifurcation Landscape, Orbit Catalog, and Capacity Analysis. , author =. 2026 , journal =

    2026

  32. [40]

    , author =

    Towards sustainable AI knowledge-base assistants in computer science education: on-premise deployment and optimization with open educational resources. , author =. 2026 , journal =

    2026

  33. [41]

    , author =

    Multi-Hardware Benchmarking of Open-Source Large Language Models with Retrieval-Augmented Generation for Mitsubishi FX-Series PLC Instruction List Code Generation. , author =. 2026 , journal =

    2026

  34. [42]

    , author =

    Infrared Imaging for Autonomous Power Inspection: A Review from Detector to System Integration. , author =. 2026 , journal =

    2026

  35. [43]

    , author =

    A survey on LLM-as-a-judge. , author =. 2026 , journal =

    2026

  36. [44]

    , author =

    The Rise of Small Language Models in Healthcare: A Comprehensive Survey. , author =. 2026 , journal =

    2026

  37. [45]

    , author =

    Development of a Rapid Deep-Learning-Assisted Multiphase Multicomponent Numerical Simulation Protocol. , author =. 2026 , journal =

    2026

  38. [46]

    , author =

    F-Transformer: a federated transformer for efficient and privacy-preserving sequence generation. , author =. 2026 , journal =

    2026

  39. [47]

    2021 , journal =

    The Modern Mathematics of Deep Learning , author =. 2021 , journal =

    2021

  40. [48]

    2023 , journal =

    Learn to Accumulate Evidence from All Training Samples: Theory and Practice , author =. 2023 , journal =

    2023

  41. [49]

    2023 , journal =

    Deep Learning and Computational Physics (Lecture Notes) , author =. 2023 , journal =

    2023

  42. [50]

    2026 , journal =

    Monodense Deep Neural Model for Determining Item Price Elasticity , author =. 2026 , journal =

    2026

  43. [51]

    2017 , journal =

    A multitask deep learning model for real-time deployment in embedded systems , author =. 2017 , journal =

    2017

  44. [52]

    2026 , journal =

    Training Transformers for KV Cache Compressibility , author =. 2026 , journal =

    2026

  45. [53]

    2019 , journal =

    Deep learning observables in computational fluid dynamics , author =. 2019 , journal =

    2019

  46. [54]

    2024 , journal =

    Mooncake: A KVCache-centric Disaggregated Architecture for LLM Serving , author =. 2024 , journal =

    2024

  47. [55]

    2025 , journal =

    Efficient Many-Shot In-Context Learning with Dynamic Block-Sparse Attention , author =. 2025 , journal =

    2025

  48. [56]

    2025 , journal =

    SwiftKV: Fast Prefill-Optimized Inference with Knowledge-Preserving Model Transformation , author =. 2025 , journal =

    2025

  49. [57]

    2026 , journal =

    Sub-Token Routing for KV Cache Compression , author =. 2026 , journal =

    2026

  50. [58]

    2024 , journal =

    Hymba: A Hybrid-head Architecture for Small Language Models , author =. 2024 , journal =

    2024

  51. [59]

    2025 , journal =

    KV-RAPTOR: Scalable Tree-Structured Retrieval with KV Cache Compression for Question-Answering Systems , author =. 2025 , journal =

    2025

  52. [60]

    1970 , journal =

    Deep Learning-Based Point Cloud Compression: An In-Depth Survey and Benchmark\_supp1-3594355.pdf , author =. 1970 , journal =

    1970

  53. [61]

    2026 , journal =

    KV Pareto: Systems-Level Optimization of KV Cache and Model Compression for Long Context Inference , author =. 2026 , journal =

    2026

  54. [62]

    2025 , journal =

    FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression , author =. 2025 , journal =

    2025

  55. [63]

    2026 , journal =

    FastKV: Decoupling of Context Reduction and KV Cache Compression for Prefill-Decoding Acceleration , author =. 2026 , journal =

    2026

  56. [64]

    , author =

    Large-Scale Model-Enhanced Vision-Language Navigation: Recent Advances, Practical Applications, and Future Challenges. , author =. 2026 , journal =

    2026

  57. [65]

    , author =

    SS-AdaMoE: Spatio-Spectral Adaptive Mixture of Experts with Global Structural Priors for Graph Node Classification. , author =. 2026 , journal =

    2026

  58. [66]

    , author =

    AI Agents as Universal Task Solvers. , author =. 2026 , journal =

    2026

  59. [67]

    , author =

    Green prompt engineering for sustainable generative AI. , author =. 2026 , journal =

    2026

  60. [68]

    , author =

    Anatomic Interactive Atlas of the Loggerhead Sea Turtle (Caretta caretta) Coelomic Cavity. , author =. 2026 , journal =

    2026

  61. [69]

    , author =

    On Demand Secure Scalable Video Streaming for Both Human and Machine Applications. , author =. 2026 , journal =

    2026

  62. [70]

    , author =

    Compute-in-memory implementation of state space models for event sequence processing. , author =. 2026 , journal =

    2026

  63. [71]

    , author =

    Kilohertz volumetric imaging of in vivo dynamics using squeezed light field microscopy. , author =. 2025 , journal =

    2025

  64. [72]

    and S, S

    A, A. and S, S. Ai agents as universal task solvers. PMC, 2026. doi:10.3390/e28030332

    2026 doi

  65. [73]

    Anatomic interactive atlas of the loggerhead sea turtle (caretta caretta) coelomic cavity

    A, A., A, M., and J, O. Anatomic interactive atlas of the loggerhead sea turtle (caretta caretta) coelomic cavity. PMC, 2026 a . doi:10.3390/ani16050754

    2026 doi

  66. [74]

    On demand secure scalable video streaming for both human and machine applications

    A, Z., Y, F., and J, Z. On demand secure scalable video streaming for both human and machine applications. PMC, 2026 b . doi:10.3390/s26041285

    2026 doi

  67. [75]

    D., Salem, T

    Akulov, D., Sana, M., Domenico, A. D., Salem, T. S., Piovesan, N., and Ayed, F. Kvcompose: Efficient structured kv cache compression with composite tokens. Preprint, 2025. doi:10.48550/arXiv.2509.05165

    2025 doi

  68. [76]

    Rest-kv: Robust kv cache eviction with layer-wise output reconstruction and spatial-temporal smoothing

    An, Y., Lu, C., Zhu, K., Yu, T., Zhao, C., Wu, H., Tang, M., and Wang, J. Rest-kv: Robust kv cache eviction with layer-wise output reconstruction and spatial-temporal smoothing. arXiv preprint, 2026

    2026

  69. [77]

    The modern mathematics of deep learning

    Berner, J., Grohs, P., Kutyniok, G., and Petersen, P. The modern mathematics of deep learning. arXiv preprint, 2021. doi:10.1017/9781009025096.002

    2021 doi

  70. [78]

    T., Cohan, A., and Ying, R

    Bui, N., Nguyen, H. T., Cohan, A., and Ying, R. Make each token count: Towards improving long-context performance with kv cache eviction. arXiv preprint, 2026

    2026

  71. [79]

    R-kv: Redundancy-aware kv cache compression for reasoning models

    Cai, Z., Xiao, W., Sun, H., Luo, C., Zhang, Y., Wan, K., Li, Y., Zhou, Y., Chang, L.-W., Gu, J., Dong, Z., Anandkumar, A., Asi, A., and Hu, J. R-kv: Redundancy-aware kv cache compression for reasoning models. arXiv preprint, 2025

    2025

  72. [80]

    V., and Israel, D

    Chen, A., Geh, R., Grover, A., den Broeck, G. V., and Israel, D. The pitfalls of kv cache compression. arXiv preprint, 2025

    2025

  73. [81]

    Structkv: Preserving the structural skeleton for scalable long-context inference

    Chen, Z., Liu, P., and Shao, L. Structkv: Preserving the structural skeleton for scalable long-context inference. Preprint, 2026. doi:10.48550/arXiv.2604.06746

    2026 doi arXiv

  74. [82]

    Tablekv: Kv cache compression for in-context table processing

    Corallo, G., Faure-Rolland, E., Lamari, M., and Papotti, P. Tablekv: Kv cache compression for in-context table processing. Journal, 2025. doi:10.18653/v1/2025.trl-1.13

    2025 doi

  75. [83]

    From layers to submodules: Rethinking granularity in replacement-based llm compression

    Cunegatti, E., Vukojevic, M., Nielsen, E., and Iacca, G. From layers to submodules: Rethinking granularity in replacement-based llm compression. Preprint, 2026

    2026

  76. [84]

    da Silva, J. G. J., de Oliveira, S. S. T., Alves, L. A., Eiris, N., and Filho, A. R. G. Kv-raptor: Scalable tree-structured retrieval with kv cache compression for question-answering systems. Journal, 2025. doi:10.5753/sbbd.2025.247245

    2025 doi

  77. [85]

    L., Fu, Y., Diao, S., Byeon, W., Chen, Z., Mahabaleshwarkar, A

    Dong, X. L., Fu, Y., Diao, S., Byeon, W., Chen, Z., Mahabaleshwarkar, A. S., Liu, S.-Y., Keirsbilck, M. V., Chen, M.-H., Suhara, Y., Lin, Y., Kautz, J., and Molchanov, P. Hymba: A hybrid-head architecture for small language models. Journal, 2024. doi:10.48550/arxiv.2411.13676

    2024 doi arXiv

  78. [86]

    Stochastic kv routing: Enabling adaptive depth-wise cache sharing

    Filippova, A., Grangier, D., Cuturi, M., and Monteiro, J. Stochastic kv routing: Enabling adaptive depth-wise cache sharing. Preprint, 2026. doi:10.48550/arXiv.2604.22782

    2026 doi arXiv

  79. [87]

    Deep learning-based point cloud compression: An in-depth survey and benchmark\_supp1-3594355.pdf

    Gao, W. Deep learning-based point cloud compression: An in-depth survey and benchmark\_supp1-3594355.pdf. Journal, 1970. doi:10.1109/tpami.2025.3594355/mm1

    1970 doi

  80. [88]

    N., Kumaran, K., Sharma, A., and Uniyal, M

    Garg, L., Yaswanth, S., Mishra, D. N., Kumaran, K., Sharma, A., and Uniyal, M. Monodense deep neural model for determining item price elasticity. arXiv preprint, 2026. doi:10.1109/AAIML67890.2026.11498150

    2026 doi

  81. [89]

    Training transformers for kv cache compressibility

    Gelberg, Y., Eitan, Y., Bronstein, M., Gal, Y., and Maron, H. Training transformers for kv cache compressibility. arXiv preprint, 2026

    2026

  82. [90]

    Kv pareto: Systems-level optimization of kv cache and model compression for long context inference

    Gokhale, S., Das, D., Patwari, R., Sirasao, A., and Delaye, E. Kv pareto: Systems-level optimization of kv cache and model compression for long context inference. Journal, 2026. doi:10.18653/v1/2026.eacl-industry.9

    2026 doi

  83. [91]

    Minicache: Kv cache compression in depth dimension for large language models

    Haffari, G., He, Y., Liu, A., Liu, J., Pan, Z., and Zhuang, B. Minicache: Kv cache compression in depth dimension for large language models. Journal, 2024. doi:10.52202/079017-4443

    2024 doi

  84. [92]

    A., Posada-Moreno, A

    Haverbeck, L., Alonso, C. A., Posada-Moreno, A. F., Trimpe, S., and Pavone, M. The risk of kv cache compression. arXiv preprint, 2026

    2026

  85. [93]

    A survey on llm-as-a-judge

    J, G., X, J., Z, S., H, T., X, Z., C, X., W, L., Y, S., S, M., H, L., S, W., K, Z., Z, L., B, Z., L, N., W, G., Y, W., and J, G. A survey on llm-as-a-judge. PMC, 2026. doi:10.1016/j.xinn.2025.101253

    2026 doi

  86. [94]

    D., and Koushanfar, F

    Javidnia, N., Rouhani, B. D., and Koushanfar, F. Key, value, compress: A systematic exploration of kv cache compression techniques. Journal, 2025. doi:10.1109/cicc63670.2025.10983416

    2025 doi

  87. [95]

    Towards efficient large language model serving: A survey on system-aware kv cache optimization

    Jiang, J., Yang, P., Zhang, R., and Liu, F. Towards efficient large language model serving: A survey on system-aware kv cache optimization. Journal, 2025. doi:10.18653/v1/2026.findings-acl.1916

    2025 doi

  88. [96]

    Fastkv: Decoupling of context reduction and kv cache compression for prefill-decoding acceleration

    Jo, D., Song, J., Kim, Y., and Kim, J.-J. Fastkv: Decoupling of context reduction and kv cache compression for prefill-decoding acceleration. Journal, 2026. doi:10.18653/v1/2026.findings-acl.1610

    2026 doi

  89. [97]

    and Ng, L

    Kriuk, B. and Ng, L. Q-kvcomm: Efficient multi-agent communication via adaptive kv cache compression. Journal, 2026. doi:10.1109/icmsci67830.2026.11469367

    2026 doi

  90. [98]

    Residual vector quantization for kv cache compression in large language model

    Kumar, A. Residual vector quantization for kv cache compression in large language model. Preprint, 2024. doi:10.48550/arXiv.2410.15704

    2024 doi arXiv

  91. [99]

    Development of a rapid deep-learning-assisted multiphase multicomponent numerical simulation protocol

    L, F., Q, S., Q, X., and X, L. Development of a rapid deep-learning-assisted multiphase multicomponent numerical simulation protocol. PMC, 2026. doi:10.1021/acsomega.6c03179

    2026 doi

  92. [100]

    A survey on large language model acceleration based on kv cache management

    Li, H., Li, Y., Tian, A., Tang, T., Xu, Z., Chen, X., Hu, N., Dong, W., Li, Q., and Chen, L. A survey on large language model acceleration based on kv cache management. Journal, 2024. doi:10.48550/arxiv.2412.19442

    2024 doi arXiv

  93. [101]

    Faedkv: Infinite-window fourier transform for unbiased kv cache compression

    Li, R., Fu, Y., Sheng, M., Long, X., Yu, H., and Li, P. Faedkv: Infinite-window fourier transform for unbiased kv cache compression. Journal, 2025. doi:10.18653/v1/2025.findings-emnlp.914

    2025 doi

  94. [102]

    Minicache: Kv cache compression in depth dimension for large language models

    Liu, A., Liu, J., Pan, Z., He, Y., Haffari, G., and Zhuang, B. Minicache: Kv cache compression in depth dimension for large language models. arXiv preprint, 2024 a

    2024

  95. [103]

    Minicache: Kv cache compression in depth dimension for large language models

    Liu, A., Liu, J., Pan, Z., He, Y., Haffari, G., and Zhuang, B. Minicache: Kv cache compression in depth dimension for large language models. Journal, 2024 b . doi:10.48550/arxiv.2405.14366

    2024 doi arXiv

  96. [104]

    O., Mishra, S., and Ray, D

    Lye, K. O., Mishra, S., and Ray, D. Deep learning observables in computational fluid dynamics. arXiv preprint, 2019. doi:10.1016/j.jcp.2020.109339

    2019 doi

  97. [105]

    The rise of small language models in healthcare: A comprehensive survey

    M, G., S, R., S, R., X, L., and S, S. The rise of small language models in healthcare: A comprehensive survey. PMC, 2026 a . doi:10.1016/j.cosrev.2026.100999

    2026 doi

  98. [106]

    Building large-scale english-romanian literary translation resources with open models

    M, N., L, D., A, T., and A, P. Building large-scale english-romanian literary translation resources with open models. PMC, 2026 b . doi:10.3389/frai.2026.1807431

    2026 doi

  99. [107]

    Compressing kv cache for long-context llm inference with inter-layer attention similarity

    Ma, D., Chen, L., Zhang, S., Miao, Y., Zhu, S., Chen, Z., Xu, H., Li, H., Fan, S., Pan, L., and Yu, K. Compressing kv cache for long-context llm inference with inter-layer attention similarity. Journal, 2026. doi:10.1109/icassp55912.2026.11464826

    2026 doi

  100. [108]

    and Maki, A

    Marti, M. and Maki, A. A multitask deep learning model for real-time deployment in embedded systems. arXiv preprint, 2017

    2017

  101. [109]

    Multi-hardware benchmarking of open-source large language models with retrieval-augmented generation for mitsubishi fx-series plc instruction list code generation

    MF, Y., CC, L., and CL, L. Multi-hardware benchmarking of open-source large language models with retrieval-augmented generation for mitsubishi fx-series plc instruction list code generation. PMC, 2026. doi:10.3390/s26113602

    2026 doi

  102. [110]

    Limit-cycle proliferation under parametric delayed feedback in a conductance-based neuron: Bifurcation landscape, orbit catalog, and capacity analysis

    MO, A., AJ, A., MAF, A.-H., and KM, A. Limit-cycle proliferation under parametric delayed feedback in a conductance-based neuron: Bifurcation landscape, orbit catalog, and capacity analysis. PMC, 2026. doi:10.3390/e28060678

    2026 doi

  103. [111]

    F-transformer: a federated transformer for efficient and privacy-preserving sequence generation

    N, P., S, B., F, R., O, V., A, N., T, V., NK, J., S, T., and A, A. F-transformer: a federated transformer for efficient and privacy-preserving sequence generation. PMC, 2026. doi:10.1038/s41598-026-40881-0

    2026 doi

  104. [112]

    Attention is all you need for kv cache in diffusion llms

    Nguyen-Tri, Q., Ranjan, M., and Shen, Z. Attention is all you need for kv cache in diffusion llms. arXiv preprint, 2025

    2025

  105. [113]

    and Yu, Q

    Pandey, D. and Yu, Q. Learn to accumulate evidence from all training samples: Theory and practice. arXiv preprint, 2023

    2023

  106. [114]

    and Joshi, I

    Patel, I. and Joshi, I. Polykv: A shared asymmetrically-compressed kv cache pool for multi-agent llm inference. arXiv preprint, 2026. doi:10.5281/zenodo.19686729

    2026 doi

  107. [115]

    Knowledge packs: Zero-token knowledge delivery via kv cache injection

    Pustovit, A. Knowledge packs: Zero-token knowledge delivery via kv cache injection. arXiv preprint, 2026

    2026

  108. [116]

    Swiftkv: Fast prefill-optimized inference with knowledge-preserving model transformation

    Qiao, A., Yao, Z., Rajbhandari, S., and He, Y. Swiftkv: Fast prefill-optimized inference with knowledge-preserving model transformation. Journal, 2025. doi:10.18653/v1/2025.emnlp-main.1306

    2025 doi

  109. [117]

    Mooncake: A kvcache-centric disaggregated architecture for llm serving

    Qin, R., Li, Z., He, W., Zhang, M., Wu, Y., Zheng, W., and Xu, X. Mooncake: A kvcache-centric disaggregated architecture for llm serving. Journal, 2024. doi:10.48550/arxiv.2407.00079

    2024 doi arXiv

  110. [118]

    Hack++: Towards more effective head-aware key-value compression for efficient visual autoregressive modeling

    Qin, Z., Jiang, Y., Lin, M., Lv, Y., Guo, H., Fei, W., and Lin, W. Hack++: Towards more effective head-aware key-value compression for efficient visual autoregressive modeling. Preprint, 2026

    2026

  111. [119]

    Ray, D., Pinti, O., and Oberai, A. A. Deep learning and computational physics (lecture notes). arXiv preprint, 2023

    2023

  112. [120]

    and F, R.-S

    RJ, C. and F, R.-S. Structural optimization principles for edge ai in motorsport telemetry. PMC, 2026. doi:10.1038/s41598-026-49736-0

    2026 doi

  113. [121]

    Green prompt engineering for sustainable generative ai

    S, P., H, D., and S, M. Green prompt engineering for sustainable generative ai. PMC, 2026. doi:10.1016/j.ese.2026.100684

    2026 doi

  114. [122]

    Eigen attention: Attention in low-rank space for kv cache compression

    Saxena, U., Saha, G., Choudhary, S., and Roy, K. Eigen attention: Attention in low-rank space for kv cache compression. Journal, 2024. doi:10.18653/v1/2024.findings-emnlp.899

    2024 doi

  115. [123]

    The kv4 trade-off is workload-dependent: A depth-and workload-resolved study of 4-bit kv-cache quantization on a 4 gb turing gpu

    Slothouber, C. The kv4 trade-off is workload-dependent: A depth-and workload-resolved study of 4-bit kv-cache quantization on a 4 gb turing gpu. Journal, 2026. doi:10.2139/ssrn.6941538

    2026 doi

  116. [124]

    Spindlekv: A novel kv cache reduction method balancing both shallow and deep layers

    Tang, Z., Luohe, S., Li, Z., Qi, B., Guoming, L., Zhang, L., and Wang, P. Spindlekv: A novel kv cache reduction method balancing both shallow and deep layers. Journal, 2025. doi:10.18653/v1/2025.acl-long.1380

    2025 doi

  117. [125]

    How much cache does reasoning need? depth-cache tradeoffs in kv-compressed transformers

    Wang, X. How much cache does reasoning need? depth-cache tradeoffs in kv-compressed transformers. Preprint, 2026. doi:10.48550/arXiv.2604.17935

    2026 doi arXiv

  118. [126]

    Model tells you where to merge: Adaptive kv cache merging for llms on long-context tasks

    Wang, Z., Jin, B., Yu, Z., and Zhang, M. Model tells you where to merge: Adaptive kv cache merging for llms on long-context tasks. Journal, 2024. doi:10.48550/arxiv.2407.08454

    2024 doi arXiv

  119. [127]

    Sub-token routing for kv cache compression

    Wei, id\_orcid 0009-0003-9914-2657 Jiang, and Wang, W. Sub-token routing for kv cache compression. Journal, 2026

    2026

  120. [128]

    Ss-adamoe: Spatio-spectral adaptive mixture of experts with global structural priors for graph node classification

    X, K., T, Y., L, W., Y, G., and F, Z. Ss-adamoe: Spatio-spectral adaptive mixture of experts with global structural priors for graph node classification. PMC, 2026 a . doi:10.3390/e28030355

    2026 doi

  121. [129]

    Towards sustainable ai knowledge-base assistants in computer science education: on-premise deployment and optimization with open educational resources

    X, S., L, F., S, H., D, L., Z, X., and B, L. Towards sustainable ai knowledge-base assistants in computer science education: on-premise deployment and optimization with open educational resources. PMC, 2026 b . doi:10.3389/fpsyg.2026.1843444

    2026 doi

  122. [130]

    Compute-in-memory implementation of state space models for event sequence processing

    X, Z., M, H., S, L., S, K., EY, L., Y, L., and WD, L. Compute-in-memory implementation of state space models for event sequence processing. PMC, 2026 c . doi:10.1038/s41467-025-68227-w

    2026 doi

  123. [131]

    Chunkkv: Semantic-preserving kv cache compression for efficient long-context llm inference

    Xiang, L., Tang, Z., Dong, P., Li, Z., Liu, Y., Li, B., Hu, X., and Chu, X. Chunkkv: Semantic-preserving kv cache compression for efficient long-context llm inference. Journal, 2025. doi:10.48550/arxiv.2502.00299

    2025 doi

  124. [132]

    H., Zhang, Y., Neubig, G., and Bertsch, A

    Xiao, E., Li, C. H., Zhang, Y., Neubig, G., and Bertsch, A. Efficient many-shot in-context learning with dynamic block-sparse attention. Journal, 2025. doi:10.18653/v1/2025.acl-long.1542

    2025 doi

  125. [133]

    U., Ma, L., Fang, Y., Engineer, Z

    Xie, R., Haq, A. U., Ma, L., Fang, Y., Engineer, Z. B., Liu, L., and Zhang, T. Reimagining memory access for llm inference: Compression-aware memory controller design. Preprint, 2025. doi:10.48550/arXiv.2503.18869

    2025 doi arXiv

  126. [134]

    Infrared imaging for autonomous power inspection: A review from detector to system integration

    Y, G., Y, D., R, M., Y, Z., and J, G. Infrared imaging for autonomous power inspection: A review from detector to system integration. PMC, 2026. doi:10.3390/s26113552

    2026 doi

  127. [135]

    Hcattention: Extreme kv cache compression via heterogeneous attention computing for llms

    Yang, D., Yang, Y., Yu, X., Qi, X., and Xiao, R. Hcattention: Extreme kv cache compression via heterogeneous attention computing for llms. Journal, 2025. doi:10.2139/ssrn.5403127

    2025 doi

  128. [136]

    Hcattention: Extreme kv cache compression via heterogeneous attention computing for llms

    Yang, D., Yang, Y., Yu, X., Qi, X., and Xiao, R. Hcattention: Extreme kv cache compression via heterogeneous attention computing for llms. Journal, 2026. doi:10.1016/j.neucom.2026.134247

    2026 doi

  129. [137]

    Kvsharer: Efficient inference via layer-wise dissimilar kv cache sharing

    Yang, Y., Cao, Z., Chen, Q., Qin, L., Yang, D., Zhao, H., and Chen, Z. Kvsharer: Efficient inference via layer-wise dissimilar kv cache sharing. Journal, 2024 a . doi:10.48550/arxiv.2410.18517

    2024 doi arXiv

  130. [138]

    Lossless kv cache compression to 2\ Journal, 2024 b

    Yang, Z., Han, J., Wu, K., Xie, R., Wang, A., Sun, X., and Kang, Z. Lossless kv cache compression to 2\ Journal, 2024 b . doi:10.48550/arxiv.2410.15252

    2024 doi arXiv

  131. [139]

    N., Wu, K., Xie, R., Wang, A., Sun, X., and Kang, Z

    Yang, Z., Han, J. N., Wu, K., Xie, R., Wang, A., Sun, X., and Kang, Z. Lossless kv cache compression to 2\ arXiv preprint, 2024 c

    2024

  132. [140]

    Tailorkv: A hybrid framework for long-context inference via tailored kv cache optimization

    Yao, D., Shen, B., Lin, Z., Liu, W., Luan, J., Wang, B., and Wang, W. Tailorkv: A hybrid framework for long-context inference via tailored kv cache optimization. Journal, 2025. doi:10.18653/v1/2025.findings-acl.1043

    2025 doi

  133. [141]

    and Chai, Y

    Yu, B. and Chai, Y. Evolkv: Evolutionary kv cache compression for llm inference. Journal, 2025 a . doi:10.18653/v1/2025.findings-emnlp.88

    2025 doi

  134. [142]

    and Chai, Y

    Yu, B. and Chai, Y. Evolkv: Evolutionary kv cache compression for llm inference. arXiv preprint, 2025 b

    2025

  135. [143]

    Large-scale model-enhanced vision-language navigation: Recent advances, practical applications, and future challenges

    Z, L., X, M., X, H., Y, Z., and W, Y. Large-scale model-enhanced vision-language navigation: Recent advances, practical applications, and future challenges. PMC, 2026. doi:10.3390/s26072022

    2026 doi

  136. [144]

    Kilohertz volumetric imaging of in vivo dynamics using squeezed light field microscopy

    Z, W., R, Z., DA, W., D, E., L, S., O, B., W, K., E, Z., CK, L., WC, S., A, P., J, W., GCL, W., R, L., S, L., MZ, L., M, K., P, G., TK, H., and L, G. Kilohertz volumetric imaging of in vivo dynamics using squeezed light field microscopy. PMC, 2025. doi:10.1038/s41592-025-02843-8

    2025 doi

  137. [145]

    More tokens, lower precision: Towards the optimal token-precision trade-off in kv cache compression

    Zhang, J., Zhu, D., Song, Y., Wu, W., Kuang, C., Li, X., Shang, L., Liu, Q., and Li, S. More tokens, lower precision: Towards the optimal token-precision trade-off in kv cache compression. Preprint, 2024. doi:10.48550/arXiv.2412.12706

    2024 doi arXiv

  138. [146]

    Enhancing large multimodal models with adaptive sparsity and kv cache compression

    Zhang, T., Li, Y., Wang, J., and Li, L. Enhancing large multimodal models with adaptive sparsity and kv cache compression. Journal, 2025. doi:10.1109/icme59968.2025.11209796

    2025 doi

Pith tools

Reviewed July 8, 2026 · model on record in the stance chip above.