Graph reasoning agents operating from natural-language inputs must solve a coupled problem: they must reconstruct a structured graph instance from text, decide whether existing computational assets are sufficient, interact with tools under a strict execution protocol, and satisfy an external verifier that checks structured correctness rather than textual plausibility. Existing approaches usually improve either the instruction side or the tool side in isolation, which leaves unclear what should be updated after failure. We propose EGL-SCA, a verifier-centric dual-space framework that models a graph reasoning agent using two collaborative components: an instruction-side policy space for reasoning strategies, and a tool-side program space for executable algorithmic tools. Our central mechanism is structural credit assignment, which maps trajectory evidence to conditional updates, precisely routing failures to either prompt optimization or tool synthesis and repair. To provide sufficient learning signals for dual-space adaptation, we introduce a training distribution stratified by task family, coupled with a Pareto-style retention strategy to balance success, generality, and parsimony. Experiments on four graph reasoning benchmarks show that EGL-SCA achieves a state-of-the-art 92.0\% average success rate. By effectively co-evolving instructions and tools, our framework significantly outperforms both pure-prompting and fixed-toolbox baselines.
Credit Assignment via Neural Manifold Noise Correlation
Howard Hughes Medical Institute(霍华德·休斯医学研究所);Department of Neurobiology, Harvard Medical School(哈佛医学院神经生物学系);Kempner Institute for the Study of Natural and Artificial Intelligence, Harvard University(哈佛大学自然与人工智能研究所在)
S2T-RLHF: Hierarchical Credit Assignment for Stable Preference-Based RLHF
State Key Laboratory for Novel Software Technology, Nanjing University(南京大学计算机软件新技术国家重点实验室);School of Computer Science and Artificial Intelligence, Zhengzhou University(郑州大学计算机科学与人工智能学院)
Of Errors and Echoes: Responsibility-Aware Credit Assignment for Tool-Use Agents
University of California, Irvine(加利福尼亚大学欧文分校);Georgia Institute of Technology(佐治亚理工学院);Dartmouth College(达特茅斯学院);Northeastern University(东北大学);University of Notre Dame(圣母大学)
LoCA: Forward-Only LLM Tuning after One-Shot Calibration with Local Credit Assignment
University of Oklahoma(俄克拉荷马大学);Imperial College London(伦敦帝国学院);University of Michigan(密歇根大学);Tencent(腾讯);University of Edinburgh(爱丁堡大学);University of Southern California(南加州大学);Beijing Normal University(北京师范大学);Beijing Normal-Hong Kong Baptist University(北京师范大学-香港浸会大学联合国际学院)
Learning What to Skip: Counterfactual Credit Assignment for Efficient Multi-Agent LLM Workflows
The University of British Columbia(不列颠哥伦比亚大学);The Hong Kong Polytechnic University(香港理工大学);The Hong Kong University of Science and Technology(香港科技大学);University of Luxemburg(卢森堡大学);The University of Hong Kong(香港大学);Shenzhen University(深圳大学);Sun Yat-Sen University(中山大学)
Stop Summation: Min-Form Credit Assignment Is All Process Reward Model Needs for Reasoning
State Key Laboratory of Multimodal Artificial Intelligence Systems, Institute of Automation, Chinese Academy of Sciences(多模态人工智能系统国家重点实验室,自动化研究所,中国科学院);School of Artificial Intelligence, University of Chinese Academy of Sciences(中国科学院大学人工智能学院);Shanghai Artificial Intelligence Laboratory(上海人工智能实验室);Tencent(腾讯);Faculty of Innovation Engineering, Macau University of Science and Technology(澳门科技大学创新工程学院);DeSci Center of Parallel Intelligence, Obuda University(并行智能德Sci中心,奥布达大学);Research Center for Chinese Economics and Social Security, University of Chinese Academy of Sciences(中国经济社会安全研究中心,中国科学院大学);Institute of Automation, Chinese Academy of Sciences(自动化研究所,中国科学院)