conference paper
Margin-Based Ranking Meets Boosting in the Middle
Cynthia D Rudina, Corinna Cortesb, Mehryar Mohric, Robert E. Schapired
- aHoward Hughes Medical Institute, New York University, 4 Washington Place, Room 809, New York, NY, 10003
- bGoogle Research, 1440 Broadway, New York, NY, 10018
- cCourant Institute, New York University, 719 Broadway, New York, NY, 10003
- dDepartment of Computer Science, Princeton University, 35 Olden St., Princeton, NJ, 08544
Lecture notes in computer scienceSpringer Science+Business Media2005-01-01 84 citations18 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRA new algorithm, Smooth Margin Ranking, is described, a modification of RankBoost, analogous to Approximate Coordinate Ascent Boosting, that precisely converges to a maximum ranking-margin solution. (Semantic Scholar)