- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
ConsistKV aims to maintain visual consistency in interactive video world models within a fixed active KV budget. It learns an action–content retriever from generated mirror-retracing trajectories, compresses historical KV chunks through key selection and value absorption, and places selected chunks alongside an initial anchor and recent states. Experiments on Matrix-Game 2.0 and ABot-World show improved consistency on scored revisits over fixed-budget baselines. The quantitative evidence chiefly concerns returns to the same or nearby action-derived poses.
Critical strengths
- The method reuses the backbone’s own KV states and adapts their positions when recalling them, without retraining the generator or enlarging its active attention window (Equation 12; Appendix A.1). Its gains on both backbones (Table 1) make this a useful inference-time system design.
- Value absorption leaves retained keys addressable while carrying information from discarded positions. Its fixed-retrieval ablation improves revisit fidelity over selection alone (Table 2), supporting the practical value of this compression choice.
Critical weaknesses
- The need for ACE’s learned fusion is not established. With compression fixed, ACE improves average PSNR over action retrieval by only 0.05 dB on the main MG benchmark and is slightly worse on Complex (Table 2). Its gains on cross-path and 12-lap tests are encouraging, so this is not a claim that ACE has no benefit. The missing comparison is with simple action–content score fusion and a learned action-only encoder under matched conditions. The current comparisons cannot establish whether visual content supplies the claimed correspondence, or whether ACE mainly learns a better geometric score. Moreover, Its visual query describes chunk but is assigned zero relative geometry at destination (Equation 5), a potentially misleading approximation after substantial motion.
- The specific benefit of shared-Gram value absorption over simpler transfer rules remains unclear. Absorption improves the no-absorption ablation, but adapted PyramidKV nearly matches its average PSNR (14.49 versus 14.54) and has better LPIPS at the same retained-position budget (Table 15). Moreover, Equations 8–11 favor keys representative of their chunk and mix discarded values into retained addresses without conditioning on the future query. Distinctive but rare scene details may therefore be lost or blurred. The average ablation demonstrates a benefit, but does not establish preservation of query-relevant memory.
- The evaluated form of long-term memory is narrower than reuse of a scene from a new viewpoint. ACE is trained on mirror-retracing loops from eight initial images (Appendix A.2). The main tests repeat or retrace paths; the non-retraced paths in Appendix E still score visits near an earlier action-integrated pose. These experiments support consistency on same- or near-pose revisits, but do not establish whether ACE can retrieve useful history when an old scene is seen from a substantially different viewpoint.
- The effect of always-on retrieval when history is irrelevant remains unknown. Memory delivery reserves space for six historical chunks while retaining only one or two recent native chunks (Equation 12). This may reduce the context available for current motion on trajectories without a useful historical match. Figure 6 provides qualitative non-revisit examples, but a same-budget quantitative comparison with recent-context or adaptive retrieval is needed to establish this trade-off.
Questions for authors
- Under matched training data, retrieval size, compression, and inference budget, how does ACE compare with a same-capacity learned geometry-only encoder and calibrated action-plus-content score fusion? Please report paired results by trajectory type, including cases where the cues disagree and cases with large turns. If feasible, it would be helpful to include a few ACE retrieval visualizations, particularly cases where action-derived geometry and visual appearance favor different historical chunks.
- With the retained key positions fixed, how does Equation 11 compare with nearest-key or normalized-average value transfer?
- Can you evaluate re-observation of a known scene from a new viewpoint when no near-pose historical frame exists? Please use verified visual overlap rather than unaligned pixel similarity, and show the query, ranked retrieved frames, and generated result for representative successes and failures.
- On trajectories without near-pose revisits, how does always-on retrieval compare with a same-budget recent-context baseline or an adaptive retrieval policy in action adherence, scene continuity, and runtime?