Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performance on motor skill tasks. However, such hierarchical structures cannot be exploited by current policy search algorithms. We concentrate on a basic, but highly relevant hierarchy — the `mixed option’ policy. Here, a gating network first decides which of the options to execute and, subsequently, the option-policy determines the action. Using a hierarchical setup for our learning method allows us to learn not only one solution to a problem but many. We base our algorithm on a recently proposed information theoretic policy search method, which addresses the exploitation-exploration trade-off by limiting the loss of information between policy updates.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Many real-world problems are inherently hierarchically structured. The use of this structure in an agent’s policy may well be the key to improved scalability and higher performance on motor skill tasks. However, such hierarchical structures cannot be exploited by current policy search algorithms. We concentrate on a basic, but highly relevant hierarchy — the `mixed option’ policy. Here, a gating network first decides which of the options to execute and, subsequently, the option-policy determines the action. Using a hierarchical setup for our learning method allows us to learn not only one solution to a problem but many. We base our algorithm on a recently proposed information theoretic policy search method, which addresses the exploitation-exploration trade-off by limiting the loss of information between policy updates.
Christian Daniel studied computational engineering at Technische Universitaet Darmstadt and EPFL Lausanne and is pursuing a PhD in Robot Learning. His research focuses on developing new learning algorithms for autonomous robots, especially in the field of robot skill learning and hierarchical reinforcement learning.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Many real-world problems are inherently hierarchically structured. The use of this structure in an agent's policy may well be the key to improved scalability and higher performance on motor skill tasks. However, such hierarchical structures cannot be exploited by current policy search algorithms. We concentrate on a basic, but highly relevant hierarchy - the `mixed option' policy. Here, a gating network first decides which of the options to execute and, subsequently, the option-policy determines the action. Using a hierarchical setup for our learning method allows us to learn not only one solution to a problem but many. We base our algorithm on a recently proposed information theoretic policy search method, which addresses the exploitation-exploration trade-off by limiting the loss of information between policy updates. 68 pp. Englisch. N° de réf. du vendeur 9783639475999
Quantité disponible : 2 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 68. N° de réf. du vendeur 26127669343
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. 68 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. N° de réf. du vendeur 132885376
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND pp. 68. N° de réf. du vendeur 18127669333
Quantité disponible : 4 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Daniel ChristianChristian Daniel studied computational engineering at Technische Universitaet Darmstadt and EPFL Lausanne and is pursuing a PhD in Robot Learning. His research focuses on developing new learning algorithms for autonom. N° de réf. du vendeur 4991377
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Many real-world problems are inherently hierarchically structured. The use of this structure in an agent's policy may well be the key to improved scalability and higher performance on motor skill tasks. However, such hierarchical structures cannot be exploited by current policy search algorithms. We concentrate on a basic, but highly relevant hierarchy - the `mixed option' policy. Here, a gating network first decides which of the options to execute and, subsequently, the option-policy determines the action. Using a hierarchical setup for our learning method allows us to learn not only one solution to a problem but many. We base our algorithm on a recently proposed information theoretic policy search method, which addresses the exploitation-exploration trade-off by limiting the loss of information between policy updates.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 68 pp. Englisch. N° de réf. du vendeur 9783639475999
Quantité disponible : 1 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Many real-world problems are inherently hierarchically structured. The use of this structure in an agent's policy may well be the key to improved scalability and higher performance on motor skill tasks. However, such hierarchical structures cannot be exploited by current policy search algorithms. We concentrate on a basic, but highly relevant hierarchy - the `mixed option' policy. Here, a gating network first decides which of the options to execute and, subsequently, the option-policy determines the action. Using a hierarchical setup for our learning method allows us to learn not only one solution to a problem but many. We base our algorithm on a recently proposed information theoretic policy search method, which addresses the exploitation-exploration trade-off by limiting the loss of information between policy updates. N° de réf. du vendeur 9783639475999
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. Hierarchical Relative Entropy Policy Search | An Information Theoretic Learning Algorithm in Multimodal Solution Spaces for Real Robots | Christian Daniel (u. a.) | Taschenbuch | 68 S. | Englisch | 2015 | AV Akademikerverlag | EAN 9783639475999 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. N° de réf. du vendeur 105502707
Quantité disponible : 5 disponible(s)