Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Abstraction in Reinforcement Learning

Abstraction in Reinforcement Learning

Girgin, Sertan

Paperback

General Computers

ISBN10: 3639136527
ISBN13: 9783639136524
Publisher: Blues Kids Of Amer
Published: Mar 19 2009
Pages: 104
Weight: 0.36
Height: 0.25 Width: 6.00 Depth: 9.00
Language: English
Reinforcement learning is the problem faced by an agent that must learn behavior through trial-and-error interactions with a dynamic environment. Usually, the problem to be solved contains subtasks that repeat at different regions of the state space. Without any guidance an agent has to learn the solutions of all subtask instances independently, which in turn degrades the performance of the learning process. In this work, we propose two novel approaches for building the connections between different regions of the search space. The first approach efficiently discovers abstractions in the form of conditionally terminating sequences and represents these abstractions compactly as a single tree structure; this structure is then used to determine the actions to be executed by the agent. In the second approach, a similarity function between states is defined based on the number of common action sequences; by using this similarity function, updates on the action-value function of a state are reflected to all similar states that allows experience acquired during learning be applied to a broader context. The effectiveness of both approaches is demonstrated empirically over various domains.

Also in

General Computers

View All