- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies novel-to-recap video generation, aiming to produce self-contained recap videos with narration and generated visual content directly from novels under a prescribed duration constraint. To address the challenges of long-form narrative compression, duration allocation, and audiovisual alignment, the authors propose ReVi, a multi-agent framework consisting of an inner loop for video production and an outer loop for recursive policy improvement. In the inner loop, Story Mapper constructs a structured StoryGraph, Paper Editor selects and reorganizes narrative events, Radio Editor generates narration and uses text-to-speech (TTS) feedback to estimate actual speech duration, and AV Planner converts narration into dramatic beats and corresponding video-generation requests. The framework also incorporates error diagnosis and stage-specific repair. In the outer loop, ReVi iteratively revises both the editing policy and the meta-policy responsible for diagnosing failures, proposing policy updates, and allocating search resources. Experiments on FilmEval and Recap32 demonstrate improvements in recap quality and duration compliance over several baseline methods.
Critical strengths
The paper addresses a well-defined generation problem with practical relevance. Generating a concise audiovisual recap directly from a long novel requires coordinating narrative understanding, content selection, narration duration, and visual planning. The explicit duration constraint makes the task more concrete than unconstrained text-to-video generation.
Rather than directly prompting a video generator with the entire novel, ReVi separates narrative planning, editing, narration, and visual generation into distinct stages. The use of measured TTS duration, dramatic-beat-based planning, and stage-specific repair provides a coherent workflow for addressing different types of generation failures.
The experimental evaluation covers several relevant aspects of the framework. In particular, the component ablations provide preliminary evidence that duration feedback, beat planning, and repair routing contribute to system performance. The outer-loop experiments also suggest that revising reusable editing policies can improve generation quality beyond using a frozen policy.
Critical weaknesses
The novelty of the proposed components is not sufficiently clear. StoryGraph, structured plot editing, TTS-based duration adjustment, and dramatic-beat planning are reasonable design choices, but the paper does not clearly distinguish them from existing approaches to summarization and agent-based video generation. The authors should clarify what new technical capabilities these components provide beyond integrating existing techniques.
The outer-loop optimization is the most interesting part of the paper, but its contribution remains unclear. Promptbreeder and GEPA have already explored iterative prompt optimization and feedback-driven improvement. The authors should explain what distinguishes ReVi's dual-loop mechanism from these methods and what specific advantage the meta-policy provides.
The outer-loop experiments do not adequately establish the benefit of the proposed optimization strategy. The two optimization settings evaluate different numbers of candidates (147 versus 195), making it difficult to separate the contribution of the meta-policy from the effect of a larger search budget. A comparison with an existing prompt optimizer under comparable evaluation budgets would provide stronger evidence.
The use of the Recap32 test novels in the outer-loop experiments needs clarification. Although N01–N12 are designated as test novels, Appendix D.3 reports iterative search results on six of them. The authors should clarify whether these results influenced policy selection or promotion. If they did, the final evaluation may not be independent.
The baseline comparison does not isolate the contribution of recursive policy optimization. ReVi achieves 100% duration compliance, while all reported baselines achieve 0%, but ReVi also employs explicit duration allocation, TTS feedback, and repair. A comparison under a shared duration-control setup would help determine how much improvement comes from these mechanisms versus the proposed optimization framework. The reported cost analysis should also account for offline policy-search costs.
Questions for authors
1、What are the specific methodological differences between ReVi's dual-loop optimization and existing approaches such as Promptbreeder and GEPA? Which components of the optimization procedure constitute genuinely new mechanisms rather than task-specific adaptations? 2、Does the improvement from meta-policy optimization remain when ReVi is compared with an existing prompt optimizer under the same candidate-evaluation budget and comparable computational costs? 3、Were N02, N04, N06, N08, N10, and N12 used exclusively for evaluation, or did their results influence policy selection or promotion during the outer-loop experiments? How was the independence of the final test evaluation maintained? 4、How were the automatic evaluation metrics validated? Can the authors provide additional human-evaluation results to establish the reliability of the reported quality improvements? 5、After including the computational costs of offline policy search and meta-policy evaluation, does ReVi retain a meaningful quality–cost advantage over the baselines?
11 comments
Response to Reviewer pM8W [2/7]
[W2] The outer-loop optimization is the most interesting part of the paper, but its contribution remains unclear. Promptbreeder and GEPA have already explored iterative prompt optimization and feedback-driven improvement. The authors should explain what distinguishes ReVi's dual-loop mechanism from these methods and what specific advantage the meta-policy provides.
Response: We thank the reviewer for finding the outer loop the most interesting part of the paper. The concerns center on how ReVi's dual loop differs from Promptbreeder and GEPA, and what the meta policy adds. We try to address each concern below.
W2-1. Promptbreeder and GEPA have already explored iterative prompt optimization and feedback-driven improvement. The authors should explain what distinguishes ReVi's dual-loop mechanism from these methods.
A2-1. ReVi builds on both methods and cites them: its editing-policy search adopts GEPA's natural-language reflection on execution traces [Agrawal et al., 2026], and its meta level adopts Promptbreeder's idea that the improvement procedure can itself be improved [Fernando et al., 2024]. ReVi goes beyond both in three respects.
(1) ReVi makes the allocation of the search budget learnable. Promptbreeder evolves how to mutate a prompt, and GEPA runs a fixed reflection procedure. Neither lets the system learn where to spend its evaluation budget. In ReVi, the meta policy contains diagnosis rules, proposal rules, and budget-allocation rules, and all three can be revised. An accepted meta policy can, for example, favour testing alternative Paper Edits over repeated video generation. This matters for video generation, where one rendered evaluation costs dollars rather than tokens, so where the budget goes changes the outcome as much as how each candidate is written.
(2) ReVi judges an improvement procedure by the whole search it produces. Promptbreeder scores a mutation prompt through the fitness of the single offspring it produces. ReVi evaluates a candidate meta policy over a complete episode: the parent editor, the production traces, the improvement history, and the search budget are fixed, the candidate runs a full editor search, and it is scored by the improvement of the resulting editor on held-out novels (Eq. 4). A meta policy is therefore rewarded for making the search more productive, not for one lucky mutation.
(3) ReVi attributes each failure to the stage that caused it. GEPA reflects on each module's own trace, so a misaligned visual is explained at the visual stage. ReVi's artifacts are source-linked across all stages, so the meta policy can trace that symptom to its cause, for example insufficient screen time allocated by the Radio Editor, and patch the allocation rule instead. A per-video failure thus becomes a reusable rule change at the right stage.
| Aspect | Promptbreeder | GEPA | ReVi |
|---|---|---|---|
| Editable improvement procedure | Mutation prompts | Fixed | Diagnosis, proposal, and budget-allocation rules |
| How the procedure is judged | Fitness of its offspring | — | Improvement produced by a complete, budget-matched search |
| Failure attribution | None | Per module | Earliest responsible stage, through source links |
| Acceptance | Tournament selection | Pareto frontier over instances | Frozen kernel with hard constraints |
W2-2. What specific advantage the meta-policy provides.
A2-2. The meta policy roughly doubles the gain of the outer loop at the same cost. In the ten paired runs of Appendix D.3, editing-policy revision raises by +2.26 over Frozen, and adding meta-policy revision raises it to +4.47. The meta-policy term is positive in all ten runs, by 1.67 to 2.60 points, and it improves all three dimensions (+2.22 RF, +1.99 NP, +2.41 AVG). The two conditions spend within about one dollar per run of each other, and the matched-candidate experiment in A3-1 shows that the gain does not come from evaluating more candidates.
Response to Reviewer pM8W [3/7]
[W3] The outer-loop experiments do not adequately establish the benefit of the proposed optimization strategy. The two optimization settings evaluate different numbers of candidates (147 versus 195), making it difficult to separate the contribution of the meta-policy from the effect of a larger search budget. A comparison with an existing prompt optimizer under comparable evaluation budgets would provide stronger evidence.
Response: We thank the reviewer for this important comment. The concerns center on whether the meta-policy gain comes from a larger number of candidates, and how ReVi compares with an existing prompt optimizer under a comparable budget. We try to address each concern below.
W3-1. The two optimization settings evaluate different numbers of candidates (147 versus 195), making it difficult to separate the contribution of the meta-policy from the effect of a larger search budget.
A3-1. We first explain where the difference comes from, and then add an experiment with the same number of candidates.
(a) Why the counts differ. The 195 candidates of Editing-Policy + Meta-Policy are 149 editing-policy candidates plus 46 meta-policy candidates, while Editing-Policy evaluates 147 editing-policy candidates. The two conditions therefore test almost the same number of editors; the extra 46 candidates are proposals for the improvement procedure itself. They also cost little. During the search, each candidate is screened at the plan level without rendering video, and after each round the promoted policy is rendered once on each of the six search novels. Both conditions therefore render the same 30 recaps per run, and rendering dominates the cost.
| Rounds completed | 1 | 2 | 3 | 4 | 5 |
|---|---|---|---|---|---|
| Editing-Policy: total cost per run (USD) | 35.01 | 69.44 | 102.84 | 137.24 | 172.54 |
| Editing-Policy + Meta-Policy: total cost per run (USD) | 34.08 | 68.39 | 102.74 | 137.95 | 173.47 |
As shown in the table, the two conditions differ by at most $1.05 per run at any round, including the cost of all 46 meta-policy candidates.
(b) An experiment with the same number of candidates. To remove the remaining difference, we rerun Editing-Policy with its candidate budget raised to that of the meta-policy condition. Specifically, each of the ten Editing-Policy runs is given the same number of editing-policy candidates as its paired Editing-Policy + Meta-Policy run (195 in total), with the same search procedure, kernel, acceptance rule, and six search novels. The Frozen and Editing-Policy + Meta-Policy results are reused from Appendix D.3.
| Condition | Candidates (10 runs) | RF | NP | AVG | ΔQ vs. Frozen |
|---|---|---|---|---|---|
| Frozen | 0 | 91.05 | 88.56 | 82.87 | — |
| Editing-Policy (Appendix D.3) | 147 | 93.24 | 91.05 | 84.97 | +2.26 |
| Editing-Policy, matched candidates | 195 | 93.27 | 91.35 | 85.00 | +2.38 |
| Editing-Policy + Meta-Policy (Appendix D.3) | 195 | 95.46 | 93.05 | 87.38 | +4.47 |
As shown in the table, giving the editing-policy search 48 more candidates raises its gain only to +2.38, well below the +4.47 of the meta-policy condition at the same candidate count. The meta-policy gain therefore does not come from a larger search budget: the extra candidates help little when the improvement procedure stays fixed, while a revised procedure makes the same number of candidates more productive.
W3-2. A comparison with an existing prompt optimizer under comparable evaluation budgets would provide stronger evidence.
A3-2. We agree. We would like to clarify that ReVi's editing-policy search already adopts GEPA-style reflective mutation [Agrawal et al., 2026] (Section 2.2): it reads production traces and critic reports, diagnoses failures in natural language, and proposes revised instructions. The two outer-loop conditions therefore differ from GEPA in a well-defined way.
| Component | GEPA | Editing-Policy | Editing-Policy + Meta-Policy (ReVi) |
|---|---|---|---|
| Reflective mutation on traces | ✓ | ✓ | ✓ |
| Candidate selection | Pareto frontier and merge | Kernel promotion | Kernel promotion |
| Editable improvement procedure | ✗ | ✗ | ✓ |
As shown in the table, the matched-candidate comparison in A3-1 changes only the last row, so it measures exactly what a fixed reflective optimizer lacks. GEPA's Pareto selection concerns a different component and is complementary to the meta level; it could serve, for example, as the editor-selection rule inside each meta-policy episode.
Response to Reviewer pM8W [1/7]
We sincerely thank the reviewer for the careful reading and the constructive comments. We thank the reviewer for recognizing the practical relevance of the novel-to-recap task, the coherent separation of narrative planning, editing, narration, and visual generation, the use of measured TTS duration, dramatic-beat planning, and stage-specific repair, and the evidence from both the component ablations and the outer-loop experiments.
Response: We thank the reviewer for this comment. We agree that the paper should state what each component makes possible, not only how it is built. Existing summarization methods decide what to keep, and existing agentic video pipelines decide how to show a given script. Novel-to-recap generation requires deciding what to keep, how long to tell it, and what to show jointly under a fixed runtime, and each ReVi component supplies one capability that this joint decision needs. We address the concern from two perspectives.
(a) Capability comparison with existing systems. The table compares ReVi with all baselines of the main comparison. For ReVi, the mechanism that provides each capability is given in parentheses.
The capabilities are defined as follows.
Hierarchical summarization methods (e.g., BookSum-style chapter-to-book summaries) share the first step with ReVi, but they select by salience, with no runtime budget and no check that the retained events remain causally closed.
(b) Each capability has its own measurable effect. The component ablations already reported in Appendix D.2 remove one capability at a time on the same six sources:
As shown in the table, each removal costs the dimension that the component is designed to protect: causal selection protects recap fidelity, time allocation protects pacing, beat planning protects audio-visual grounding, and measured speech protects the duration contract. These capabilities are therefore not interchangeable prompt stages, and their combination is what enables the joint decision under a fixed runtime.