3694 search results - page 220 / 739 » Stochastic complexity in learning |
149
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
This paper addresses the problem of constructing good action selection policies for agents acting in partially observable environments, a class of problems generally known as Part...
111
click to vote
NIPS
2003
15 years 5 months ago
2003
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
134
click to vote
SIGPRO
2008
15 years 4 months ago
2008
The LMS algorithm is one of the most popular learning algorithms for identifying an unknown system. Many variants of the algorithm have been developed based on different problem f...
154
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
Multiarmed bandit problem is a typical example of a dilemma between exploration and exploitation in reinforcement learning. This problem is expressed as a model of a gambler playi...
136
click to vote
JAIR
2011
14 years 11 months ago
2011
Markovian processes have long been used to model stochastic environments. Reinforcement learning has emerged as a framework to solve sequential planning and decision-making proble...