226 search results - page 32 / 46 » Linear Bayesian Reinforcement Learning |
AUSAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
AAAI
2008
15 years 2 months ago
2008
We propose a novel method for approximate inference in Bayesian networks (BNs). The idea is to sample data from a BN, learn a latent tree model (LTM) from the data offline, and wh...
ML
2002
ACM
14 years 11 months ago
2002
ACM
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition o...
113
click to vote
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
ICML
2003
IEEE
16 years 17 days ago
2003
IEEE
In Reinforcement Learning (RL) there has been some experimental evidence that the residual gradient algorithm converges slower than the TD(0) algorithm. In this paper, we use the ...