← Search

Shixiang (Shane) Gu

7 accepted papers

2020

Weakly-Supervised Reinforcement Learning for Controllable Behavior

NeurIPS 2020poster

Reinforcement learning (RL) is a powerful framework for learning to take actions to solve tasks. However, in many settings, an agent must winnow down the inconceivably large space of all possible tasks to the single task that it is currently being asked to solve. Can we instead constrain the space o…

2019

Multi-Agent Manipulation via Locomotion using Hierarchical Sim2Real

CoRL 2019

Manipulation and locomotion are closely related problems that are often studied in isolation. In this work, we study the problem of coordinating multiple mobile agents to exhibit manipulation behaviors using a reinforcement learning (RL) approach. Our method hinges on the use of hierarchical sim2rea

Cited by 0SourcePDFScholar
2019

SMILe: Scalable Meta Inverse Reinforcement Learning through Context-Conditional Policies

NeurIPS 2019poster

Imitation Learning (IL) has been successfully applied to complex sequential decision-making problems where standard Reinforcement Learning (RL) algorithms fail. A number of recent methods extend IL to few-shot learning scenarios, where a meta-trained policy learns to quickly master new tasks using l…

2018

Data-Efficient Hierarchical Reinforcement Learning

NeurIPS 2018poster

Hierarchical reinforcement learning (HRL) is a promising approach to extend traditional reinforcement learning (RL) methods to solve more complex tasks. Yet, the majority of current HRL methods require careful task-specific design and on-policy training, making them difficult to apply in real-world…

2017

Interpolated Policy Gradient: Merging On-Policy and Off-Policy Gradient Estimation for Deep Reinforcement Learning

NeurIPS 2017poster

Off-policy model-free deep reinforcement learning methods using previously collected data can improve sample efficiency over on-policy policy gradient techniques. On the other hand, on-policy algorithms are often more stable and easier to use. This paper examines, both theoretically and empirically,…

Cited by 206SourcePDFScholar
2015

Particle Gibbs for Infinite Hidden Markov Models

NeurIPS 2015poster

Infinite Hidden Markov Models (iHMM's) are an attractive, nonparametric generalization of the classical Hidden Markov Model which can automatically infer the number of hidden states in the system. However, due to the infinite-dimensional nature of the transition dynamics, performing inference in th…

Cited by 27SourcePDFScholar