Sougata Chaudhuri

Generalization error bounds for learning to rank: Does the length of\n document lists matter?

2016 · arXiv (Cornell University)

We consider the generalization ability of algorithms for learning to rank at\na query level, a problem also called subset ranking. Existing generalization\nerror bounds necessarily degrade as the size of the document list associated\nwith a query …