Towards Non-parametric Learning To Rank

Abstract

This paper studies a stylized, yet natural, learning-to-rank problem and points out the critical incorrectness of a widely used nearest neighbor algorithm. We consider a model with \(n\) agents (users) \(\\{x_i\\}_\{i \in [n]\}\) and \(m\) alternatives (items) \(\\{y_j\\}_\{j \in [m]\}\), each of which is associated with a latent feature vector. Agents rank items nondeterministically according to the Plackett-Luce model, where the higher the utility of an item to the agent, the more likely this item will be ranked high by the agent. Our goal is to find neighbors of an arbitrary agent or alternative in the latent space. We first show that the Kendall-tau distance based kNN produces incorrect results in our model. Next, we fix the problem by introducing a new algorithm with features constructed from "global information" of the data matrix. Our approach is in sharp contrast to most existing feature engineering methods. Finally, we design another new algorithm identifying similar alterna

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyliu2018towards

Related papers

• Learning To Index For Nearest Neighbor Search (2018)10.35
• A Learning-to-rank Formulation Of Clustering-based Approximate Nearest Neighbor Search (2024)4.52
• An Alternative Cross Entropy Loss For Learning-to-rank (2019)11.58
• A Two-stage Active Learning Algorithm For \(k\)-nearest Neighbors (2022)0.00
• Enhancing The Ranking Context Of Dense Retrieval Methods Through Reciprocal Nearest Neighbors (2023)4.52
• Few-shot Prompting For Pairwise Ranking: An Effective Non-parametric Retrieval Model (2024)5.84
• Learning Nearest Neighbor Graphs From Noisy Distance Samples (2019)0.00
• On The Calibration And Uncertainty Of Neural Learning To Rank Models (2021)0.00