2634 search results - page 380 / 527 » Argument based machine learning |
COLT
2001
Springer
14 years 1 months ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
COLT
2000
Springer
14 years 1 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
COLT
1999
Springer
14 years 1 months ago
1999
Springer
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
COLT
1998
Springer
14 years 1 months ago
1998
Springer
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...
COLT
1997
Springer
14 years 1 months ago
1997
Springer
Abstract. We propose a convex optimization approach to solving the nonparametric regression estimation problem when the underlying regression function is Lipschitz continuous. This...