Top-k Selection based on Adaptive Sampling of Noisy Preferences - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Top-k Selection based on Adaptive Sampling of Noisy Preferences

Robert Busa-Fekete
  • Fonction : Auteur
Balázs Szorenyi
  • Fonction : Auteur
Paul Weng
  • Fonction : Auteur
  • PersonId : 952563
Weiwei Cheng
  • Fonction : Auteur
Eyke Hüllermeier
  • Fonction : Auteur

Résumé

We consider the problem of reliably selecting an optimal subset of fixed size from a given set of choice alternatives, based on noisy information about the quality of these alternatives. Problems of similar kind have been tackled by means of adaptive sampling schemes called racing algorithms. However, in contrast to existing approaches, we do not assume that each alternative is characterized by a real-valued random variable, and that samples are taken from the corresponding distributions. Instead, we only assume that alternatives can be compared in terms of pairwise preferences. We propose and formally analyze a general preference-based racing algorithm that we instantiate with three specific ranking procedures and corresponding sampling schemes. Experiments with real and synthetic data are presented to show the efficiency of our approach.
Fichier non déposé

Dates et versions

hal-01216055 , version 1 (15-10-2015)

Identifiants

  • HAL Id : hal-01216055 , version 1

Citer

Robert Busa-Fekete, Balázs Szorenyi, Paul Weng, Weiwei Cheng, Eyke Hüllermeier. Top-k Selection based on Adaptive Sampling of Noisy Preferences. International Conference on Machine Learning, Jun 2013, Atlanta, Georgia, United States. pp.1094-1102. ⟨hal-01216055⟩
211 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More