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.

Julian Gao

dblp:207/7606 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

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
Motion planning and robot control · 33% Robot manipulation · 33% Planning, search and constraint satisfaction · 33%
Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation › learning from demonstration
few-shot learning from demonstration
0.312018
Neural Task Programming: Learning to Generalize Across Hierarchical Tasks · ICRA 2018
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › hierarchical planning
hierarchical task decomposition
0.312018
Neural Task Programming: Learning to Generalize Across Hierarchical Tasks · ICRA 2018
Robotics › Motion planning and robot control
robot learning
0.312018
Neural Task Programming: Learning to Generalize Across Hierarchical Tasks · ICRA 2018
Program synthesis and code generation › inductive program synthesis
neural program induction
0.112018
Neural Task Programming: Learning to Generalize Across Hierarchical Tasks · ICRA 2018

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

neural program induction · 0.7hierarchical neural program · 0.7few-shot learning · 0.7
YearPublicationVenuePosition
2018 Neural Task Programming: Learning to Generalize Across Hierarchical Tasks
abstract
In this work, we propose a novel robot learning framework called Neural Task Programming (NTP), which bridges the idea of few-shot learning from demonstration and neural program induction. NTP takes as input a task specification (e.g., video demonstration of a task) and recursively decomposes it into finer sub-task specifications. These specifications are fed to a hierarchical neural program, where bottom-level programs are callable subroutines that interact with the environment. We validate our method in three robot manipulation tasks. NTP achieves strong generalization across sequential tasks that exhibit hierarchal and compositional structures. The experimental results show that NTP learns to generalize well towards unseen tasks with increasing lengths, variable topologies, and changing objectives.stanfordvl.github.io/ntp/.
Danfei Xu, Suraj Nair 0003, Yuke Zhu, Julian Gao, Animesh Garg, Li Fei-Fei 0001, Silvio Savarese
ICRA4