ntp

Neural Task Programming

This project is maintained by StanfordVL

Neural Task Programming:
Learning to Generalize Across Hierarchical Tasks

Danfei Xu*, Suraj Nair*, Yuke Zhu, Julian Gao, Animesh Garg, Li Fei-Fei, Silvio Savarese

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.

Arxiv 1710.01813

Network implementation details

Click here for video: Alt text


Support or Contact

Danfei Xu, Yuke Zhu, Animesh Garg

* These authors contributed equally to the paper