Sciweavers

1393 search results - page 128 / 279
» Machine Learning by Function Decomposition
Sort
View
ICML
2009
IEEE
16 years 2 months ago
Robust feature extraction via information theoretic learning
In this paper, we present a robust feature extraction framework based on informationtheoretic learning. Its formulated objective aims at simultaneously maximizing the Renyi's...
Xiaotong Yuan, Bao-Gang Hu
ICML
2002
IEEE
16 years 2 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton
ICML
1994
IEEE
15 years 5 months ago
Markov Games as a Framework for Multi-Agent Reinforcement Learning
In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function....
Michael L. Littman
ICML
2007
IEEE
16 years 2 months ago
Parameter learning for relational Bayesian networks
We present a method for parameter learning in relational Bayesian networks (RBNs). Our approach consists of compiling the RBN model into a computation graph for the likelihood fun...
Manfred Jaeger
ECML
2007
Springer
15 years 5 months ago
Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
Gerhard Neumann, Michael Pfeiffer, Wolfgang Maass