← Search

Yan Duan

20 accepted papers

2026

Learning to Design Soft Hands Using Reward Models

ICRA 2026poster

Soft robotic hands promise to provide compliant and safe interaction with objects and environments. However, designing soft hands to be both compliant and functional across diverse use cases remains challenging. Although co-design of hardware and control better couples morphology to behavior, the re…

2026

OmniRetarget: Interaction-Preserving Data Generation for Humanoid Whole-Body Loco-Manipulation and Scene Interaction

ICRA 2026poster

A dominant paradigm for teaching humanoid robots complex skills is to retarget human motions as kinematic references to train reinforcement learning (RL) policies. However, existing retargeting pipelines often struggle with the significant embodiment gap between humans and robots, producing physical…

2026

Residual Off-Policy RL for Finetuning Behavior Cloning Policies

ICRA 2026poster

Recent advances in behavior cloning (BC) have enabled impressive visuomotor control policies. However, these approaches are limited by the quality of human demonstrations, the manual effort required for data collection, and the diminishing returns from offline data. In comparison, reinforcement lear…

2026

TWIST2: Scalable, Portable, and Holistic Humanoid Data Collection System

ICRA 2026poster

Large-scale data has driven breakthroughs in robotics, from language models to vision-language-action models in bimanual manipulation. However, humanoid robotics lacks equally effective data collection frameworks. Existing humanoid teleoperation systems either use decoupled control or depend on expe…

2020

Variable Skipping for Autoregressive Range Density Estimation

ICML 2020poster

Deep autoregressive models compute point likelihood estimates of individual data points. However, many applications (i.e., database cardinality estimation), require estimating range densities, a capability that is under-explored by current neural density estimation literature. In these applications,…

2019

Evaluating Protein Transfer Learning with TAPE

NeurIPS 2019spotlight

Protein modeling is an increasingly popular area of machine learning research. Semi-supervised learning has emerged as an important paradigm in protein modeling due to the high cost of acquiring supervised protein labels, but the current literature is fragmented when it comes to datasets and standar…

2019

Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Design

ICML 2019oral

Flow-based generative models are powerful exact likelihood models with efficient sampling and inference. Despite their computational efficiency, flow-based models generally have much worse density modeling performance compared to state-of-the-art autoregressive models. In this paper, we investigate…

Cited by 553SourcePDFScholar
2018

Model-Ensemble Trust-Region Policy Optimization

ICLR 2018poster

Model-free reinforcement learning (RL) methods are succeeding in a growing number of tasks, aided by recent advances in deep learning. However, they tend to suffer from high sample complexity, which hinders their use in real-world domains. Alternatively, model-based reinforcement learning promises…

2018

Some Considerations on Learning to Explore via Meta-Reinforcement Learning

ICLR 2018workshop

We consider the problem of exploration in meta reinforcement learning. Two new meta reinforcement learning algorithms are suggested: E-MAML and ERL2. Results are presented on a novel environment we call 'Krazy World' and a set of maze environments. We show E-MAML and ERL2 deliver better performance…

Cited by 151SourcecodeScholar
2018

The Importance of Sampling inMeta-Reinforcement Learning

NeurIPS 2018poster

We interpret meta-reinforcement learning as the problem of learning how to quickly find a good sampling distribution in a new environment. This interpretation leads to the development of two new meta-reinforcement learning algorithms: E-MAML and E-$\text{RL}^2$. Results are presented on a new enviro…

2018

Variance Reduction for Policy Gradient with Action-Dependent Factorized Baselines

ICLR 2018oral

Policy gradient methods have enjoyed great success in deep reinforcement learning but suffer from high variance of gradient estimates. The high variance problem is particularly exasperated in problems with long horizons or high-dimensional action spaces. To mitigate this issue, we derive a bias-free…

Cited by 187SourcePDFScholar
2017

#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learning

NeurIPS 2017poster

Count-based exploration algorithms are known to perform near-optimally when used in conjunction with tabular reinforcement learning (RL) methods for solving small discrete Markov decision processes (MDPs). It is generally thought that count-based methods cannot be applied in high-dimensional state s…

Cited by 777SourcePDFScholar
2017

One-Shot Imitation Learning

NeurIPS 2017poster

Imitation learning has been commonly applied to solve different tasks in isolation. This usually requires either careful feature engineering, or a significant number of samples. This is far from what we desire: ideally, robots should be able to learn from very few demonstrations of any given task, a…

Cited by 870SourcePDFScholar
2016

Benchmarking Deep Reinforcement Learning for Continuous Control

ICML 2016poster

Recently, researchers have made significant progress combining the advances in deep learning for learning feature representations with reinforcement learning. Some notable examples include training agents to play Atari games based on raw pixel data and to acquire advanced manipulation skills using r…

2016

Deep spatial autoencoders for visuomotor learning

ICRA 2016

Reinforcement learning provides a powerful and flexible framework for automated acquisition of robotic motion skills. However, applying reinforcement learning requires a sufficiently detailed representation of the state, including the configuration of task-relevant objects. We present an approach th

Cited by 586SourceScholar
2016

InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets

NeurIPS 2016poster

This paper describes InfoGAN, an information-theoretic extension to the Generative Adversarial Network that is able to learn disentangled representations in a completely unsupervised manner. InfoGAN is a generative adversarial network that also maximizes the mutual information between a small subset…

Cited by 5972SourcePDFScholar
2016

VIME: Variational Information Maximizing Exploration

NeurIPS 2016poster

Scalable and effective exploration remains a key challenge in reinforcement learning (RL). While there are methods with optimality guarantees in the setting of discrete state and action spaces, these methods cannot be applied in high-dimensional deep RL scenarios. As such, most contemporary RL relie…

Cited by 967SourcePDFScholar