Sciweavers

30 search results - page 1 / 6
» The Most Robust Loss Function for Boosting
Sort
View
ICONIP
2004
13 years 6 months ago
The Most Robust Loss Function for Boosting
Boosting algorithm is understood as the gradient descent algorithm of a loss function. It is often pointed out that the typical boosting algorithm, Adaboost, is seriously affected ...
Takafumi Kanamori, Takashi Takenouchi, Shinto Eguc...
EMMCVPR
2011
Springer
12 years 5 months ago
Optimization of Robust Loss Functions for Weakly-Labeled Image Taxonomies: An ImageNet Case Study
The recently proposed ImageNet dataset consists of several million images, each annotated with a single object category. However, these annotations may be imperfect, in the sense t...
Julian John McAuley, Arnau Ramisa, Tibério ...
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 5 months ago
Robust boosting and its relation to bagging
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
Saharon Rosset
CVPR
2010
IEEE
13 years 9 months ago
On the design of robust classifiers for computer vision
The design of robust classifiers, which can contend with the noisy and outlier ridden datasets typical of computer vision, is studied. It is argued that such robustness requires l...
Hamed Masnadi-Shirazi, Nuno Vasconcelos, Vijay Mah...
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
13 years 6 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu