Liuyang Bian
Author directory2026
SOLAR-RL: Semi-Online Long-horizon Assignment Reinforcement Learning
Jichao Wang | Liuyang Bian | Yufeng Zhou | Han Xiao | Yue Pan | Guozhi Wang | Hao Wang | Zhaoxiong Wang | Yafei Wen | Xiaoxin Chen | Shuai Ren | Lingfang Zeng
Findings of the Association for Computational Linguistics: ACL 2026
Jichao Wang | Liuyang Bian | Yufeng Zhou | Han Xiao | Yue Pan | Guozhi Wang | Hao Wang | Zhaoxiong Wang | Yafei Wen | Xiaoxin Chen | Shuai Ren | Lingfang Zeng
Findings of the Association for Computational Linguistics: ACL 2026
As Multimodal Large Language Models (MLLMs) mature, GUI agents are evolving from static interactions to complex navigation. While Reinforcement Learning (RL) has emerged as a promising paradigm for training MLLM agents on dynamic GUI tasks, its effective application faces a dilemma.Standard Offline RL often relies on static step-level data, neglecting global trajectory semantics such as task completion and execution quality. Conversely, Online RL captures the long-term dynamics but suffers from high interaction costs and potential environmental instability. To bridge this gap, we propose SOLAR-RL (Semi Online Long-horizon RL). Instead of relying solely on expensive online interactions, our framework integrates global trajectory insights directly into the offline learning process. Specifically, we reconstruct diverse rollout candidates from static data, detect the first failure point using per-step validity signals, and retroactively assign dense step-level rewards with target-aligned shaping to reflect trajectory-level execution quality—effectively simulating online feedback without interaction costs.Extensive experiments demonstrate that SOLAR-RL significantly improves long-horizon task completion rates and robustness compared to strong baselines, offering a sample-efficient solution for autonomous GUI navigation.
Plans You Can Check: Verifier-Grounded Learning of an Open-Weight Planner for Executable Video-Editing
Haoyu Wang | Cheng Feng | Liuyang Bian | Ruiyang Huang | Lei Wei | Yafei Wen | Xiaoxin Chen | Xiaoying Tang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Haoyu Wang | Cheng Feng | Liuyang Bian | Ruiyang Huang | Lei Wei | Yafei Wen | Xiaoxin Chen | Xiaoying Tang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
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 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 8B 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 8B planner matches or exceeds its frontier teachers. Code and RefineCut-Bench are publicly released; see the Data Availability statement.