Sciweavers

2177 search results - page 11 / 436
» Relative Margin Machines
Sort
View
COLT
2008
Springer
13 years 9 months ago
On the Margin Explanation of Boosting Algorithms
Much attention has been paid to the theoretical explanation of the empirical success of AdaBoost. The most influential work is the margin theory, which is essentially an upper bou...
Liwei Wang, Masashi Sugiyama, Cheng Yang, Zhi-Hua ...
ICML
2005
IEEE
14 years 8 months ago
Building Sparse Large Margin Classifiers
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
Bernhard Schölkopf, Gökhan H. Bakir, Min...
NIPS
2001
13 years 8 months ago
Algorithmic Luckiness
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
Ralf Herbrich, Robert C. Williamson
ALT
2008
Springer
14 years 4 months ago
Entropy Regularized LPBoost
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...
Manfred K. Warmuth, Karen A. Glocer, S. V. N. Vish...
ICML
2007
IEEE
14 years 8 months ago
Approximate maximum margin algorithms with rules controlled by the number of mistakes
We present a family of incremental Perceptron-like algorithms (PLAs) with margin in which both the "effective" learning rate, defined as the ratio of the learning rate t...
Petroula Tsampouka, John Shawe-Taylor