W1. The practical JACAP score is not sufficiently justified as an approximation to the proposed Jacobian Information Capacity.
The central theoretical contribution is the exact softmax Jacobian, which contains both diagonal sensitivity terms and off-diagonal competition terms.
However, the practical algorithm replaces this matrix with its diagonal approximation and further diagonalizes the query-response covariance. These approximations remove the cross-token interactions that are central to the motivation for introducing the nonlinear softmax formulation.
More importantly, the resulting approximation does not necessarily preserve fundamental properties of the exact Jacobian. For example, when all retained value-induced output vectors are identical, the attention output is independent of the query, and the exact Jacobian Information Capacity is zero. Nevertheless, the diagonal approximation can assign positive capacity contributions to individual tokens.
This counterexample suggests that the practical score is not uniformly faithful to the proposed information-capacity objective.
The authors should clarify the assumptions under which these approximations are valid and characterize their approximation errors. A direct empirical comparison between the proposed proxy and the exact local capacity on small candidate subsets would be particularly helpful.
W2. Maximizing retained information capacity is not necessarily equivalent to preserving the original attention computation.
Section 3.1 formulates KV-cache eviction as minimizing the expected discrepancy between full-cache and compressed-cache attention outputs.
However, the subsequent information-theoretic formulation maximizes the mutual information between future queries and the output of the retained attention channel.
These objectives are not generally equivalent. A retained subset may induce an attention mapping with high sensitivity to query variations, and therefore high local information capacity, while producing outputs that deviate substantially from those of the original full-cache model.
The paper currently provides insufficient theoretical or empirical evidence connecting the proposed capacity objective to the original attention-output approximation problem.
I would encourage the authors to investigate whether maximizing Jacobian Information Capacity correlates with lower attention-output reconstruction error, reduced output perturbation, or improved downstream accuracy across different retained subsets.
W3. The leverage-score selection procedure is not equivalent to greedy optimization of the subset-dependent objective.
The paper describes its selection procedure as being motivated by marginal contributions to a log-determinant objective.
However, JACAP constructs a single capacity matrix from the full candidate pool and ranks all tokens using fixed leverage scores computed from that matrix.
This differs from greedy log-determinant maximization, where marginal gains are recomputed after each selection using the currently selected subset.
Consequently, the proposed procedure should be characterized as a one-shot leverage-score heuristic rather than direct greedy optimization of the original subset objective.
The authors should clarify the relationship between full-pool leverage scores and true subset-dependent marginal gains. Comparisons with iterative greedy selection or approximate marginal-gain updates would help establish whether the proposed approximation preserves the intended diversity objective.
W4. The experimental evaluation lacks several strong recent KV-cache eviction baselines.
The main LongBench experiments compare JACAP primarily against CapKV, Expected Attention, KeyDiff, and KNorm.
However, stronger recent eviction methods such as CriticalKV and DefensiveKV are not included. These methods specifically investigate the relationship between token importance and attention-output preservation and are particularly relevant to the paper's proposed theoretical motivation.
Additionally, although SnapKV is mentioned among the experimental baselines and included in the NIAH evaluation, it does not appear in the main LongBench comparison table.
The absence of these baselines makes it difficult to assess the competitiveness of JACAP against the broader state of the art.
I would encourage the authors to include at least CriticalKV and DefensiveKV under matched retention budgets, model configurations, and evaluation protocols.
W5. The empirical superiority over CapKV is not consistent across compression ratios, and some claims are overstated.
The strongest improvements are concentrated at aggressive compression ratios.
At a compression ratio of 0.25, JACAP underperforms CapKV on all three evaluated models. Its advantage is also relatively small or inconsistent at a compression ratio of 0.5.
Furthermore, Section 4.1 states that JACAP exceeds the strongest baseline by approximately five points on average at a compression ratio of 0.9.
However, comparing against the strongest baseline for each model in Table 1 yields improvements of approximately 4.34, 5.06, and 1.09 points, corresponding to an average improvement of approximately 3.50 points.
The paper should distinguish improvements over CapKV from improvements over the strongest available baseline and avoid overstating the consistency of its results.
W6. Limited statistical validation and insufficiently isolated efficiency analysis.
The AIME25 evaluation contains only 30 problems, making the reported accuracy differences sensitive to a small number of questions.
For example, at a budget of 8192 tokens, JACAP achieves 0.53 accuracy compared with 0.73 for CapKV, a substantial difference that is not investigated further.
The paper does not provide sufficient multi-seed evaluation or uncertainty estimates to establish the robustness of the reported reasoning improvements.
The runtime evaluation also reports total generation time for 100 tokens, without separately measuring eviction-score computation, cache-update overhead, prefill latency, and decoding latency.
Since the proposed algorithm has a complexity of O(Nd_h² + d_h³) per eviction step, compared with the lower theoretical costs of several heuristic baselines, a more detailed efficiency breakdown is needed to establish its practical tradeoffs.
W7. The impact of the query-distribution approximation and temperature scaling remains insufficiently understood.
The theoretical formulation assumes a local Gaussian distribution of future queries, while the implementation estimates its statistics from historical queries.
The paper does not sufficiently investigate how accurately these statistics represent the future query distribution, particularly under distribution shifts or long reasoning trajectories.
Moreover, the practical method introduces a temperature parameter into the attention prior, with the reported optimum around τ=10. This substantially changes the attention distribution relative to the original softmax mechanism used in the theoretical derivation.
It remains unclear whether the observed gains primarily come from the proposed Jacobian-based sensitivity interpretation or from empirically smoothing the attention prior.
Additional controls using temperature-scaled CapKV, alternative query priors, and different covariance estimators would help clarify the mechanism.