Minying Zhang
2026
MemTR: Enhancing Tool-Calling Reliability via Uncertainty-Triggered FFN-Space Retracing
Hongtao Duan | Lu Jiang | Minying Zhang | Xiaobing Zhu | Tianpeng Bu | Hao Jiang | Xinyu Wei | Lulu hu
Findings of the Association for Computational Linguistics: ACL 2026
Hongtao Duan | Lu Jiang | Minying Zhang | Xiaobing Zhu | Tianpeng Bu | Hao Jiang | Xinyu Wei | Lulu hu
Findings of the Association for Computational Linguistics: ACL 2026
Tool calling requires Large Language Models (LLMs) to generate structured decisions including tool names and schema-constrained arguments, where small decoding mistakes can cause hard failures. Existing methods either rely on costly tool-use training data or only constrain syntax, leaving tool selection and argument value errors largely unsolved. We analyze tool calling failures through a Where–When lens: (Where) failures correlate with persistent uncertainty in late transformer layers, (When) uncertainty concentrates on content-bearing tokens (tool names and argument values) rather than schema tokens. Based on this, and motivated by evidence that transformer Feed Forward Networks (FFNs) act as key–value style memories that store and retrieve factual or associative mappings, we propose Memory Space Tool Retracing (MemTR), a weight-free decoding-time method that retrieves relevant tool evidence from the tool library and mixes it into the FFN-output at the uncertain layer, treating FFNs as key–value memories. Through extensive experiments on various model families (Qwen, Llama, and xLAM) and benchmarks (BFCL, ACEBench, APIBank), MemTR reduces tool calling failures by 2%–9% with only 1%–2% runtime overhead, without any fine-tuning or additional tool-use training data.
2025
Enhanced Data Synthesis for LLM through Reasoning Structures Generated by Hierarchical GFlowNet
Tianpeng Bu | Minying Zhang | Hongtao Duan | Shurui Li | Lulu Hu | Yu Li
Findings of the Association for Computational Linguistics: ACL 2025
Tianpeng Bu | Minying Zhang | Hongtao Duan | Shurui Li | Lulu Hu | Yu Li
Findings of the Association for Computational Linguistics: ACL 2025
Large language models (LLMs) excel in problem-solving but require training data with diverse reasoning processes. Existing methods mainly optimize instruction-response pairs but lack a systematic design for the underlying reasoning structure. This paper proposes RSS: a Reasoning Structure driven data Synthesis method. We first proactively develop a hierarchical GFlowNet to construct reasoning structures efficiently through a coarse-to-fine directed acyclic graph (DAG) growth process. Then reasoning DAGs are leveraged to actively guide the instruction generation via an iterative suggester-editor workflow and enhance response quality using a structure-aware strategy. Experiments show that LLMs trained on our synthetic datasets achieve 48.50%, 84.00%, 79.90% for AlpacaEval2, GSM8K and HumanEval, outperforming existing data synthesis methods.