Sciweavers

60 search results - page 8 / 12
» Iteratively Extending Time Horizon Reinforcement Learning
Sort
View
IAT
2008
IEEE
14 years 1 months ago
Introducing Communication in Dis-POMDPs with Locality of Interaction
The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has ...
Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Y...
KBSE
2005
IEEE
14 years 1 months ago
Learning to verify branching time properties
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
Abhay Vardhan, Mahesh Viswanathan
IJCNN
2007
IEEE
14 years 1 months ago
On Extending the SMO Algorithm Sub-Problem
—The Support Vector Machine is a widely employed machine learning model due to its repeatedly demonstrated superior generalization performance. The Sequential Minimal Optimizatio...
Christopher Sentelle, Michael Georgiopoulos, Georg...
ICML
2009
IEEE
14 years 8 months ago
Near-Bayesian exploration in polynomial time
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
J. Zico Kolter, Andrew Y. Ng
IIE
2007
63views more  IIE 2007»
13 years 7 months ago
Investigation of Q-Learning in the Context of a Virtual Learning Environment
We investigate the possibility to apply a known machine learning algorithm of Q-learning in the domain of a Virtual Learning Environment (VLE). It is important in this problem doma...
Dalia Baziukaite