Sciweavers

406 search results - page 1 / 82
» Boosting Using Branching Programs
Sort
View
COLT
2000
Springer
13 years 9 months ago
Boosting Using Branching Programs
Yishay Mansour, David A. McAllester
COLT
2005
Springer
13 years 10 months ago
Martingale Boosting
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
Philip M. Long, Rocco A. Servedio
ISPASS
2009
IEEE
13 years 11 months ago
Experiment flows and microbenchmarks for reverse engineering of branch predictor structures
Insights into branch predictor organization and operation can be used in architecture-aware compiler optimizations to improve program performance. Unfortunately, such details are ...
Vladimir Uzelac, Aleksandar Milenkovic
ICML
2008
IEEE
14 years 5 months ago
Random classification noise defeats all convex potential boosters
A broad class of boosting algorithms can be interpreted as performing coordinate-wise gradient descent to minimize some potential function of the margins of a data set. This class...
Philip M. Long, Rocco A. Servedio