Sciweavers

COLT
1998
Springer
13 years 9 months ago
Improved Boosting Algorithms using Confidence-Rated Predictions
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
Robert E. Schapire, Yoram Singer
COLT
1998
Springer
13 years 9 months ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
COLT
1998
Springer
13 years 9 months ago
Testing Problems with Sub-Learning Sample Complexity
Michael J. Kearns, Dana Ron
COLT
1998
Springer
13 years 9 months ago
Large Margin Classification Using the Perceptron Algorithm
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
Yoav Freund, Robert E. Schapire
COLT
1998
Springer
13 years 9 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
COLT
1998
Springer
13 years 9 months ago
Robust Learning Aided by Context
Empirical studies of multitask learning provide some evidence that the performance of a learning system on its intended targets improves by presenting to the learning system relat...
John Case, Sanjay Jain, Matthias Ott, Arun Sharma,...
COLT
1998
Springer
13 years 9 months ago
Cross-Validation for Binary Classification by Real-Valued Functions: Theoretical Analysis
This paper concerns the use of real-valued functions for binary classification problems. Previous work in this area has concentrated on using as an error estimate the `resubstitut...
Martin Anthony, Sean B. Holden
COLT
1998
Springer
13 years 9 months ago
The Query Complexity of Finding Local Minima in the Lattice
Amos Beimel, Felix Geller, Eyal Kushilevitz