143 search results - page 10 / 29 » Generalization Error and Algorithmic Convergence of Median B... |
100
click to vote
ICML
2010
IEEE
15 years 20 days ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
207
click to vote
OL
2011
14 years 6 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
COLT
1998
Springer
15 years 3 months ago
1998
Springer
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...
112
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
ALT
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...