252 search results - page 24 / 51 » Learning Partially Observable Action Models: Efficient Algor... |
141
Voted
JMLR
2002
15 years 2 months ago
2002
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
146
Voted
NIPS
2007
15 years 4 months ago
2007
Bayesian Reinforcement Learning has generated substantial interest recently, as it provides an elegant solution to the exploration-exploitation trade-off in reinforcement learning...
134
Voted
ATVA
2008
Springer
15 years 4 months ago
2008
Springer
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
118
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
138
Voted
JIRS
2000
15 years 2 months ago
2000
Agents (hardware or software) that act autonomously in an environment have to be able to integrate three basic behaviors: planning, execution, and learning. This integration is man...