about
Learning Plannable Representations with Causal InfoGAN [pdf] (arxiv.org)
3 points by stablemap on Jul 30, 2018 | hide | past | pdf | 1 comment on HN

In plain words: It learns a small set of changeable factors behind images, then plans a path through those factors and draws it back out as pictures. On rope manipulation, it produced plausible goal-reaching image sequences, which ordinary image generators can't do without a steerable state.

Abstract · Learning Plannable Representations with Causal InfoGAN

In recent years, deep generative models have been shown to 'imagine' convincing high-dimensional observations such as images, audio, and even video, learning directly from raw data. In this work, we ask how to imagine goal-directed visual plans -- a plausible sequence of observations that transition a dynamical system from its current configuration to a desired goal state, which can later be used as a reference trajectory for control. We focus on systems with high-dimensional observations, such as images, and propose an approach that naturally combines representation learning and planning. Our framework learns a generative model of sequential observations, where the generative process is induced by a transition in a low-dimensional planning model, and an additional noise. By maximizing the mutual information between the generated observations and the transition in the planning model, we obtain a low-dimensional representation that best explains the causal nature of the data. We structure the planning model to be compatible with efficient planning algorithms, and we propose several such models based on either discrete or continuous states. Finally, to generate a visual plan, we project the current and goal observations onto their respective states in the planning model, plan a trajectory, and then use the generative model to transform the trajectory to a sequence of observations. We demonstrate our method on imagining plausible visual plans of rope manipulation.

Thanard Kurutach, Aviv Tamar, Ge Yang, Stuart Russell, Pieter Abbeel
arXiv:1807.09341 · cs.LG, cs.AI, cs.CV, cs.NE, cs.RO, stat.ML · submitted Jul 24, 2018
abstract · pdf · html · ICML / IJCAI / AAMAS 2018 Workshop on Planning and Learning (PAL-18)

add comment on HN

This approach is very similar to a AAAI18 paper [1] that also finds a binary representation ("plannable representation") using VAEs and performs planning algorithms, but the difference is that they included some experiments for continuous abstract states. I personally prefer VAEs because GANs are hard to train.

[1] arxiv.org/abs/1705.00154