@unpublished{helm2020learning,
author = {Helm, Hayden S. and Basu, Amitabh and Athreya, Avanti and Park, Youngser and Vogelstein, Joshua T. and Winding, Michael and Zlatic, Marta and Cardona, Albert and Bourke, Patrick and Larson, Jonathan and White, Chris and Priebe, Carey E.},
title = {Learning to rank via combining representations},
year = {2020},
month = {May},
abstract = {Learning to rank -- producing a ranked list of items specific to a query and with respect to a set of supervisory items -- is a problem of general interest. The setting we consider is one in which no analytic description of what constitutes a good ranking is available. Instead, we have a collection of representations and supervisory information consisting of a (target item, interesting items set) pair. We demonstrate -- analytically, in simulation, and in real data examples -- that learning to rank via combining representations using an integer linear program is effective when the supervision is as light as "these few items are similar to your item of interest." While this nomination task is of general interest, for specificity we present our methodology from the perspective of vertex nomination in graphs. The methodology described herein is model agnostic.},
url = {http://approjects.co.za/?big=en-us/research/publication/learning-to-rank-via-combining-representations/},
}