Skip to Main content Skip to Navigation
Conference papers

Basis Function Construction in Reinforcement Learning using Cascade-Correlation Learning Architecture

Sertan Girgin 1 Philippe Preux 1, 2, 3
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
Abstract : In reinforcement learning, it is a common practice to map the state(-action) space to a different one using ba- sis functions. This transformation aims to represent the input data in a more informative form that facilitates and improves subsequent steps. As a "good" set of basis func- tions result in better solutions and defining such functions becomes a challenge with increasing problem complexity, it is beneficial to be able to generate them automatically. In this paper, we propose a new approach based on Bellman residual for constructing basis functions using cascade- correlation learning architecture. We show how this ap- proach can be applied to Least Squares Policy Iteration al- gorithm in order to obtain a better approximation of the value function, and consequently improve the performance of the resulting policies. We also present the effectiveness of the method empirically on some benchmark problems.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Preux Philippe Connect in order to contact the contributor
Submitted on : Monday, May 27, 2013 - 3:39:03 PM
Last modification on : Thursday, January 20, 2022 - 4:12:29 PM
Long-term archiving on: : Tuesday, September 3, 2013 - 9:41:48 AM


Files produced by the author(s)


  • HAL Id : hal-00826054, version 1



Sertan Girgin, Philippe Preux. Basis Function Construction in Reinforcement Learning using Cascade-Correlation Learning Architecture. International Conference on Machine Learning and Applications, Dec 2008, San Diego, United States. pp.75-82. ⟨hal-00826054⟩



Les métriques sont temporairement indisponibles