486 search results - page 1 / 98 » Boosting and Hard-Core Sets |
FOCS
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
ISAAC
2003
Springer
14 years 3 months ago
2003
Springer
The mixing properties of several Markov chains to sample from configurations of a hard-core model have been examined. The model is familiar in the statistical physics of the liqui...
CVPR
2011
IEEE
13 years 1 months ago
2011
IEEE
A new family of boosting algorithms, denoted TaylorBoost, is proposed. It supports any combination of loss function and first or second order optimization, and includes classical...
PAMI
2011
13 years 4 months ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
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,...