Shengyi Qian
Author directory2026
SlideForge: Controllable Editing of Slides as Structured Artifacts
Haozhen Zheng | Fulin Wang | Tianhu Xiong | YingJie Yu | Shengyi Qian | Hanchao Yu | Alex Schwing | Klara Nahrstedt | Mingyuan Wu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Haozhen Zheng | Fulin Wang | Tianhu Xiong | YingJie Yu | Shengyi Qian | Hanchao Yu | Alex Schwing | Klara Nahrstedt | Mingyuan Wu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Current AI agents compellingly describe slides. However, AI-assisted slide editing requires more than understanding: the output must retain layout, style, component structure, and native editability. Towards, AI-assisted slide editing, existing agents operate on screenshots or weak document representations and often fragment coherent visual units, rasterize editable content, or break layout. In contrast, for controllable slide editing we introduce an agentic framework, SlideForge, which builds a Deck State Graph, an executable slide state that links visual decomposition, native PPTX object structure, and perceptual organization. By recovering human-referable components while retaining fine-grained editable structure, SlideForge supports theme-preserving reconstruction through slide-native operations and rendered-state verification. We further introduce an evaluation paradigm for controllable slide transformation that jointly measures component recovery, preservation, restyling consistency, visual quality, and native editability. Experiments show that SlideForge outperforms direct prompting, screenshot-based agents, and generic code-agent baselines across these dimensions.
2025
DISCO Balances the Scales: Adaptive Domain- and Difficulty-Aware Reinforcement Learning on Imbalanced Data
Yuhang Zhou | Jing Zhu | Shengyi Qian | Zhuokai Zhao | Xiyao Wang | Xiaoyu Liu | Ming Li | Paiheng Xu | Wei Ai | Furong Huang
Findings of the Association for Computational Linguistics: EMNLP 2025
Yuhang Zhou | Jing Zhu | Shengyi Qian | Zhuokai Zhao | Xiyao Wang | Xiaoyu Liu | Ming Li | Paiheng Xu | Wei Ai | Furong Huang
Findings of the Association for Computational Linguistics: EMNLP 2025
Large Language Models (LLMs) are increasingly aligned with human preferences through Reinforcement Learning from Human Feedback (RLHF). Among RLHF methods, Group Relative Policy Optimization (GRPO) has gained attention for its simplicity and strong performance, notably eliminating the need for a learned value function. However, GRPO implicitly assumes a balanced domain distribution and uniform semantic alignment across groups—assumptions that rarely hold in real-world datasets. When applied to multi-domain, imbalanced data, GRPO disproportionately optimizes for dominant domains, neglecting underrepresented ones and resulting in poor generalization and fairness. We propose Domain-Informed Self-Consistency Policy Optimization (DISCO), a principled extension to GRPO that addresses inter-group imbalance with two key innovations. Domain-aware reward scaling counteracts frequency bias by reweighting optimization based on domain prevalence. Difficulty-aware reward scaling leverages prompt-level self-consistency to identify and prioritize uncertain prompts that offer greater learning value. Together, these strategies promote more equitable and effective policy learning across domains. Extensive experiments across multiple LLMs and skewed training distributions show that DISCO improves generalization, outperforms existing GRPO variants by 5% on Qwen3 models, and sets new state-of-the-art results on multi-domain alignment benchmarks.