Sciweavers

995 search results - page 26 / 199
» Learning Useful Horn Approximations
Sort
View
COLT
1993
Springer
15 years 7 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung
143
Voted
PERVASIVE
2011
Springer
14 years 6 months ago
Using Decision-Theoretic Experience Sampling to Build Personalized Mobile Phone Interruption Models
We contribute a method for approximating users’ interruptibility costs to use for experience sampling and validate the method in an application that learns when to automatically ...
Stephanie Rosenthal, Anind K. Dey, Manuela M. Velo...
143
Voted
NIPS
2003
15 years 5 months ago
Perspectives on Sparse Bayesian Learning
Recently, relevance vector machines (RVM) have been fashioned from a sparse Bayesian learning (SBL) framework to perform supervised learning using a weight prior that encourages s...
David P. Wipf, Jason A. Palmer, Bhaskar D. Rao
143
Voted
ICONIP
2007
15 years 5 months ago
Natural Conjugate Gradient in Variational Inference
Variational methods for approximate inference in machine learning often adapt a parametric probability distribution to optimize a given objective function. This view is especially ...
Antti Honkela, Matti Tornio, Tapani Raiko, Juha Ka...
151
Voted

Publication
222views
16 years 18 days ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis