activity
20152026
most citedConditional Computation in Neural Networks for faster models

143 citations · 308 across the 55 of their papers we have counts for

collaborators
Showing 2017Show all

5 papers · 1 filter

cs.AI2017

Learning with Options that Terminate Off-Policy

Anna Harutyunyan, Peter Vrancx, Pierre-Luc Bacon +2

A temporally abstract action, or an option, is specified by a policy and a termination condition: the policy guides option behavior, and the termination condition roughly determine…

cs.LG2017★ 34 cited

Learnings Options End-to-End for Continuous Action Tasks

Martin Klissarov, Pierre-Luc Bacon, Jean Harb +1

We present new results on learning temporally extended actions for continuoustasks, using the options framework (Suttonet al.[1999b], Precup [2000]). In orderto achieve this goal w…

cs.AI2017

When Waiting is not an Option : Learning Options with a Deliberation Cost

Jean Harb, Pierre-Luc Bacon, Martin Klissarov +1

Recent work has shown that temporally extended actions (options) can be learned fully end-to-end as opposed to being specified in advance. While the problem of "how" to learn optio…

cs.LG2017

OptionGAN: Learning Joint Reward-Policy Options using Generative Adversarial Inverse Reinforcement Learning

Peter Henderson, Wei-Di Chang, Pierre-Luc Bacon +3

Reinforcement learning has shown promise in learning policies that can solve complex problems. However, manually specifying a good reward function can be difficult, especially for…

cs.LG2017★ 24 cited

Convergent Tree Backup and Retrace with Function Approximation

Ahmed Touati, Pierre-Luc Bacon, Doina Precup +1

Off-policy learning is key to scaling up reinforcement learning as it allows to learn about a target policy from the experience generated by a different behavior policy. Unfortunat…