AI was used to rephrase/polish wording. The reviewer wrote the original assessment from scratch and reviewed the final wording.
Original reviewer-written assessment supplied as input:
Flag For Ethics Review
No.
Critical Weaknesses
-
The current evidence does not separate the contribution of the structure-guided capacity controller from that of simply using a smaller search budget. In the main setting, capacity varies only within the narrow interval from 3L/16 to L/4. The rank-reversed control is informative: on the diagnostic cohort, it reduces LongBench quality by 1.33 points while doing slightly more candidate work. On LongMemEval, however, accuracy is unchanged, and the average capacity perturbation there amounts to only 1.8%. Nor is rank reversal the most practical alternative to the controller. What is centrally missing is a comparison against a request-independent capacity set to match the work ASIR actually performs, under the same reuse policy. Without it, the paper shows that ASIR is an effective configuration, but it shows less clearly that native structure is needed for its quality–efficiency advantage.
-
The evidence on deployment and quality is narrower than the agent-oriented motivation. Quality is evaluated on only one checkpoint, and speed is obtained by replaying native query/key traces at batch size one on a single H20. This demonstrates an optimization of the Indexer, but not the latency benefit actually realized once sparse attention, prefill, and full-model execution are taken into account. In addition, similar aggregate quality masks large differences: with reuse added, DuReader drops from 34.03 to 24.45, whereas Qasper rises from 31.55 to 37.80. Appendix A.4 further indicates that the subsets used to choose the refresh interval are part of the full evaluation. None of this invalidates the operator measurements, but it does weaken the claim that the chosen policy reliably maintains quality on unseen agent workloads.
Questions For Authors
- How does ASIR compare, at matched mean candidate work, with a fixed-capacity HISA variant that uses the same block-local reuse policy? The answer would bear directly on my assessment of the structure-guided controller.
- For the same configurations evaluated for quality, could you report full-model time per output token, with capacity initialization included? What share of the Indexer gain persists outside the replay benchmark?
- Could the refresh policy be evaluated on examples held out from its development subsets, with paired uncertainty estimates and a breakdown of the large loss on DuReader?
Rating
2: Weak rejection.
I place this paper slightly below the acceptance threshold. The mechanism for maintaining block-local candidates is reasonable, and the Indexer gains are credibly measured. My reservations concern two points: the comparison against a simpler matched-work controller is incomplete, and there is limited evidence that the chosen configuration maintains quality and improves full-model latency beyond the development workload. Adding a matched-work baseline and a held-out end-to-end evaluation could change this assessment materially.
Soundness
2: I have minor or fixable concerns about the paper’s soundness.
Paper Summary
ASIR addresses the expense of building the token support used by native sparse attention. It pairs a controller that sets candidate capacity per request with reuse of candidates within local blocks. In the prefill stage, native segment boundaries and request-conditioned Indexer scores are used to estimate how widely the relevant evidence is spread, and a candidate capacity is then fixed for each layer. In the decoding stage, the current query chooses a block route: certain blocks expose every token, whereas others supply positions selected earlier. The current query then rescores every resulting candidate. Evaluated on Keye-VL-2.0-30B-A3B, ASIR reaches LongBench and LongMemEval aggregate scores near those of HISA-L/4, and it speeds up the full decoding-time Indexer by 2.23–4.39× relative to native selection and by 1.11–1.59× relative to HISA-L/4. What these results support is lowering the work spent on candidate discovery under a fixed final attention budget; they do not yet establish an end-to-end speedup for agents.
Presentation
3: Clear and easy to follow.
Critical Strengths
-
Separating region routing from candidate renewal is a useful idea with a clear operational meaning. A block that remains relevant does not need to be fully scanned at each decoding step. ASIR keeps historical positions only within the current route; blocks that are new or lack history are opened at once, older regions are revisited periodically, and the current query reranks every candidate. This offers a concrete way to benefit from temporal stability without mistaking stale relevance scores for current evidence.
-
The operator evaluation accounts for meaningful implementation costs and reveals boundary cases. Routing, candidate construction, selection, mapping, and history maintenance are all inside the timed Indexer. At 64K, ASIR reduces latency to 20.37 μs, compared with 31.25 μs for HISA-L/4. The authors further report that at 16K reuse runs slightly slower than capacity adaptation by itself, quantify the one-time cost of constructing the signal, and include a rank-reversed capacity control. Such details give the systems result more credibility than a speedup measured on token scoring alone.
Informativeness
2: I learned something interesting or useful.