Assessing top-k preferences

Charles L. A. Clarke, Alexandra Vtyurina, Mark D. Smucker
7/22/2020
cs.IR

Official code: claclark/Compatibility (6 stars, last commit 2024-12-16).

Abstract

Assessors make preference judgments faster and more consistently than graded judgments. Preference judgments can also recognize distinctions between items that appear equivalent under graded judgments. Unfortunately, preference judgments can require more than linear effort to fully order a pool of items, and evaluation measures for preference judgments are not as well established as those for graded judgments, such as NDCG. In this paper, we explore the assessment process for partial preference judgments, with the aim of identifying and ordering the top items in the pool, rather than fully ordering the entire pool. To measure the performance of a ranker, we compare its output to this preferred ordering by applying a rank similarity measure.We demonstrate the practical feasibility of this approach by crowdsourcing partial preferences for the TREC 2019 Conversational Assistance Track, replacing NDCG with a new measure named "compatibility". This new measure has its most striking impact when comparing modern neural rankers, where it is able to recognize significant improvements in quality that would otherwise be missed by NDCG.

View on arXivView PDF

Code Implementations(1)

Offline evaluation by maximum similarity to an ideal ranking

61PythonJul 22, 20201 years ago

Similar Papers

Cite this paper

@article{clarke2020assessing,
  title  = {Assessing top-k preferences},
  author = {Charles L. A. Clarke and Alexandra Vtyurina and Mark D. Smucker},
  year   = {2020},
  eprint = {2007.11682},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2007.11682}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2007.11682.svg)](https://codeofpaper.com/paper/2007.11682)

Discussion