PARWiS: Winner determination under shoestring budgets using active pairwise comparisons

TL;DR

This paper introduces PARWiS, an algorithm for winner determination using active pairwise comparisons under limited budgets, demonstrating superior performance over baselines on synthetic and real datasets.

Contribution

The study extends PARWiS with contextual and reinforcement learning variants, providing a comprehensive evaluation against baselines in preference-based learning.

Findings

PARWiS and RL PARWiS outperform baselines in synthetic and real datasets.

Performance is better with higher separation metric _{1,2}.

Contextual PARWiS performs comparably to PARWiS, suggesting further tuning is needed.

Abstract

Determining a winner among a set of items using active pairwise comparisons under a limited budget is a challenging problem in preference-based learning. The goal of this study is to implement and evaluate the PARWiS algorithm, which shows spectral ranking and disruptive pair selection to identify the best item under shoestring budgets. This work have extended the PARWiS with a contextual variant (Contextual PARWiS) and a reinforcement learning-based variant (RL PARWiS), comparing them against baselines, including Double Thompson Sampling and a random selection strategy. This evaluation spans synthetic and real-world datasets (Jester and MovieLens), using budgets of 40, 60, and 80 comparisons for 20 items. The performance is measured through recovery fraction, true rank of reported winner, reported rank of true winner, and cumulative regret, alongside the separation metric \(\Delta_{1,2}\). Results show that PARWiS and RL PARWiS outperform baselines across all datasets, particularly in the Jester dataset with a higher \(\Delta_{1,2}\), while performance gaps narrow in the more challenging MovieLens dataset with a smaller \(\Delta_{1,2}\). Contextual PARWiS shows comparable performance to PARWiS, indicating that contextual features may require further tuning to provide significant benefits.