Sciweavers

539 search results - page 73 / 108
» Learning Monotonic Linear Functions
Sort
View
NIPS
2008
13 years 11 months ago
An Extended Level Method for Efficient Multiple Kernel Learning
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
Zenglin Xu, Rong Jin, Irwin King, Michael R. Lyu
JMLR
2006
125views more  JMLR 2006»
13 years 10 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
JMLR
2007
137views more  JMLR 2007»
13 years 10 months ago
Building Blocks for Variational Bayesian Learning of Latent Variable Models
We introduce standardised building blocks designed to be used with variational Bayesian learning. The blocks include Gaussian variables, summation, multiplication, nonlinearity, a...
Tapani Raiko, Harri Valpola, Markus Harva, Juha Ka...
COLT
1999
Springer
14 years 2 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
ICPR
2008
IEEE
14 years 11 months ago
Multiple kernel learning from sets of partially matching image features
Abstract: Kernel classifiers based on Support Vector Machines (SVM) have achieved state-ofthe-art results in several visual classification tasks, however, recent publications and d...
Guo ShengYang, Min Tan, Si-Yao Fu, Zeng-Guang Hou,...