Sciweavers

2011 search results - page 335 / 403
» Universal Reinforcement Learning
Sort
View
ATAL
2008
Springer
13 years 10 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
NIPS
1993
13 years 9 months ago
Convergence of Stochastic Iterative Dynamic Programming Algorithms
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
Tommi Jaakkola, Michael I. Jordan, Satinder P. Sin...
ICML
2010
IEEE
13 years 9 months ago
Inverse Optimal Control with Linearly-Solvable MDPs
We present new algorithms for inverse optimal control (or inverse reinforcement learning, IRL) within the framework of linearlysolvable MDPs (LMDPs). Unlike most prior IRL algorit...
Dvijotham Krishnamurthy, Emanuel Todorov
PEPM
2011
ACM
12 years 11 months ago
Adaptation-based programming in java
Writing deterministic programs is often difficult for problems whose optimal solutions depend on unpredictable properties of the programs’ inputs. Difficulty is also encounter...
Tim Bauer, Martin Erwig, Alan Fern, Jervis Pinto
ALT
2004
Springer
14 years 5 months ago
New Revision Algorithms
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
Judy Goldsmith, Robert H. Sloan, Balázs Sz&...