Sciweavers

COLT
2001
Springer
14 years 1 days ago
Ultraconservative Online Algorithms for Multiclass Problems
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...
Koby Crammer, Yoram Singer
COLT
2001
Springer
14 years 1 days ago
Learning Rates for Q-Learning
In this paper we derive convergence rates for Q-learning. We show an interesting relationship between the convergence rate and the learning rate used in Q-learning. For a polynomi...
Eyal Even-Dar, Yishay Mansour
COLT
2001
Springer
14 years 1 days ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
COLT
2001
Springer
14 years 1 days ago
Learning Monotone DNF from a Teacher That Almost Does Not Answer Membership Queries
We present results concerning the learning of Monotone DNF (MDNF) from Incomplete Membership Queries and Equivalence Queries. Our main result is a new algorithm that allows effici...
Nader H. Bshouty, Nadav Eiron
COLT
2001
Springer
14 years 1 days 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
COLT
2001
Springer
14 years 1 days ago
Limitations of Learning via Embeddings in Euclidean Half-Spaces
The notion of embedding a class of dichotomies in a class of linear half spaces is central to the support vector machines paradigm. We examine the question of determining the mini...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
COLT
2001
Springer
14 years 1 days ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
COLT
2001
Springer
14 years 1 days ago
Tracking a Small Set of Experts by Mixing Past Posteriors
In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Olivier Bousquet, Manfred K. Warmuth
INEX
2009
Springer
14 years 4 days ago
An Exploration of Learning to Link with Wikipedia: Features, Methods and Training Collection
We describe our participation in the Link-the-Wiki track at INEX 2009. We apply machine learning methods to the anchor-to-best-entry-point task and explore the impact of the follow...
Jiyin He, Maarten de Rijke
GIS
2009
ACM
14 years 4 days ago
Machine learning approach to report prioritization with an application to travel time dissemination
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...
Piotr Szczurek, Bo Xu, Jie Lin, Ouri Wolfson