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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Albert Zhan

dblp:258/1288 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 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
1 paper
Reinforcement learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › imitation learning
few-shot imitation learning
0.612022
Hierarchical Few-Shot Imitation with Skill Transition Models · ICLR 2022
Machine learning › Reinforcement learning
imitation learning
0.612022
Hierarchical Few-Shot Imitation with Skill Transition Models · ICLR 2022
Machine learning › Reinforcement learning › hierarchical reinforcement learning
skill learning
0.612022
Hierarchical Few-Shot Imitation with Skill Transition Models · ICLR 2022

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

skill transition models · 0.6hierarchical learning · 0.6
YearPublicationVenuePosition
2022 Hierarchical Few-Shot Imitation with Skill Transition Models
Kourosh Hakhamaneshi, Ruihan Zhao 0001, Albert Zhan, Pieter Abbeel, Michael Laskin
ICLR3
2022 Learning Visual Robotic Control Efficiently with Contrastive Pre-training and Data Augmentation
abstract
Recent advances in unsupervised representation learning significantly improved the sample efficiency of training Reinforcement Learning policies in simulated environments. However, similar gains have not yet been seen for real-robot reinforcement learning. In this work, we focus on enabling data-efficient real-robot learning from pixels. We present Contrastive Pre-training and Data Augmentation for Efficient Robotic Learning (CoDER), a method that utilizes data augmentation and unsupervised learning to achieve sample-efficient training of real-robot arm policies from sparse rewards. While contrastive pre-training, data augmentation, demonstrations, and reinforcement learning are alone insufficient for efficient learning, our main contribution is showing that the combination of these disparate techniques results in a simple yet data-efficient method. We show that, given only 10 demonstrations, a single robotic arm can learn sparse-reward manipulation policies from pixels, such as reaching, picking, moving, pulling a large object, flipping a switch, and opening a drawer in just 30 minutes of mean real-world training time. We include videos and code on the project website: https://sites.google.com/view/efficient-robotic-manipulation/home.
Albert Zhan, Ruihan Zhao 0001, Lerrel Pinto, Pieter Abbeel, Michael Laskin
IROS1