← Search

Jiechao Xiong

7 accepted papers

2025

Diverse Policies Recovering via Pointwise Mutual Information Weighted Imitation Learning

ICLR 2025poster

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…

Cited by 0SourcePDFScholar
2022

Greedy when Sure and Conservative when Uncertain about the Opponents

ICML 2022spotlight

We develop a new approach, named Greedy when Sure and Conservative when Uncertain (GSCU), to competing online against unknown and nonstationary opponents. GSCU improves in four aspects: 1) introduces a novel way of learning opponent policy embeddings offline; 2) trains offline a single best response…

2019

Grid-Wise Control for Multi-Agent Reinforcement Learning in Video Game AI

ICML 2019oral

We consider the problem of multi-agent reinforcement learning (MARL) in video game AI, where the agents are located in a spatial grid-world environment and the number of agents varies both within and across episodes. The challenge is to flexibly control an arbitrary number of agents while achieving…

Cited by 72SourcePDFScholar
2018

Exponentially Weighted Imitation Learning for Batched Historical Data

NeurIPS 2018poster

We consider deep policy learning with only batched historical trajectories. The main challenge of this problem is that the learner no longer has a simulator or ``environment oracle'' as in most reinforcement learning settings. To solve this problem, we propose a monotonic advantage reweighted imitat…

2016

False Discovery Rate Control and Statistical Quality Assessment of Annotators in Crowdsourced Ranking

ICML 2016poster

With the rapid growth of crowdsourcing platforms it has become easy and relatively inexpensive to collect a dataset labeled by multiple annotators in a short time. However due to the lack of control over the quality of the annotators, some abnormal annotators may be affected by position bias which c…

Cited by 13SourcePDFScholar
2016

Split LBI: An Iterative Regularization Path with Structural Sparsity

NeurIPS 2016poster

An iterative regularization path with structural sparsity is proposed in this paper based on variable splitting and the Linearized Bregman Iteration, hence called \emph{Split LBI}. Despite its simplicity, Split LBI outperforms the popular generalized Lasso in both theory and experiments. A theory of…

Cited by 26SourcePDFScholar