Sciweavers

6 search results - page 1 / 2
» Distribution-Specific Agnostic Boosting
Sort
View
ICS
2010
Tsinghua U.
14 years 1 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
ALT
2002
Springer
14 years 1 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
AI
2011
Springer
12 years 11 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
COLT
2001
Springer
13 years 8 months ago
Agnostic Boosting
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
Shai Ben-David, Philip M. Long, Yishay Mansour
VEE
2009
ACM
157views Virtualization» more  VEE 2009»
13 years 11 months ago
Task-aware virtual machine scheduling for I/O performance
The use of virtualization is progressively accommodating diverse and unpredictable workloads as being adopted in virtual desktop and cloud computing environments. Since a virtual ...
Hwanju Kim, Hyeontaek Lim, Jinkyu Jeong, Heeseung ...