Yige Yuan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yige Yuan has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Bingbing Xu
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
10 shared publications - Huawei Shen
State Key Lab of AI Safety, Institute of Computing Technology, CAS, Beijing, China
10 shared publications - Xueqi Cheng
Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China
5 shared publications - An Zhang
University of Science and Technology of China, Hefei, China
2 shared publications - Bingbing Xu
State Key Laboratory of AI Safety, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
2 shared publications - Fei Sun
State Key Laboratory of AI Safety, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9560-9563
The 2nd Workshop on LLM Agents for Social Simulation
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 9560-9563
Open AccessThe 2nd Workshop on LLM Agents for Social Simulation
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 58-68
Multi-Personality Generation of LLMs at Decoding-time
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 58-68
Open AccessMulti-Personality Generation of LLMs at Decoding-time
- Open Access
Do We Always Need Query-Level Workflows? Rethinking Agentic Workflow Generation for Multi-Agent Systems
Multi-Agent Systems (MAS) built on large language models typically solve complex tasks by coordinating multiple agents through workflows. Existing approaches generates workflows either at task level or query level, but their relative costs and benefits remain unclear. After rethinking and empirical analyses, we show that query-level workflow generation is not always necessary, since a small set of top-K best task-level workflows together already covers equivalent or even more queries. We further find that exhaustive execution-based task-level evaluation is both extremely token-costly and frequently unreliable. Inspired by the idea of self-evolution and generative reward modeling, we propose a low-cost task-level generation framework \textbf{SCALE}, which means \underline{\textbf{S}}elf prediction of the optimizer with few shot \underline{\textbf{CAL}}ibration for \underline{\textbf{E}}valuation instead of full validation execution. Extensive experiments demonstrate that \textbf{SCALE} maintains competitive performance, with an average degradation of just 0.61\% compared to existing approach across multiple datasets, while cutting overall token usage by up to 83\%.
Open AccessDo We Always Need Query-Level Workflows? Rethinking Agentic Workflow Generation for Multi-Agent Systems
Multi-Agent Systems (MAS) built on large language models typically solve complex tasks by coordinating multiple agents through workflows. Existing approaches generates workflows either at task level or query level, but their relative costs and benefits remain unclear. After rethinking and empirical analyses, we show that query-level workflow generation is not always necessary, since a small set of top-K best task-level workflows together already covers equivalent or even more queries. We further find that exhaustive execution-based task-level evaluation is both extremely token-costly and frequently unreliable. Inspired by the idea of self-evolution and generative reward modeling, we propose a low-cost task-level generation framework \textbf{SCALE}, which means \underline{\textbf{S}}elf prediction of the optimizer with few shot \underline{\textbf{CAL}}ibration for \underline{\textbf{E}}valuation instead of full validation execution. Extensive experiments demonstrate that \textbf{SCALE} maintains competitive performance, with an average degradation of just 0.61\% compared to existing approach across multiple datasets, while cutting overall token usage by up to 83\%.
- Open Access
GIFT: Games as Informal Training for Generalizable LLMs
While Large Language Models (LLMs) have achieved remarkable success in formal learning tasks such as mathematics and code generation, they still struggle with the "practical wisdom" and generalizable intelligence, such as strategic creativity and social reasoning, that characterize human cognition. This gap arises from a lack of informal learning, which thrives on interactive feedback rather than goal-oriented instruction. In this paper, we propose treating Games as a primary environment for LLM informal learning, leveraging their intrinsic reward signals and abstracted complexity to cultivate diverse competencies. To address the performance degradation observed in multi-task learning, we introduce a Nested Training Framework. Unlike naive task mixing optimizing an implicit "OR" objective, our framework employs sequential task composition to enforce an explicit "AND" objective, compelling the model to master multiple abilities simultaneously to achieve maximal rewards. Using GRPO-based reinforcement learning across Matrix Games, TicTacToe, and Who's the Spy games, we demonstrate that integrating game-based informal learning not only prevents task interference but also significantly bolsters the model's generalization across broad ability-oriented benchmarks. The framework and implementation are publicly available.
Open AccessGIFT: Games as Informal Training for Generalizable LLMs
While Large Language Models (LLMs) have achieved remarkable success in formal learning tasks such as mathematics and code generation, they still struggle with the "practical wisdom" and generalizable intelligence, such as strategic creativity and social reasoning, that characterize human cognition. This gap arises from a lack of informal learning, which thrives on interactive feedback rather than goal-oriented instruction. In this paper, we propose treating Games as a primary environment for LLM informal learning, leveraging their intrinsic reward signals and abstracted complexity to cultivate diverse competencies. To address the performance degradation observed in multi-task learning, we introduce a Nested Training Framework. Unlike naive task mixing optimizing an implicit "OR" objective, our framework employs sequential task composition to enforce an explicit "AND" objective, compelling the model to master multiple abilities simultaneously to achieve maximal rewards. Using GRPO-based reinforcement learning across Matrix Games, TicTacToe, and Who's the Spy games, we demonstrate that integrating game-based informal learning not only prevents task interference but also significantly bolsters the model's generalization across broad ability-oriented benchmarks. The framework and implementation are publicly available.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6933-6936
The 1st Workshop on LLM Agents for Social Simulation
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6933-6936
Open AccessThe 1st Workshop on LLM Agents for Social Simulation
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 10622-10631
MIGE: Mutually Enhanced Multimodal Instruction-Based Image Generation and Editing
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 10622-10631
Open AccessMIGE: Mutually Enhanced Multimodal Instruction-Based Image Generation and Editing
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2807-2811
Fact-Level Calibration and Correction for Long-Form Generations
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 2807-2811
Open AccessFact-Level Calibration and Correction for Long-Form Generations
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 719-728
InfoNCE is a Free Lunch for Semantically guided Graph Contrastive Learning
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 719-728
Open AccessInfoNCE is a Free Lunch for Semantically guided Graph Contrastive Learning
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 2998-3002
Unveiling the Potential of LLMs in Simulated Society: A Knowledge-Driven LLM Agent Framework for User Modeling
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 2998-3002
Open AccessUnveiling the Potential of LLMs in Simulated Society: A Knowledge-Driven LLM Agent Framework for User Modeling
- 31 August 2024
- Published by Springer Nature
- p. 364-374
History Driven Sampling for Scalable Graph Neural Networks
- 31 August 2024
- Published by Springer Nature
- p. 364-374
History Driven Sampling for Scalable Graph Neural Networks