Sciweavers

5109 search results - page 11 / 1022
» On Learning Limiting Programs
Sort
View
AAAI
2008
14 years 4 days ago
Bayes-Relational Learning of Opponent Models from Incomplete Information in No-Limit Poker
We propose an opponent modeling approach for no-limit Texas hold-em poker that starts from a (learned) prior, i.e., general expectations about opponent behavior and learns a relat...
Marc J. V. Ponsen, Jan Ramon, Tom Croonenborghs, K...
AAMAS
2007
Springer
14 years 4 months ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
Peter Vrancx, Katja Verbeeck, Ann Nowé
ICANN
2009
Springer
14 years 1 months ago
Efficient Uncertainty Propagation for Reinforcement Learning with Limited Data
In a typical reinforcement learning (RL) setting details of the environment are not given explicitly but have to be estimated from observations. Most RL approaches only optimize th...
Alexander Hans, Steffen Udluft
ICML
2010
IEEE
13 years 11 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
ECML
2003
Springer
14 years 3 months ago
Learning Context Free Grammars in the Limit Aided by the Sample Distribution
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Yoav Seginer