- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces MORPH-V, a closed-loop framework for long-video question answering. Without updating the parameters of the underlying reasoning model, the framework distills observational capabilities, such as locating cited speech, tracking essential state slots, and organizing event timelines, into reusable programs. These programs are managed through a system involving coverage-guided acquisition, structural verification, and a persistent program library. For new inputs, the framework routes, grounds, and executes relevant programs to construct evidence for a frozen reasoning model.
Critical strengths
The framework establishes a clear, closed-loop pipeline, integrating program acquisition, structural verification, persistent storage, applicability-based routing, and grounded execution to support a frozen reasoner’s predictions.
By selecting programs based on structural trajectories, coverage, and declarative checks, the approach mitigates the risk of answer-label leakage and adheres to the design constraint of accumulating observational capabilities without parameter updates.
Critical weaknesses
The method relies on a fixed taxonomy of observation types, a registry of typed primitives, and predefined structural objectives. Since the program space and applicability conditions are externally defined, the generalization boundaries in open-ended scenarios remain unclear.
Program acquisition and routing are highly sensitive to factors such as the monitoring of question structures, recurrence thresholds, applicability predicates, and priority settings. Changes to these thresholds or the underlying taxonomy could significantly alter coverage and reuse behavior.
Evidence for the growth of the program library is derived primarily from limited deterministic replays and open-ended compositional runs; the study lacks an assessment of variance and scalability that would involve multiple independent data-collection cycles, varied random seeds, and larger-scale program libraries.
Questions for authors
Please refer to the weaknesses.