- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes GraphMem, a training-free memory framework for autoregressive video world models. It organizes historical keyframes into a graph, retrieves relevant views, and converts them into native history KV caches through a frozen diffusion backbone.
Critical strengths
- The method addresses a clear limitation of rolling context windows: recovering previously observed scenes after long temporal gaps smartly.
- Integration across five frozen backbones showcases the approach’s applicability and generalization.
- The paired comparisons show consistent improvements on the three reported memory metrics, and the qualitative examples illustrate the intended behavior.
Critical weaknesses
- Tab. 2 compares against queue and temporal/spatial banks, but their retrieval procedures and budget matching are not sufficiently discussed in main paper. A particularly important baseline is flat retrieval using the same pose filtering, visual descriptors, diversity selection, adaptive budget, and KV prefill, etc. w/o this comparison, it is difficult to tell the gains come from graph rather than better candidate selection and additional historical context.
- In Tab.1, the reported results lack uncertainty est. or per-traj. distributions, making their robustness difficult to assess. The main content provides limited definitions of three memory metrics. Their sensitivity, e.g., pose mismatch, appearance similarity, and genuine scene reconstruction, etc., needs clarification.
- The efficiency claim is only partially supported in the main paper. Although the active attention context is useful, the total inference cost also includes history prefill, descriptor extraction, retrieval, and graph maintenance. The external memory continues to grow. E2E latency, memory consumption, and scaling with rollout length are necessary to assess the practical advantage.
- quality trade-offs require clearer discussion. Although memory scores improve, subject consistency and dynamic degree decrease for several backbones, and I2V scores show mixed changes. This suggests a trade-off between historical consistency and other aspects of generation that should be analyzed carefully.
Questions for authors
- How does GraphMem compare with flat pose-and-appearance retrieval using identical selection, context budgets, and KV prefill , etc.?
- Are the gains robust across trajectories and generation seeds?
- What are the e2e latency and memory costs at matched context budgets?