- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes StaMina, a state-maintenance framework for causal video counting. The method combines a Qwen3-VL backbone with gated delta memory, an explicit object-identity and visibility registry, and operator-specific finite-state event transitions. A count-constrained forward recurrence marginalizes over legal event-state trajectories compatible with observed count endpoints, while auxiliary identity and boundary losses exploit stronger supervision where available. The authors construct a multi-source training pool containing 53.6K query–answer pairs, including 39.8K spatial queries and complementary event annotations.
On SVCBench, StaMina-4B/8B obtains 41.9/44.9 GPA under Full access and 36.4/38.2 under Stream access. The 8B model improves over Counting-SFT by 10.9/3.2 GPA points on shared counting queries. The paper further presents controlled transition-learning ablations, object-identity diagnostics, transfer evaluations on OVO-Bench and OVO-S-Bench, and count-conditioned action-predicate experiments.
Critical strengths
-
A useful and well-motivated problem formulation. The paper explicitly distinguishes visibility changes, persistent object identities, and completed-event updates. This decomposition is appropriate for causal counting, where repeated observations should not automatically trigger new counts. The proposed typed state and separate object/event branches provide a coherent way to represent these distinctions.
-
Substantial effort toward controlled evaluation. The paper goes beyond final-answer accuracy by examining hard-prefix correctness, duplicate and missed event updates, acceptance delay, and identity-association errors. The matched-graph transition comparisons help isolate the contributions of phase conditioning and trajectory supervision. The data-provenance and supervision-family exclusion procedures are also more careful than a simple query-level split.
Critical weaknesses
- The problem is meaningful, and the state representation is well motivated.
The paper explicitly distinguishes object visibility, persistent object identity, and event completion. This distinction is important for continuous video counting, where repeated observations of the same object should not trigger duplicate counts, while event counting requires determining whether an action has actually completed. Explicit state representation and state-conditioned updates provide a clear and potentially useful formulation of these challenges.
- The evaluation includes useful mechanism-level diagnostics.
Beyond final-answer accuracy, the authors examine state-transition decisions, duplicate and missed event updates, identity-association errors, and acceptance delay. Controlled ablations investigate the contributions of phase conditioning and trajectory supervision. The paper also provides a relatively detailed account of training-data provenance and the exclusion of linked supervision. These analyses help characterize the system's behavior and failure modes.
Questions for authors
- What is the core algorithmic novelty of this work?
Compared with existing finite-state models, sequence-path marginalization methods, and streaming state-maintenance approaches, what is fundamentally new about StaMina's learning mechanism? The experiments show that individual components are useful, but how do the authors establish that their combination constitutes a genuinely new method rather than an integration of existing techniques?
- How do the authors rule out the influence of visual exposure to overlapping videos?
Given that some training parent groups overlap with SVCBench, can the authors report results separately for overlapping and non-overlapping videos, as well as an evaluation with strict source-video separation? What forms of information leakage are prevented by supervision-family exclusion, and what information may still be exploited through exposure to the same visual content?
- How do the structural reachability limits of periodic events affect the conclusions?
The paper reports upper coverage bounds of 44.3% and 58.2% for periodic-event endpoints under Full and Stream access, respectively. Can the authors report performance on endpoints reachable under the current observation budget and transition rules, and distinguish failures caused by architectural constraints from those caused by perception or transition-prediction errors?
- Why is each observation restricted to at most one state transition?
How does the method handle multiple events occurring between consecutive observations? In scenarios with sparse sampling, rapid events, or overlapping events, could the single-transition assumption systematically underestimate event counts? Under what conditions is this assumption appropriate?
- Are the comparisons with existing models sufficiently fair?
The external reference models retain their original evaluation protocols, whereas StaMina receives task-specific counting adaptation. Can the authors provide a unified comparison of key baselines under matched training data, task-adaptation conditions, and input budgets? How much of the observed improvement can be attributed to state maintenance itself rather than additional task-specific training?
- Is the automatic annotation pipeline sufficiently reliable to support the proposed training method?
The paper reports an increment-label accuracy of 85.4% for natural events. Can the authors provide more details on the annotation models, prompts, filtering criteria, and manual verification procedures, and analyze how annotation errors affect trajectory supervision, transition learning, and final counting performance? In particular, is the available supervision sufficiently reliable to support the claimed learning of fine-grained event-completion states?