Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yutong Wang 0012
dblp:90/3631-12
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0001-6268-1268ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Reinforcement learning · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › population-based learning › evolutionary learning
population-based reinforcement learning |
0.6 | 1 | 2022 | Evolutionary Diversity Optimization with Clustering-based Selection for Reinforcement Learning · ICLR 2022 |
Methods — techniques the papers use, named apart from their topics
evolutionary algorithm · 0.6clustering · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Diversity from human feedback
Ren-Jian Wang, Ke Xue 0001, Yutong Wang 0012, Peng Yang 0008, Haobo Fu, Qiang Fu 0016, Chao Qian 0001 |
Frontiers Comput. Sci. | 3 |
| 2025 | Heterogeneous Multiagent Zero-Shot Coordination by CoevolutionabstractGenerating agents that can achieve zero-shot coordination (ZSC) with unseen partners is a new challenge in cooperative multiagent reinforcement learning (MARL). Recently, some studies have made progress in ZSC by exposing the agents to diverse partners during the training process. They usually involve self-play when training the partners, implicitly assuming that the tasks are homogeneous. However, many real-world tasks are heterogeneous, and hence previous methods may be inefficient. In this article, we study the heterogeneous ZSC problem for the first time and propose a general method based on coevolution, which coevolves two populations of agents and partners through three subprocesses: 1) pairing; 2) updating; and 3) selection. Experimental results on various heterogeneous tasks highlight the necessity of considering the heterogeneous setting and demonstrate that our proposed method is a promising solution for heterogeneous ZSC tasks. To the best of our knowledge, we are the first to underscore the significance of the heterogeneous ZSC tasks and to introduce an effective framework for addressing it. Ke Xue 0001, Yutong Wang 0012, Cong Guan, Lei Yuan 0005, Haobo Fu, Qiang Fu 0016, Chao Qian 0001, Yang Yu 0001 |
IEEE Trans. Evol. Comput. | 2 |
| 2022 | Evolutionary Diversity Optimization with Clustering-based Selection for Reinforcement Learning
Yutong Wang 0012, Ke Xue 0001, Chao Qian 0001 |
ICLR | 1 |