--- title: "Yige Yuan — author profile and papers — Elamur Research" description: "Yige Yuan, Kunming University of Science and Technology: 2 papers on Elamur Research (2026), h-index 7 — affiliations, topics, co-authors…" canonical: "https://research.elamur.ai/free/en/authors/yige-yuan/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/yige-yuan/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Yige Yuan # Yige Yuan Yige Yuan has 2 papers in our library, in 2026, most of them on [Reasoning](https://md.research.elamur.ai/free/en/topics/reasoning/); often with [Bingbing Xu](https://md.research.elamur.ai/free/en/authors/bingbing-xu/), [Bolin Ding](https://md.research.elamur.ai/free/en/authors/bolin-ding/), [Huawei Shen](https://md.research.elamur.ai/free/en/authors/huawei-shen/). 2 papers in our library · 2026 [OpenAlex](https://openalex.org/A5056831354) · [ORCID](https://orcid.org/0000-0001-8856-668X) · [**h-index 7**](https://openalex.org/authors/A5056831354) · [36 works](https://openalex.org/works?filter=author.id:A5056831354) · [257 citations](https://openalex.org/works?filter=author.id:A5056831354&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/yige-yuan/#papers) · 🔗 Cited 1 time in our library · [⭐ Paper Stars ranking: #13205](https://md.research.elamur.ai/free/en/paper-stars/page/133/#star-13205) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Yige+Yuan) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Yige+Yuan) · [dblp](https://dblp.org/search?q=Yige+Yuan) · [ACL Anthology](https://aclanthology.org/search/?q=Yige+Yuan) ## Affiliations [🔬**Institute of Computing Technology** Beijing · China 2022–2026 · 19 papers*current*](https://md.research.elamur.ai/free/en/labs/institute-of-computing-technology/) · [🎓**University of Chinese Academy of Sciences** Beijing · China 2020–2026 · 11 papers*current*](https://md.research.elamur.ai/free/en/universities/university-of-chinese-academy-of-sciences/) · [🎓**Kunming University of Science and Technology** Kunming · China 2023–2026 · 4 papers*current*](https://md.research.elamur.ai/free/en/universities/kunming-university-of-science-and-technology/) · [🏛️**Chinese Academy of Sciences** Beijing · China 2022–2025 · 17 papers](https://md.research.elamur.ai/free/en/government/chinese-academy-of-sciences/) · [🎓**Tsinghua University** Beijing · China 2019–2023 · 4 papers](https://md.research.elamur.ai/free/en/universities/tsinghua-university/) From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. 1 more institution on single bylines are not listed. ## Fields, topics and concepts Of its works in our library, with the number of works on each. 📚 Shelves 4 The field of science this work belongs to (OpenAlex fields).[Artificial Intelligence · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Arts and Humanities · 2 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Computer Science · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Language and Linguistics · 2 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) 🧭 Topics 1 Research subjects and languages the work is about.[Reasoning · 1 work](https://md.research.elamur.ai/free/en/topics/reasoning/) ## Works by year ### 2020s [**2026** 2 papers](https://md.research.elamur.ai/free/en/authors/yige-yuan/year/2026/) ## Papers The most cited first (OpenAlex and our library). 1. **[Incentivizing Strong Reasoning from Weak Supervision](https://md.research.elamur.ai/free/en/papers/yuan-2026-incentivizing-strong-reasoning-weak-supervision/)** *(2026 · 1 citation)* Improving LLM reasoning usually requires either reinforcement learning with verifiable rewards, which is compute-intensive, or SFT on long chain-of-thought (CoT) data from very strong teachers, which is costly to obtain. 2. **[Do We Always Need Query-Level Workflows? Rethinking Agentic Workflow Generation for Multi-Agent Systems](https://md.research.elamur.ai/free/en/papers/wang-2026-do-we-always-need-query/)** *(2026)* LLM-based multi-agent systems coordinate their agents through workflows. These workflows are built either once per task or separately for each query. The authors ask whether per-query generation is really needed. They also ask whether task-level search must pay for a full validation run on every candidate. On DROP… ## Co-authors here 7 co-authors with a page, the most papers together first. - [Bingbing Xu](https://md.research.elamur.ai/free/en/authors/bingbing-xu/) ×2 - [Bolin Ding](https://md.research.elamur.ai/free/en/authors/bolin-ding/) - [Huawei Shen](https://md.research.elamur.ai/free/en/authors/huawei-shen/) - [Jinyang Gao](https://md.research.elamur.ai/free/en/authors/jinyang-gao/) - [Shuchang Tao](https://md.research.elamur.ai/free/en/authors/shuchang-tao/) - [Teng Xiao](https://md.research.elamur.ai/free/en/authors/teng-xiao/) - [Xueqi Cheng](https://md.research.elamur.ai/free/en/authors/xueqi-cheng/) ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - [Conference of the European Chapter of the Association for Computational Linguistics (EACL)](https://md.research.elamur.ai/free/en/venues/eacl/): [EACL 2026](https://md.research.elamur.ai/free/en/venues/eacl/2026/) - [Findings of the Association for Computational Linguistics](https://md.research.elamur.ai/free/en/venues/findings/): [Findings of the Association for Computational Linguistics 2026](https://md.research.elamur.ai/free/en/venues/findings/2026/) ## Cited by Papers of our library cite their works 1 time (of the 149,439 papers whose bibliographies we read). Updated 2 November 2026