Sciweavers

283 search results - page 14 / 57
» Abstracting Reusable Cases from Reinforcement Learning
Sort
View
102
Voted
ML
2008
ACM
152views Machine Learning» more  ML 2008»
14 years 9 months ago
Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path
Abstract. We consider batch reinforcement learning problems in continuous space, expected total discounted-reward Markovian Decision Problems. As opposed to previous theoretical wo...
András Antos, Csaba Szepesvári, R&ea...
ICCBR
2005
Springer
15 years 3 months ago
Opportunities for CBR in Learning by Doing
In this paper we partially describe JV2 M, a metaphorical simulation of the Java Virtual Machine where students can learn Java language compilation and reinforce object-oriented pr...
Pedro Pablo Gómez-Martín, Marco Anto...
IJCAI
2007
14 years 11 months ago
Utile Distinctions for Relational Reinforcement Learning
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
William Dabney, Amy McGovern
ICCBR
2010
Springer
15 years 1 months ago
Reducing the Memory Footprint of Temporal Difference Learning over Finitely Many States by Using Case-Based Generalization
In this paper we present an approach for reducing the memory footprint requirement of temporal difference methods in which the set of states is finite. We use case-based generaliza...
Matt Dilts, Héctor Muñoz-Avila
DIS
2009
Springer
15 years 4 months ago
OMFP: An Approach for Online Mass Flow Prediction in CFB Boilers
Abstract. Fuel feeding and inhomogeneity of fuel typically cause process fluctuations in the circulating fluidized bed (CFB) boilers. If control systems fail to compensate the ï¬...
Indre Zliobaite, Jorn Bakker, Mykola Pechenizkiy