pith. sign in

arxiv: 1611.06824 · v3 · pith:IV6IQ7MMnew · submitted 2016-11-21 · 💻 cs.LG · cs.AI

Options Discovery with Budgeted Reinforcement Learning

classification 💻 cs.LG cs.AI
keywords learningoptionsbudgetedablebonndifferentdiscovermodel
0
0 comments X
read the original abstract

We consider the problem of learning hierarchical policies for Reinforcement Learning able to discover options, an option corresponding to a sub-policy over a set of primitive actions. Different models have been proposed during the last decade that usually rely on a predefined set of options. We specifically address the problem of automatically discovering options in decision processes. We describe a new learning model called Budgeted Option Neural Network (BONN) able to discover options based on a budgeted learning objective. The BONN model is evaluated on different classical RL problems, demonstrating both quantitative and qualitative interesting results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Learning World Graphs to Accelerate Hierarchical Reinforcement Learning

    cs.LG 2019-07 unverdicted novelty 6.0

    A two-stage framework learns a world graph of pivotal states task-agnostically via joint training of a latent model and curiosity-driven policy, then uses the graph to accelerate hierarchical RL on maze tasks.