The most robust loss function for boosting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3316, Issue , 2004, Pages 496-501

  Kanamori, Takafumi ^a   Takenouchi, Takashi ^b   Eguchi, Shinto ^b   Murata, Noboru ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

^c WASEDA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; STATISTICS;

BOOSTING ALGORITHM; GRADIENT DESCENT ALGORITHMS; LOSS FUNCTIONS; NOISY DATA; NUMERICAL EXPERIMENTS; ROBUST BOOSTING; ROBUST STATISTICS;

ALGORITHMS;

EID: 35048894955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30499-9_76     Document Type: Article

References (11)

1. Copas, J. (1988). Binary regression models for contaminated data. J. Royal Statist. Soc. B., 50, 225-265.
2. Domingo, C., & Watanabe, O. (2000). MadaBoost: A modification of AdaBoost. Proc. of the 13th Conference on Computational Learning Theory, COLT'00.
3. Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55, 119-139.
4. Friedman, J. H., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: A statistical view of boosting. Annals of Statistics, 28, 337-407.
5. Hampel, F. R., Rousseeuw, P. J., Ronchetti, E. M., & Stahel, W. A. (1986). Robust statistics, the approach based on influence functions. John Wiley and Sons, Inc.
6. Lebanon, G., & Lafferty, J. (2002). Boosting and maximum likelihood for exponential models. Advances in Neural Information Processing Systems.
7. Mason, L., Baxter, J., Bartlett, P. L., & Frean, M. (1999). Boosting algorithms as gradient descent. Advances in Neural Information Processing Systems.
8. Murata, N., Takenouchi, T., Kanamori, T., & Eguchi, S. (2004). Information geometry of u-boost and bregman divergence. Neural Computation. To appear.
9. Rätsch, G., Onoda, T., & Müller, K.-R. (2001). Soft margins for adaboost. Machine Learning, 42, 287-320.
10. Takenouchi, T., & Eguchi, S. (2004). Robustifying adaboost by adding the naive error rate. Neural Computation, vol. 16, num. 4, pp. 767 - 787.
11. Vapnik, V. (1995). The Nature of Statistical Learning Theory. Springer, NY.