seminars:stat:191107 [Department of Mathematics and Statistics, Binghamton University]

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.

<WRAP centeralign>##Statistics Seminar##\\ Department of Mathematical Sciences</WRAP>

<WRAP 70% center>
^  **DATE:**|Thursday, November 7, 2019 |
^  **TIME:**|1:15pm -- 2:15pm |
^  **LOCATION:**|WH 100E |
^  **SPEAKER:**|Haomiao Meng, Binghamton University |
^  **TITLE:**|Learning to Rank in Web Search Application  |
</WRAP>
\\ 

<WRAP center box 80%>
<WRAP centeralign>**Abstract**</WRAP>
LambdaMART is the boosted tree version of LambdaRank, which is based on RankNet. RankNet, LambdaRank, and LambdaMART have proven to be very successful algorithms for solving real world ranking problems: for example an ensemble of LambdaMART rankers won Track 1 of the 2010 Yahoo! Learning To Rank Challenge. The details of these algorithms are spread across several papers and reports, and so here we give a self-contained, detailed and complete description of them.
</WRAP>