Sciweavers

COLT
2008
Springer
13 years 6 months ago
Learning from Collective Behavior
Inspired by longstanding lines of research in sociology and related fields, and by more recent largepopulation human subject experiments on the Internet and the Web, we initiate a...
Michael Kearns, Jennifer Wortman
COLT
2008
Springer
13 years 6 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
COLT
2008
Springer
13 years 6 months ago
Linear Algorithms for Online Multitask Classification
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...
Giovanni Cavallanti, Nicolò Cesa-Bianchi, C...
COLT
2008
Springer
13 years 6 months ago
Model Selection and Stability in k-means Clustering
Clustering Stability methods are a family of widely used model selection techniques applied in data clustering. Their unifying theme is that an appropriate model should result in ...
Ohad Shamir, Naftali Tishby
COLT
2008
Springer
13 years 6 months ago
On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
Shai Shalev-Shwartz, Yoram Singer
COLT
2008
Springer
13 years 6 months ago
Relating Clustering Stability to Properties of Cluster Boundaries
In this paper, we investigate stability-based methods for cluster model selection, in particular to select the number K of clusters. The scenario under consideration is that clust...
Shai Ben-David, Ulrike von Luxburg
COLT
2008
Springer
13 years 6 months ago
Improved Guarantees for Learning via Similarity Functions
Maria-Florina Balcan, Avrim Blum, Nathan Srebro
COLT
2008
Springer
13 years 6 months ago
The True Sample Complexity of Active Learning
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
Maria-Florina Balcan, Steve Hanneke, Jennifer Wort...
COLT
2008
Springer
13 years 6 months ago
Learning in the Limit with Adversarial Disturbances
We study distribution-dependent, data-dependent, learning in the limit with adversarial disturbance. We consider an optimization-based approach to learning binary classifiers from...
Constantine Caramanis, Shie Mannor
COLT
2008
Springer
13 years 6 months ago
How Local Should a Learning Method Be?
We consider the question of why modern machine learning methods like support vector machines outperform earlier nonparametric techniques like kNN. Our approach investigates the lo...
Alon Zakai, Yaacov Ritov