In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed āmanifold-motivatedā...
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...
In the machine learning community it is generally believed that graph Laplacians corresponding to a ļ¬nite sample of data points converge to a continuous Laplace operator if the s...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...