255 search results - page 31 / 51 » Generalized Boosting Algorithms for Convex Optimization |
195
click to vote
FOCM
2011
15 years 2 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
188
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
We present a general Bayesian framework for hyperparameter tuning in L2-regularized supervised learning models. Paradoxically, our algorithm works by first analytically integratin...
209
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
251
click to vote
SIGECOM
2010
ACM
16 years 9 days ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
197
click to vote
Publication
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...