Neural Task Programming: Learning to Generalize Across Hierarchical Tasks

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

212 citations recorded by the source corpus.

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/.

Subfields: Artificial Intelligence, Control and Systems Engineering, Reinforcement Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Chelsea Finn
  3. Pieter Abbeel
  4. Li Fei-Fei
  5. Yoshua Bengio
  6. Abhinav Kumar Gupta
  7. Trevor Darrell
  8. Ruslan Salakhutdinov

In Control and Systems Engineering

  1. Sergey Levine
  2. Chelsea Finn
  3. Pieter Abbeel
  4. Dieter Fox
  5. Silvio Savarese
  6. Yuke Zhu
  7. Li Fei-Fei
  8. Abhinav Kumar Gupta

In Reinforcement Learning

  1. Sergey Levine
  2. Chelsea Finn
  3. Pieter Abbeel
  4. Dieter Fox
  5. Abhinav Kumar Gupta
  6. Karol Hausman
  7. Silvio Savarese
  8. Abhishek Gupta

Citations in the corpus