paper-with-me

Papers

Plans You Can Check: Verifier-Grounded Learning of an Open-Weight Planner for Executable Video-Editing

2026-08-26 · Haoyu Wang, Cheng Feng, Liuyang Bian, Ruiyang Huang, Lei Wei, Yafei Wen, Xiaoxin Chen, Xiaoying Tang arxiv

Practical video editing is not only pixel generation: an editor must turn a brief, a clip pool, music metadata, and hard constraints into an executable timeline. We study this decision layer as \emph{executable video-editing planning} and introduce RefineCut, which, unlike workflow systems that wrap a prompted frontier model, trains a compact open-weight planner for it. The planner edits a typed timeline through structured patches covering clip selection, trimming, ordering, transitions, and duration and music alignment; a deterministic verifier applies each patch and checks it against an explicit constraint ledger. Because editing has no single ground-truth repair, we do not imitate teachers directly: RefineCut replays every multi-teacher branch through the verifier and keeps verifier-best repairs as supervision. A second stage, RefineCut-Evo, lets the student score its own repairs with the verifier and a task rubric and trains on high-margin preference pairs, so the final $8$B planner runs in a closed verifier loop with no teacher calls at inference. On RefineCut-Bench ($3{,}578$ tasks, $7{,}971$ captioned clips, $499$ music tracks, explicit ledgers), verifier-replayed distillation lifts the planner from $0.620$ to $0.858$ on the protocol-specific Video-Editing Score and RefineCut-Evo reaches $0.924$; the gain transfers to Llama-3.1-8B and GLM-4-9B, and in the same closed loop the $8$B planner matches or exceeds its frontier teachers. Code and RefineCut-Bench are publicly released; see the Data Availability statement.

📄 PDF Abstract BibTeX arXiv:2608.25622

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Governance Records as Supervision: Verifier-Selected Self-Training for Structured Workflow Repair

2026-08-18 · Jesus Salas arxiv

Machine-verifiable workflows produce governance records linking a task contract, model attempt, verifier decision, accepted output, and target origin. We test whether these records can supervise bounded models, consolida…

OpenComputer: Verifiable Software Worlds for Computer-Use Agents

2026-05-19 · Jinbiao Wei, Qianran Ma, Yilun Zhao, Xiao Zhou 외 arxiv

We present OpenComputer, a verifier-grounded framework for constructing verifiable software worlds for computer-use agents. OpenComputer integrates four components: (1) app-specific state verifiers that expose structured…

SAFE: An LLM-as-Verifier Framework for Evidence-Grounded Multi-Hop Reasoning

2026-04-02 · Daeyong Kwon, Soyoung Yoon, Seung-won Hwang arxiv

Multi-hop QA benchmarks often reward Large Language Models (LLMs) for spurious correctness, where models reach correct answers through invalid intermediate reasoning. We propose SAFE, an LLM-as-verifier framework for evi…

ThinknCheck: Grounded Claim Verification with Compact, Reasoning-Driven, and Interpretable Models

2026-04-02 · Delip Rao, Feijiang Han, Chris Callison-Burch arxiv

We present ThinknCheck, a 1B-parameter verifier for grounded claim verification that first produces a short, structured rationale and then a binary verdict. We construct LLMAggreFact-Think, a 24.1k reasoning-augmented tr…

On AI Verification in Open RAN

2025-10-21 · Rahul Soundrarajan, Claudio Fiandrino, Michele Polese, Salvatore D'Oro 외 arxiv

Open RAN introduces a flexible, cloud-based architecture for the Radio Access Network (RAN), enabling Artificial Intelligence (AI)/Machine Learning (ML)-driven automation across heterogeneous, multi-vendor deployments. W…

Reinforcement Learning