Hybrid-MST: A Hybrid Active Sampling Strategy for Pairwise Preference Aggregation

10/20/2018
by   Jing Li, et al.
0

In this paper we present a hybrid active sampling strategy for pairwise preference aggregation, which aims at recovering the underlying rating of the test candidates from sparse and noisy pairwise labelling. Our method employs Bayesian optimization framework and Bradley-Terry model to construct the utility function, then to obtain the Expected Information Gain (EIG) of each pair. For computational efficiency, Gaussian-Hermite quadrature is used for estimation of EIG. In this work, a hybrid active sampling strategy is proposed, either using Global Maximum (GM) EIG sampling or Minimum Spanning Tree (MST) sampling in each trial, which is determined by the test budget. The proposed method has been validated on both simulated and real-world datasets, where it shows higher preference aggregation ability than the state-of-the-art methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/08/2021

Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons

In heterogeneous rank aggregation problems, users often exhibit various ...
research
03/21/2022

Preference Exploration for Efficient Bayesian Optimization with Multiple Outcomes

We consider Bayesian optimization of expensive-to-evaluate experiments t...
research
11/16/2017

HodgeRank with Information Maximization for Crowdsourced Pairwise Ranking Aggregation

Recently, crowdsourcing has emerged as an effective paradigm for human-p...
research
05/14/2018

A Cost-Effective Framework for Preference Elicitation and Aggregation

We propose a cost-effective framework for preference elicitation and agg...
research
05/26/2022

Explaining Preferences with Shapley Values

While preference modelling is becoming one of the pillars of machine lea...
research
04/12/2020

Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization

Pairwise comparison data arise in many domains with subjective assessmen...
research
12/31/2020

Exploiting Transitivity for Top-k Selection with Score-Based Dueling Bandits

We consider the problem of top-k subset selection in Dueling Bandit prob...

Please sign up or login with your details

Forgot password? Click here to reset