Yuchen Ying
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yuchen Ying has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Mingli Song
Zhejiang University, Hangzhou, China
2 shared publications - Tongya Zheng
Hangzhou City University, Hangzhou, China
2 shared publications - Yu Wang
Zhejiang University, Hangzhou, China
2 shared publications - Hanyang Yuan
Zhejiang University, Hangzhou, China
1 shared publication - Junshu Dai
Zhejiang University, Hangzhou, China
1 shared publication - Kaixuan Chen
State Key Laboratory of Blockchain and Data Security, Zhejiang University
1 shared publication
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 6258-6269
GraphScout: Empowering Large Language Models with Intrinsic Exploration Ability for Agentic Graph Reasoning
Knowledge graphs provide structured and reliable information for many real-world applications, motivating increasing interest in combining large language models (LLMs) with graph-based retrieval to improve factual grounding. Recent Graph-based Retrieval-Augmented Generation (GraphRAG) methods therefore introduce iterative interaction between LLMs and knowledge graphs to enhance reasoning capability. However, existing approaches typically depend on manually designed guidance and interact with knowledge graphs through a limited set of predefined tools, which substantially constrains graph exploration. To address these limitations, we propose GraphScout, a training-centric agentic graph reasoning framework equipped with more flexible graph exploration tools. GraphScout enables models to autonomously interact with knowledge graphs to synthesize structured training data which are then used to post-train LLMs, thereby internalizing agentic graph reasoning ability without laborious manual annotation or task curation. Extensive experiments across five knowledge-graph domains show that a small model (e.g., Qwen3-4B) augmented with GraphScout outperforms baseline methods built on leading LLMs (e.g., Qwen-Max) by an average of 16.7% while requiring significantly fewer inference tokens. Moreover, GraphScout exhibits robust cross-domain transfer performance. Our code is publicly available https://github.com/Ying-Yuchen/_GraphScout_.
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 6258-6269
Open AccessGraphScout: Empowering Large Language Models with Intrinsic Exploration Ability for Agentic Graph Reasoning
Knowledge graphs provide structured and reliable information for many real-world applications, motivating increasing interest in combining large language models (LLMs) with graph-based retrieval to improve factual grounding. Recent Graph-based Retrieval-Augmented Generation (GraphRAG) methods therefore introduce iterative interaction between LLMs and knowledge graphs to enhance reasoning capability. However, existing approaches typically depend on manually designed guidance and interact with knowledge graphs through a limited set of predefined tools, which substantially constrains graph exploration. To address these limitations, we propose GraphScout, a training-centric agentic graph reasoning framework equipped with more flexible graph exploration tools. GraphScout enables models to autonomously interact with knowledge graphs to synthesize structured training data which are then used to post-train LLMs, thereby internalizing agentic graph reasoning ability without laborious manual annotation or task curation. Extensive experiments across five knowledge-graph domains show that a small model (e.g., Qwen3-4B) augmented with GraphScout outperforms baseline methods built on leading LLMs (e.g., Qwen-Max) by an average of 16.7% while requiring significantly fewer inference tokens. Moreover, GraphScout exhibits robust cross-domain transfer performance. Our code is publicly available https://github.com/Ying-Yuchen/_GraphScout_.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6493-6504
Adaptive Location Hierarchy Learning for Long-Tailed Mobility Prediction
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6493-6504
Open AccessAdaptive Location Hierarchy Learning for Long-Tailed Mobility Prediction