← Search

Zhongwen Xu

28 accepted papers

2024

Cleanba: A Reproducible and Efficient Distributed Reinforcement Learning Platform

ICLR 2024poster

Distributed Deep Reinforcement Learning (DRL) aims to leverage more computational resources to train autonomous agents with less training time. Despite recent progress in the field, reproducibility issues have not been sufficiently explored. This paper first shows that the typical actor-learner fram…

2023

DaxBench: Benchmarking Deformable Object Manipulation with Differentiable Physics

ICLR 2023top-5%

Deformable object manipulation (DOM) is a long-standing challenge in robotics and has attracted significant interest recently. This paper presents DaXBench, a differentiable simulation framework for DOM. While existing work often focuses on a specific type of deformable objects, DaXBench supports fl…

2023

Efficient Offline Policy Optimization with a Learned Model

ICLR 2023poster

MuZero Unplugged presents a promising approach for offline policy learning from logged data. It conducts Monte-Carlo Tree Search (MCTS) with a learned model and leverages Reanalyze algorithm to learn purely from offline data. For good performance, MCTS requires accurate learned models and a large nu…

2023

Mutual Information Regularized Offline Reinforcement Learning

NeurIPS 2023poster

The major challenge of offline RL is the distribution shift that appears when out-of-distribution actions are queried, which makes the policy improvement direction biased by extrapolation errors. Most existing methods address this problem by penalizing the policy or value for deviating from the beha…

2023

RPM: Generalizable Multi-Agent Policies for Multi-Agent Reinforcement Learning

ICLR 2023poster

Despite the recent advancement in multi-agent reinforcement learning (MARL), the MARL agents easily overfit the training environment and perform poorly in evaluation scenarios where other agents behave differently. Obtaining generalizable policies for MARL agents is thus necessary but challenging ma…

Cited by 2SourcePDFScholar
2023

Value-Consistent Representation Learning for Data-Efficient Reinforcement Learning

AAAI 2023technical

Deep reinforcement learning (RL) algorithms suffer severe performance degradation when the interaction data is scarce, which limits their real-world application. Recently, visual representation learning has been shown to be effective and promising for boosting sample efficiency in RL. These methods…

2023

Visual Imitation Learning with Patch Rewards

ICLR 2023poster

Visual imitation learning enables reinforcement learning agents to learn to behave from expert visual demonstrations such as videos or image sequences, without explicit, well-defined rewards. Previous reseaches either adopt supervised learning techniques or induce simple and coarse scalar rewards f…

2022

EnvPool: A Highly Parallel Reinforcement Learning Environment Execution Engine

NeurIPS 2022accept

There has been significant progress in developing reinforcement learning (RL) training systems. Past works such as IMPALA, Apex, Seed RL, Sample Factory, and others, aim to improve the system's overall throughput. In this paper, we aim to address a common bottleneck in the RL training system, i.e.,…

2021

Balancing Constraints and Rewards with Meta-Gradient D4PG

ICLR 2021poster

Deploying Reinforcement Learning (RL) agents to solve real-world applications often requires satisfying complex system constraints. Often the constraint thresholds are incorrectly set due to the complex nature of a system or the inability to verify the thresholds offline (e.g, no simulator or reason…

Cited by 26SourcePDFScholar
2021

Discovery of Options via Meta-Learned Subgoals

NeurIPS 2021poster

Temporal abstractions in the form of options have been shown to help reinforcement learning (RL) agents learn faster. However, despite prior work on this topic, the problem of discovering options through interaction with an environment remains a challenge. In this paper, we introduce a novel meta-gr…

Cited by 44SourcePDFScholar
2021

Emphatic Algorithms for Deep Reinforcement Learning

ICML 2021spotlight

Off-policy learning allows us to learn about possible policies of behavior from experience generated by a different behavior policy. Temporal difference (TD) learning algorithms can become unstable when combined with function approximation and off-policy sampling—this is known as the “deadly triad”.…

2020

A Self-Tuning Actor-Critic Algorithm

NeurIPS 2020poster

Reinforcement learning algorithms are highly sensitive to the choice of hyperparameters, typically requiring significant manual effort to identify hyperparameters that perform well on a new domain. In this paper, we take a step towards addressing this issue by using metagradients to automatically ad…

2020

Discovering Reinforcement Learning Algorithms

NeurIPS 2020poster

Reinforcement learning (RL) algorithms update an agent’s parameters according to one of several possible rules, discovered manually through years of research. Automating the discovery of update rules from data could lead to more efficient algorithms, or algorithms that are better adapted to specific…

Cited by 176SourcePDFScholar
2020

Meta-Gradient Reinforcement Learning with an Objective Discovered Online

NeurIPS 2020poster

Deep reinforcement learning includes a broad family of algorithms that parameterise an internal representation, such as a value function or policy, by a deep neural network. Each algorithm optimises its parameters with respect to an objective, such as Q-learning or policy gradient, that defines its…

Cited by 85SourcePDFScholar
2020

What Can Learned Intrinsic Rewards Capture?

ICML 2020poster

The objective of a reinforcement learning agent is to behave so as to maximise the sum of a suitable scalar function of state: the reward. These rewards are typically given and immutable. In this paper, we instead consider the proposition that the reward function itself can be a good locus of learne…

Cited by 104SourcePDFScholar
2019

Discovery of Useful Questions as Auxiliary Tasks

NeurIPS 2019poster

Arguably, intelligent agents ought to be able to discover their own questions so that in learning answers for them they learn unanticipated useful knowledge and skills; this departs from the focus in much of machine learning on agents learning answers to externally defined questions. We present a n…

Cited by 100SourcePDFScholar
2017

Natural Value Approximators: Learning when to Trust Past Estimates

NeurIPS 2017spotlight

Neural networks have a smooth initial inductive bias, such that small changes in input do not lead to large changes in output. However, in reinforcement learning domains with sparse rewards, value functions have non-smooth structure with a characteristic asymmetric discontinuity whenever rewards arr…

Cited by 11SourcePDFScholar
2016

Hierarchical Recurrent Neural Encoder for Video Representation With Application to Captioning

CVPR 2016poster

Recently, deep learning approach, especially deep Convolutional Neural Networks (ConvNets), have achieved overwhelming accuracy with fast processing speed for image classification. Incorporating temporal structure with deep ConvNets for video representation becomes a fundamental problem for video co…

Cited by 506PDFScholar