Chenyi Zhuang
Author directory2026
BalanceSFT: Improving LLM Function Calling with Balanced Training Signals and Data Hardness
Bingguang Hao | Zengzhuang Xu | Maolin Wang | Yuntao Wen | Yicheng Chen | Cunyin Peng | Long Chen | Xiangyu Zhao | Jinjie Gu | Chenyi Zhuang | Ji Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Bingguang Hao | Zengzhuang Xu | Maolin Wang | Yuntao Wen | Yicheng Chen | Cunyin Peng | Long Chen | Xiangyu Zhao | Jinjie Gu | Chenyi Zhuang | Ji Zhang
Findings of the Association for Computational Linguistics: ACL 2026
While Supervised Fine-Tuning (SFT) is the prevailing method for equipping Large Language Models (LLMs) with function calling capabilities, its effectiveness is often compromised by two critical challenges: 1) Imbalanced Training Signals, where lengthy Chain-of-Thought (CoT) reasoning tokens dominate the training signals over concise function calls in the learning objective, and 2) Imbalanced Data Hardness, characterized by a scarcity of hard training examples. To overcome these limitations, we propose Balanced Supervised Fine-tuning (BalanceSFT), a novel framework that incorporates two key components: a Self-adjusted Signal Balancing (SSB) loss that employs a learnable hyperparameter to dynamically adjust the token contributions of CoT reasoning and function calls, together with a Hard Data Re-sampling (HDR) strategy that establishes a feedback loop to selectively generate new, high-quality complex data guided by model errors. Extensive experiments demonstrate the effectiveness of our proposed BalanceSFT framework. With BalanceSFT, a 7B model achieves function calling performance that surpasses state-of-the-art models like GPT-5. Our code, models, and dataset are open-sourced.
Last Step Matters: Early Uncertainty Cannot Predict Failure in Long-Horizon Agents
Zongyue Li | Chengyue Yu | Lei Zang | Chenyi Zhuang | Linjian Mo | Leilei Gan
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zongyue Li | Chengyue Yu | Lei Zang | Chenyi Zhuang | Linjian Mo | Leilei Gan
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Early failure prediction is important for long-horizon agents, as it enables timely intervention and can reduce inference and tool-use costs. Uncertainty quantification, such as verbal confidence and perplexity, offers a promising approach to detecting agent failures; however, it has not been explored whether these signals retain their discriminative power during the intermediate stages of long-horizon execution. We evaluate mainstream uncertainty signals on deep-research tasks and find that verbal confidence reliably distinguishes failures at trajectory completion, achieving a mean AUROC of 0.85, whereas all evaluated signals offer limited predictive value earlier in execution, with none exceeding a mean AUROC of 0.60 at 50% trajectory progress. We identify an underlying mechanism explaining this gap: path switching, where agents frequently abandon their current search direction in-trajectory, breaking the link between early signal and final outcome. These findings challenge the assumption that intermediate uncertainty can reliably guide early intervention. They also motivate a practical recommendation for agent harnesses in deep-research settings: use final-step confidence to decide whether to restart, an approach that our experiments find more effective than in-trajectory intervention.
HardGen: Generating Hard Samples for Tool-use Agents
Bingguang Hao | Zengzhuang Xu | Yuntao Wen | Xinyi Xu | Quanen Sun | Yang Liu | Zihao Huang | Tong Zhao | Long Chen | Dong Wang | Yicheng Chen | Maolin Wang | Cunyin Peng | Xiangyu Zhao | Chenyi Zhuang | Ji Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Bingguang Hao | Zengzhuang Xu | Yuntao Wen | Xinyi Xu | Quanen Sun | Yang Liu | Zihao Huang | Tong Zhao | Long Chen | Dong Wang | Yicheng Chen | Maolin Wang | Cunyin Peng | Xiangyu Zhao | Chenyi Zhuang | Ji Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
The advancement of LLM agents with tool-use capabilities requires diverse and complex training corpora. Existing data generation methods, which predominantly follow the paradigm of random sampling and shallow generation, often yield simple and homogeneous trajectories that fail to capture complex, implicit logical dependencies. To bridge this gap, we introduce HardGen, an automatic agentic pipeline designed to generate hard tool-use training samples. First, HardGen establishes a dynamic API Graph built upon agent failure cases, from which it samples hard tool-execution sequences. Second, these execution sequences are used to reversely build advanced tools that combine multi-step operations into one, which then help generate hard queries requiring unstated intermediate steps. Finally, advanced tools and hard queries drive the generation of Chain-of-Thought (CoT), which is iteratively refined through closed-loop verification feedback. Extensive evaluations demonstrate that a 4B parameter model trained with our curated dataset achieves superior performance compared to several leading open-source and closed-source competitors (e.g., GPT-5.2, Gemini-3-Pro and Claude-Opus-4.5). Our code, models and the curated dataset with 27,000 samples will be open-sourced to facilitate future research.
Teach the Magnitude, Not the Direction: Verifier-Anchored Credit Assignment for Multi-Turn Multi-Step LLM Agents
Zechuan Wang | Siyuan Lu | Hongxuan Zhang | Linjian Mo | Chenyi Zhuang | Leilei Gan
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zechuan Wang | Siyuan Lu | Hongxuan Zhang | Linjian Mo | Chenyi Zhuang | Leilei Gan
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Reinforcement learning with verifiable rewards (RLVR) directly optimizes verifier-defined outcomes for multi-turn tool-use agents, yet its trajectory-level credit assignment conflates heterogeneous per-turn outcomes into a single reward signal. On-policy distillation provides dense per-token supervision but uses a teacher-defined token-level objective and can be prone to gradient concentration collapse. We introduce CrEST, a hierarchical credit assignment framework that anchors each sampled token’s scalar advantage sign to verified rewards while incorporating dense magnitude signals from a privileged self-teacher. CrEST resolves credit at two levels: turn-segmented verified advantages address inter-turn dilution, while entropy-gated self-teacher modulation refines intra-turn token contributions. Experiments on BFCL V3 and WildToolBench show that CrEST consistently outperforms both RL and distillation baselines across two model scales, with the largest gains on long-trajectory and strict session-level metrics. Our work demonstrates that the teacher’s role in policy optimization can be reduced from determining token-level reinforcement or suppression to modulating update magnitudes, enabling dense credit assignment while keeping verifier rewards as the training objective.
2024
CharPoet: A Chinese Classical Poetry Generation System Based on Token-free LLM
Chengyue Yu | Lei Zang | Jiaotuan Wang | Chenyi Zhuang | Jinjie Gu
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations)
Chengyue Yu | Lei Zang | Jiaotuan Wang | Chenyi Zhuang | Jinjie Gu
Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations)
Automatic Chinese classical poetry generation has attracted much research interest, but achieving effective control over format and content simultaneously remains challenging. Traditional systems usually accept keywords as user inputs, resulting in limited control over content. Large language models (LLMs) improve content control by allowing unrestricted user instructions, but the token-by-token generation process frequently makes format errors. Motivated by this, we propose CharPoet, a Chinese classical poetry generation system based on token-free LLM, which provides effective control over both format and content. Our token-free architecture generates in a character-by-character manner, enabling precise control over the number of characters. Pruned from existing token-based LLMs, CharPoet inherits their pretrained capabilities and can generate poetry following instructions like “Write me a poem for my mother’s birthday.” CharPoet achieves format accuracy above 0.96, outperforming Jiuge-GPT-2 (0.91) and GPT-4 (0.38). In terms of content quality, CharPoet surpasses traditional systems including Jiuge, and is comparable to other LLMs. Our system is open source and available at https://modelscope.cn/models/CharPoet/CharPoet. A video demonstration of CharPoet is available at https://youtu.be/voZ25qEp3Dc.