Sciweavers

255 search results - page 15 / 51
» Generalized Boosting Algorithms for Convex Optimization
Sort
View
ICML
2009
IEEE
14 years 9 months ago
A convex formulation for learning shared structures from multiple tasks
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
Jianhui Chen, Lei Tang, Jun Liu, Jieping Ye
JMLR
2008
83views more  JMLR 2008»
13 years 8 months ago
Evidence Contrary to the Statistical View of Boosting
The statistical perspective on boosting algorithms focuses on optimization, drawing parallels with maximum likelihood estimation for logistic regression. In this paper we present ...
David Mease, Abraham Wyner
ICML
2010
IEEE
13 years 9 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
PAMI
2008
162views more  PAMI 2008»
13 years 8 months ago
Bayes Optimality in Linear Discriminant Analysis
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
Onur C. Hamsici, Aleix M. Martínez
IJCV
2007
179views more  IJCV 2007»
13 years 8 months ago
Global Detection of Salient Convex Boundaries
As an important geometric property of many structures or structural components, convexity plays an important role in computer vision and image understanding. In this paper, we desc...
Song Wang, Joachim S. Stahl, Adam Bailey, Michael ...