Sciweavers

34 search results - page 4 / 7
» colt 2005
Sort
View
COLT
2005
Springer
14 years 7 days ago
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
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ā€...
Mikhail Belkin, Partha Niyogi
COLT
2005
Springer
14 years 7 days ago
Learning Convex Combinations of Continuously Parameterized Basic Kernels
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...
COLT
2005
Springer
14 years 5 days ago
Ranking and Scoring Using Empirical Risk Minimization
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...
Stéphan Clémençon, Gáb...
COLT
2005
Springer
14 years 7 days ago
From Graphs to Manifolds - Weak and Strong Pointwise Consistency of Graph Laplacians
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...
COLT
2001
Springer
13 years 11 months ago
Agnostic Boosting
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...
Shai Ben-David, Philip M. Long, Yishay Mansour