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 re?ected 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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 6148425-n
Quantité disponible : Plus de 20 disponibles
Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis
Paperback or Softback. Etat : New. Abstraction in Reinforcement Learning. Book. N° de réf. du vendeur BBS-9783639136524
Quantité disponible : 5 disponible(s)
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9783639136524
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du vendeur L0-9783639136524
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783639136524_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783639136524
Quantité disponible : 10 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 6148425-n
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Girgin SertanSertan Girgin received his Ph.D. degree in Computer Engineeringnfrom Middle East Technical University, Turkey in 2007 and holds andouble major in Mathematics. His research interests includenReinforcement Learning, Distri. N° de réf. du vendeur 4960751
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Reinforcement learning is the problem faced by anagent that must learn behavior throughtrial-and-error interactions with a dynamicenvironment. Usually, the problem to be solvedcontains subtasks that repeat at different regions ofthe state space. Without any guidancean agent has to learn the solutions of all subtaskinstances independently, which in turn degrades theperformance of the learning process. In this work, wepropose two novel approaches for building theconnections between different regions of the searchspace. The first approach efficiently discoversabstractions in the form of conditionally terminatingsequences and represents these abstractions compactlyas a single tree structure; this structure is thenused to determine the actions to be executed by theagent. In the second approach, a similarity functionbetween states is defined based on the number ofcommon action sequences; by using this similarityfunction, updates on the action-value function of astate are re ected to all similar states that allowsexperience acquired during learning be applied to abroader context. The effectiveness of both approachesis demonstrated empirically over various domains. N° de réf. du vendeur 9783639136524
Quantité disponible : 2 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Abstraction in Reinforcement Learning | Using Option Discovery and State Similarity | Sertan Girgin | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2009 | VDM Verlag Dr. Müller | EAN 9783639136524 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]akademikerverlag[dot]de | Anbieter: preigu. N° de réf. du vendeur 101639624
Quantité disponible : 5 disponible(s)