Papers by Dingwei Chen
AT²PO: Agentic Turn-based Policy Optimization via Tree Search (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in large language models (LLMs) have catalyzed the development of autonomous agents capable of executing complex, multi-turn tasks. |
| Approach: | They propose a framework for agentic reinforcement learning that integrates turn-level tree search with tree search to address key challenges. |
| Outcome: | The proposed framework addresses key challenges: limited exploration diversity, sparse credit assignment, and misaligned policy optimization. |
AgentGym2: Benchmarking Large Language Model Agents in De-Idealized Real-World Environments (2026.acl-long)
Copied to clipboard
Zhiheng Xi, Dingwen Yang, Jiaqi Liu, Jixuan Huang, Honglin Guo, Baodai Huang, Tinggang Chen, Qi Zhang, Zhonghang Lu, Chenyu Liu, Jiajun Sun, Jiazheng Zhang, Dingwei Zhu, Xin Guo, Junzhe Wang, Zhihao Zhang, Yuming Yang, Junjie Ye, Minghe Gao, Dongrui Liu, Jiaming Ji, Guohao Li, Tao Gui, Qi Zhang, Xuanjing Huang
| Challenge: | Existing benchmarks evaluate agents in simplified, idealized settings, relying on pre-packaged tool interfaces, overlooking critical steps, and assume inputs are clean and fully specified. |
| Approach: | They propose a framework that evaluates language agents in simplified, idealized settings . they show that even SOTA systems like Gemini and GPT-5 struggle on AgentGym2 . |
| Outcome: | Experiments on 15 proprietary and open-source models show that even SOTA systems like Gemini and GPT-5 struggle on AgentGym2 . |
AgentV-RL: Scaling Reward Modeling with Agentic Verifier (2026.findings-acl)
Copied to clipboard
Jiazheng Zhang, Ziche Fu, Zhiheng Xi, Wenqing Jing, Mingxu Chai, Wei He, Guoqiang Zhang, Chenghao Fan, Chenxin An, Wenxiang Chen, Zhicheng Liu, Haojie Pan, Dingwei Zhu, Tao Gui, Qi Zhang, Xuanjing Huang
| Challenge: | Existing approaches to improve LLM reasoning are limited in complex domains and lack external grounding makes verifiers unreliable on computation-intensive tasks. |
| Approach: | They propose a framework that transforms reward modeling into a multi-turn, tool-augmented deliberative process. |
| Outcome: | The proposed framework surpasses state-of-the-art ORMs by 25.2% under parallel and sequential TTS. |
Expanding before Inferring: Enhancing Factuality in Large Language Models through Premature Layers Interpolation (2025.emnlp-main)
Copied to clipboard
Dingwei Chen, Ziqiang Liu, Feiteng Fang, Chak Tou Leong, Shiwen Ni, Ahmadreza Argha, Hamid Alinejad-Rokny, Min Yang, Chengming Li
| Challenge: | Existing approaches to generating factually inconsistent outputs are resource-intensive. |
| Approach: | They propose a plug-and-play intervention designed to enhance factuality by inserting premature layers formed through mathematical interpolation with adjacent layers. |
| Outcome: | The proposed intervention reduces hallucinations while outperforming baselines on four datasets. |
Act-Adaptive Margin: Dynamically Calibrating Reward Models for Subjective Ambiguity (2026.acl-long)
Copied to clipboard
Feiteng Fang, Dingwei Chen, Xiang Huang, Ting-En Lin, Yuchuan Wu, Xiong Liu, Jing Ye, Ziqiang Liu, Haonan Zhang, Liang Zhu, Hamid Alinejad-Rokny, Min Yang, Yongbin Li
| Challenge: | Existing approaches to reward modeling in reinforcement learning tasks are limited when dealing with ambiguous preferences. |
| Approach: | They propose to use AAM to dynamically calibrate preference margins using the Bradley-Terry model's internal parameter knowledge to improve reward modeling in subjective tasks. |
| Outcome: | The proposed approach improves reward modeling by dynamically calibrating preference margins using the model’s internal parameter knowledge. |
Finding RELIEF: Shaping Reasoning Behavior without Reasoning Supervision via Belief Engineering (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for shaping large reasoning models rely on reinforcement learning or fine-tuning with gold-standard reasoning traces. Existing techniques for behavior shaping rely only on additional reward modeling. |
| Approach: | They propose a framework that aligns a model's self-concept with a target belief blueprint and internalizes desired traits by fine-tuning on synthesized, self-reflective QA pairs that affirm the target belief. |
| Outcome: | The proposed framework outperforms behavior-supervised and preference-based models while requiring significantly lower training costs. |
Forgetting before Learning: Utilizing Parametric Arithmetic for Knowledge Updating in Large Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods of model editing and knowledge updating add additional network parameters, knowledge bases, knowledge base, and model parameters. |
| Approach: | They propose a new paradigm for fine-tuning called F-Learning that employs parametric arithmetic to facilitate the forgetting of old knowledge and learning of new knowledge. |
| Outcome: | The proposed model outperforms existing models on two datasets and is comparable to full fine-tuning and LoRA fine-uning. |