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...
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 ...
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...
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...
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,...