HackerPapers

arXiv:1703.02660cs.LG

Towards Generalization and Simplicity in Continuous Control

Aravind Rajeswaran, Kendall Lowrey, Emanuel Todorov, Sham Kakade

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

This work shows that policies with simple linear and RBF parameterizations can be trained to solve a variety of continuous control tasks, including the OpenAI gym benchmarks. The performance of these trained policies are competitive with state of the art results, obtained with more elaborate parameterizations such as fully connected neural networks. Furthermore, existing training and testing scenarios are shown to be very limited and prone to over-fitting, thus giving rise to only trajectory-centric policies. Training with a diverse initial state distribution is shown to produce more global policies with better generalization. This allows for interactive control scenarios where the system recovers from large on-line perturbations; as shown in the supplementary video.

arXiv comments
NIPS 2017, Project page: https://sites.google.com/view/simple-pol
Journal reference
DOI
Subjects
cs.LGMachine Learning cs.AIArtificial Intelligence cs.RORobotics eess.SYSystems and Control (EESS)

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Dec 2017 to Dec 2017.

Comments linking this paper, per year.

Discussed in comments1 thread

    • https://arxiv.org/abs/1703.02660 Disclosure: I contributed to the linked work. To do simple tasks, you don’t even need neural networks, in short. If you want to do complex tasks, training the neural net isn’t the problem, but a NN can indeed represent more than say a linear…

      klowreyView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.