Cantitate/Preț
Produs

Adaptive Representations for Reinforcement Learning: Studies in Computational Intelligence, cartea 291

Autor Shimon Whiteson
en Limba Engleză Paperback – 14 noi 2014
This book presents new algorithms for reinforcement learning, a form of machine learning in which an autonomous agent seeks a control policy for a sequential decision task. Since current methods typically rely on manually designed solution representations, agents that automatically adapt their own representations have the potential to dramatically improve performance. This book introduces two novel approaches for automatically discovering high-performing representations. The first approach synthesizes temporal difference methods, the traditional approach to reinforcement learning, with evolutionary methods, which can learn representations for a broad class ofoptimization problems. This synthesis is accomplished by customizing evolutionarymethods to the on-line nature of reinforcement learning and using them to evolve representations for value function approximators.The second approach automatically learns representations based on piecewise-constant approximations of value functions. It begins with coarse representations and gradually refines them during learning, analyzing the current policy and value function to deduce the best refinements. This book also introduces a novel method for devising input representations. This method addresses the feature selection problem by extending an algorithm that evolves the topology and weights of neural networks such that it evolves their inputs too.In addition to introducing these new methods, this book presents extensive empirical results in multiple domains demonstrating that these techniques can substantially improve performance over methodswith manual representations.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 62449 lei  43-57 zile
  Springer Berlin, Heidelberg – 14 noi 2014 62449 lei  43-57 zile
Hardback (1) 62965 lei  43-57 zile
  Springer Berlin, Heidelberg – 5 oct 2010 62965 lei  43-57 zile

Din seria Studies in Computational Intelligence

Preț: 62449 lei

Preț vechi: 78061 lei
-20% Nou

Puncte Express: 937

Preț estimativ în valută:
11951 12414$ 9927£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642422317
ISBN-10: 3642422314
Pagini: 132
Ilustrații: XIII, 116 p.
Dimensiuni: 155 x 235 x 7 mm
Greutate: 0.2 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Studies in Computational Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Part 1 Introduction.- Part 2 Reinforcement Learning.- Part 3 On-Line Evolutionary Computation.- Part 4 Evolutionary Function Approximation.- Part 5 Sample-Efficient Evolutionary Function Approximation.- Part 6 Automatic Feature Selection for Reinforcement Learning.- Part 7 Adaptive Tile Coding.- Part 8 RelatedWork.- Part 9 Conclusion.- Part 10 Statistical Significance.

Textul de pe ultima copertă

This book presents new algorithms for reinforcement learning, a form of machine learning in which an autonomous agent seeks a control policy for a sequential decision task. Since current methods typically rely on manually designed solution representations, agents that automatically adapt their own representations have the potential to dramatically improve performance. This book introduces two novel approaches for automatically discovering high-performing representations. The first approach synthesizes temporal difference methods, the traditional approach to reinforcement learning, with evolutionary methods, which can learn representations for a broad class ofoptimization problems. This synthesis is accomplished by customizing evolutionarymethods to the on-line nature of reinforcement learning and using them to evolve representations for value function approximators.The second approach automatically learns representations based on piecewise-constant approximations of value functions. It begins with coarse representations and gradually refines them during learning, analyzing the current policy and value function to deduce the best refinements. This book also introduces a novel method for devising input representations. This method addresses the feature selection problem by extending an algorithm that evolves the topology and weights of neural networks such that it evolves their inputs too.In addition to introducing these new methods, this book presents extensive empirical results in multiple domains demonstrating that these techniques can substantially improve performance over methodswith manual representations.

Caracteristici

Recent research in Adaptive Representations for Reinforcement Learning Written by leading experts in this field State-of-the Art book