985 search results - page 42 / 197 » Piercing Convex Sets |
PR
2006
13 years 7 months ago
2006
A cross-validation error estimator is obtained by repeatedly leaving out some data points, deriving classifiers on the remaining points, computing errors for these classifiers on ...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
The accurate localization of facial features plays a fundamental
role in any face recognition pipeline. Constrained
local models (CLM) provide an effective approach to localizati...
MOR
2006
13 years 7 months ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
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...