Sciweavers

COLT
2005
Springer
13 years 10 months ago
Separating Models of Learning from Correlated and Uncorrelated Data
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andr...
COLT
2005
Springer
13 years 10 months ago
Improved Second-Order Bounds for Prediction with Expert Advice
Nicolò Cesa-Bianchi, Yishay Mansour, Gilles...
COLT
2005
Springer
13 years 10 months ago
Approximating a Gram Matrix for Improved Kernel-Based Learning
Petros Drineas, Michael W. Mahoney
COLT
2005
Springer
13 years 10 months ago
Variations on U-Shaped Learning
The paper deals with the following problem: is returning to wrong conjectures necessary to achieve full power of algorithmic learning? Returning to wrong conjectures complements t...
Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Fra...
COLT
2005
Springer
13 years 10 months ago
A PAC-Style Model for Learning from Labeled and Unlabeled Data
Abstract. There has been growing interest in practice in using unlabeled data together with labeled data in machine learning, and a number of different approaches have been develo...
Maria-Florina Balcan, Avrim Blum
COLT
2005
Springer
13 years 10 months ago
Competitive Collaborative Learning
Baruch Awerbuch, Robert D. Kleinberg
COLT
2005
Springer
13 years 10 months 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
13 years 10 months ago
Learning a Hidden Hypergraph
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
Dana Angluin, Jiang Chen
COLT
2005
Springer
13 years 10 months 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
13 years 10 months ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth