Sciweavers

1062 search results - page 140 / 213
» Sublinear Optimization for Machine Learning
Sort
View
ICML
2009
IEEE
16 years 3 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
ICML
2009
IEEE
16 years 3 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
13 years 9 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
ICML
2006
IEEE
16 years 3 months ago
Probabilistic inference for solving discrete and continuous state Markov Decision Processes
Inference in Markov Decision Processes has recently received interest as a means to infer goals of an observed action, policy recognition, and also as a tool to compute policies. ...
Marc Toussaint, Amos J. Storkey
ICML
2005
IEEE
16 years 3 months ago
Multimodal oriented discriminant analysis
Linear discriminant analysis (LDA) has been an active topic of research during the last century. However, the existing algorithms have several limitations when applied to visual d...
Fernando De la Torre, Takeo Kanade