Sciweavers

393 search results - page 6 / 79
» On the Convergence of Boosting Procedures
Sort
View
COLT
1999
Springer
13 years 11 months ago
Boosting as Entropy Projection
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...
Jyrki Kivinen, Manfred K. Warmuth
JRTIP
2010
137views more  JRTIP 2010»
13 years 2 months ago
Cascaded online boosting
In this paper, we propose a cascaded version of the online boosting algorithm to speed-up the execution time and guarantee real-time performance even when employing a large number ...
Ingrid Visentini, Lauro Snidaro, Gian Luca Foresti
NIPS
2007
13 years 8 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
CORR
2011
Springer
127views Education» more  CORR 2011»
12 years 11 months ago
Generalized Boosting Algorithms for Convex Optimization
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
Alexander Grubb, J. Andrew Bagnell
CIRA
2007
IEEE
274views Robotics» more  CIRA 2007»
14 years 1 months ago
Adaptive Object Tracking using Particle Swarm Optimization
—This paper presents an automatic object detection and tracking algorithm by using particle swarm optimization (PSO) based method, which is a searching algorithm inspired by the ...
Yuhua Zheng, Yan Meng