255 search results - page 13 / 51 » Generalized Boosting Algorithms for Convex Optimization |
KDD
2007
ACM
14 years 9 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
CDC
2009
IEEE
14 years 1 days ago
2009
IEEE
— A receding horizon control algorithm, originally proposed for tracking best-possible steady-states in the presence of overly stringent state and/or input constraints, is analyz...
SIGIR
2011
ACM
12 years 11 months ago
2011
ACM
Pseudo-relevance feedback has proven effective for improving the average retrieval performance. Unfortunately, many experiments have shown that although pseudo-relevance feedback...
CORR
2011
Springer
13 years 14 days ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
ML
2002
ACM
13 years 8 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...