Sciweavers

4498 search results - page 443 / 900
» How to Invent Functions
Sort
View
ICML
2007
IEEE
16 years 7 months ago
On one method of non-diagonal regularization in sparse Bayesian learning
In the paper we propose a new type of regularization procedure for training sparse Bayesian methods for classification. Transforming Hessian matrix of log-likelihood function to d...
Dmitry Kropotov, Dmitry Vetrov
ICML
2008
IEEE
16 years 7 months ago
Apprenticeship learning using linear programming
In apprenticeship learning, the goal is to learn a policy in a Markov decision process that is at least as good as a policy demonstrated by an expert. The difficulty arises in tha...
Umar Syed, Michael H. Bowling, Robert E. Schapire
ICML
2008
IEEE
16 years 7 months ago
Large scale manifold transduction
We show how the regularizer of Transductive Support Vector Machines (TSVM) can be trained by stochastic gradient descent for linear models and multi-layer architectures. The resul...
Michael Karlen, Jason Weston, Ayse Erkan, Ronan Co...
ICML
2005
IEEE
16 years 7 months ago
Supervised clustering with support vector machines
Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn ho...
Thomas Finley, Thorsten Joachims
ICML
2005
IEEE
16 years 7 months ago
Learning discontinuities with products-of-sigmoids for switching between local models
Sensorimotor data from many interesting physical interactions comprises discontinuities. While existing locally weighted learning approaches aim at learning smooth functions, we p...
Marc Toussaint, Sethu Vijayakumar