478 search results - page 49 / 96 » Convexity minimizes pseudo-triangulations |
NIPS
2004
13 years 9 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
NIPS
2001
13 years 9 months ago
2001
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
ECCV
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
AUTOMATICA
2010
13 years 8 months ago
2010
This paper addresses robust deconvolution filtering when the system and noise dynamics are obtained by parametric system identification. Consistent with standard identification me...
JMLR
2006
13 years 8 months ago
2006
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...