Leveraging the margin more carefully

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 496-503

  Krause, Nir ^a   Singer, Yoram ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ERROR DETECTION; LINEAR SYSTEMS; MATHEMATICAL MODELS; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

BINARY PROBLEMS; EXPECTATION MAXIMIZATION (EM); LOGISTIC FUNCTION; SYNTHETIC DATA;

LEARNING SYSTEMS;

EID: 14344255186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. P. L. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. COLT'01.
2. M. Collins, R.E. Schapire, and Y. Singer. Logistic regression, AdaBoost and Bregman distances. Machine Learning, 47(2/3), 2002.
3. O. Dekel, S. Shalev-Shwartz, and Y. Singer. Smooth epsilon-insensitive regression by loss symmetrization. COLT'03.
4. A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. of the Royal Statistical Society, Ser. B, 39:1-38, 1977.
5. T. G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40(2), 1999.
6. N. Duffy and D. Helmbold. Potential boosters ? NIPS'99.
7. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2), 1995.
8. Y. Freund. An adaptive version of the boost by majority algorithm. COLT'99.
9. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. J. of Computer and System Sciences, 55(1), 1997.
10. K. U. Höffgen, K. S. Van Horn, and H. U. Simon. Robust trainability of single neurons. JCSS, 50(1), 1995.
11. K. Lang. Newsweeder: Learning to fi lter netnews. ICML'95.
12. L. Mason, J. Baxter, P. Bartlett, and M. Frean. Functional gradient techniques for combining hypotheses. In Advances in Large Margin Classifi ers. 1999.
13. K. Nigam, A. McCallum, S. Thrun, and T. Mitchell. Text classifi cation from labeled and unlabeled documents using em. Machine Learning, 39(2/3), 2000.
14. G. Rätsch. Robust Boosting and Convex Optimization. Doctoral dissertation, University of Potsdam, 2001.
15. R. E. Schapire and Y. Singer. Improved boosting algorithms using confi dence-rated predictions. ML, 37(3), 1999.
16. R. A. Servedio. Smooth boosting and learning with malicious noise. COLT'01, EuroCOLT'01.
17. H. Tuy. 1994. D.C. optimization: Theory, Methods & Algorithms. Horst & Pardalos (Ed) Handbook of Global Opt.
18. S. Wang, R. Rosenfeld, Y. Zhao, and D. Schuurmans. The latent maximum entropy principle. In IEEE International Symposium on Information Theory, 2002.
19. X. Zhang X.Shen, G. C. Tseng and W. H. Wong. On psi-learning.i. J. of American Statistical Association, 2003.