Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Jian Yao 0008

dblp:40/4105-8 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 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
3 papers
Reinforcement learning · 90% Optimization for machine learning · 10%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 11 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › imitation learning › offline imitation learning
behavior cloning
0.912025
Diverse Policies Recovering via Pointwise Mutual Information Weighted Imitation Learning · ICLR 2025
Machine learning › Reinforcement learning
imitation learning
0.912025
Diverse Policies Recovering via Pointwise Mutual Information Weighted Imitation Learning · ICLR 2025
Machine learning › Reinforcement learning › imitation learning
weighted imitation learning
0.912025
Diverse Policies Recovering via Pointwise Mutual Information Weighted Imitation Learning · ICLR 2025
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.712023
Policy Space Diversity for Non-Transitive Games · NeurIPS 2023
Machine learning › Reinforcement learning
policy diversity
0.712023
Policy Space Diversity for Non-Transitive Games · NeurIPS 2023
Machine learning › Reinforcement learning
policy optimization
0.712023
Quality-Similar Diversity via Population Based Reinforcement Learning · ICLR 2023
Machine learning › Reinforcement learning › multi-agent reinforcement learning › equilibrium learning
policy space response oracle
0.712023
Policy Space Diversity for Non-Transitive Games · NeurIPS 2023
Machine learning › Reinforcement learning › population-based learning › evolutionary learning
population-based reinforcement learning
0.712023
Quality-Similar Diversity via Population Based Reinforcement Learning · ICLR 2023
Machine learning › Optimization for machine learning › evolutionary computation
quality-diversity
0.712023
Quality-Similar Diversity via Population Based Reinforcement Learning · ICLR 2023
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts › nash equilibrium
approximate nash equilibrium
0.712023
Policy Space Diversity for Non-Transitive Games · NeurIPS 2023
Algorithmic game theory and mechanism design › non-cooperative game › strategic game
non-transitive games
0.712023
Policy Space Diversity for Non-Transitive Games · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

diversity regularization · 1.3pointwise mutual information · 0.9behavioral cloning · 0.9population-based training · 0.7policy-space response oracle · 0.7policy space response oracles · 0.7
YearPublicationVenuePosition
2025 Diverse Policies Recovering via Pointwise Mutual Information Weighted Imitation Learning
abstract
Recovering a spectrum of diverse policies from a set of expert trajectories is an important research topic in imitation learning. After determining a latent style for a trajectory, previous diverse polices recovering methods usually employ a vanilla behavioral cloning learning objective conditioned on the latent style, treating each state-action pair in the trajectory with equal importance. Based on an observation that in many scenarios, behavioral styles are often highly relevant with only a subset of state-action pairs, this paper presents a new principled method in diverse polices recovering. In particular, after inferring or assigning a latent style for a trajectory, we enhance the vanilla behavioral cloning by incorporating a weighting mechanism based on pointwise mutual information. This additional weighting reflects the significance of each state-action pair's contribution to learning the style, thus allowing our method to focus on state-action pairs most representative of that style. We provide theoretical justifications for our new objective, and extensive empirical evaluations confirm the effectiveness of our method in recovering diverse polices from expert data.
Jian Yao 0008, Weiming Liu 0004, Hanmin Qin, Hansheng Kong, Kirk Tang, Jiechao Xiong, Chao Yu 0004, Kai Li 0022, Junliang Xing, Hongwu Chen, Juchao Zhuo, Qiang Fu 0016, Haobo Fu
ICLR2
2023 Quality-Similar Diversity via Population Based Reinforcement Learning
Jian Yao 0008, Haobo Fu, Chao Qian 0001, Yaodong Yang 0001, Qiang Fu 0016, Wei Yang 0032
ICLR2
2023 Policy Space Diversity for Non-Transitive Games
abstract
Policy-Space Response Oracles (PSRO) is an influential algorithm framework for approximating a Nash Equilibrium (NE) in multi-agent non-transitive games. Many previous studies have been trying to promote policy diversity in PSRO. A major weakness with existing diversity metrics is that a more diverse (according to their diversity metrics) population does not necessarily mean (as we proved in the paper) a better approximation to a NE. To alleviate this problem, we propose a new diversity metric, the improvement of which guarantees a better approximation to a NE. Meanwhile, we develop a practical and well-justified method to optimize our diversity metric using only state-action samples. By incorporating our diversity regularization into the best response solving of PSRO, we obtain a new PSRO variant, \textit{Policy Space Diversity} PSRO (PSD-PSRO). We present the convergence property of PSD-PSRO. Empirically, extensive experiments on single-state games, Leduc, and Goofspiel demonstrate that PSD-PSRO is more effective in producing significantly less exploitable policies than state-of-the-art PSRO variants.
Jian Yao 0008, Weiming Liu 0004, Haobo Fu, Yaodong Yang 0001, Stephen McAleer, Qiang Fu 0016, Wei Yang 0032
NeurIPS1