Sciweavers

1405 search results - page 145 / 281
» Learning Instance-Specific Predictive Models
Sort
View
NIPS
2001
13 years 10 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr
IJCAI
2003
13 years 10 months ago
When Discriminative Learning of Bayesian Network Parameters Is Easy
Bayesian network models are widely used for discriminative prediction tasks such as classification. Usually their parameters are determined using 'unsupervised' methods ...
Hannes Wettig, Peter Grünwald, Teemu Roos, Pe...
NIPS
2008
13 years 10 months ago
Stochastic Relational Models for Large-scale Dyadic Data using MCMC
Stochastic relational models (SRMs) [15] provide a rich family of choices for learning and predicting dyadic data between two sets of entities. The models generalize matrix factor...
Shenghuo Zhu, Kai Yu, Yihong Gong
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 10 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
ECML
2003
Springer
14 years 2 months ago
Logistic Model Trees
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
Niels Landwehr, Mark Hall, Eibe Frank