Preference Elicitation For General Random Utility Models

Abstract

This paper discusses {General Random Utility Models (GRUMs)}. These are a class of parametric models that generate partial ranks over alternatives given attributes of agents and alternatives. We propose two preference elicitation scheme for GRUMs developed from principles in Bayesian experimental design, one for social choice and the other for personalized choice. We couple this with a general Monte-Carlo-Expectation-Maximization (MC-EM) based algorithm for MAP inference under GRUMs. We also prove uni-modality of the likelihood functions for a class of GRUMs. We examine the performance of various criteria by experimental studies, which show that the proposed elicitation scheme increases the precision of estimation.

Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence (UAI2013)

References in corpus (1)

• Random Utility Theory for Social Choice

Cited by in corpus (15)

• Personalized and situation-aware multimodal route recommendations: the FAVOUR algorithm
• Minimax-optimal Inference from Partial Rankings
• Learning about social learning in MOOCs: From statistical analysis to generative model
• Knowledge Elicitation via Sequential Probabilistic Inference for High-Dimensional Prediction
• A Cost-Effective Framework for Preference Elicitation and Aggregation
• Regression with n$\to$1 by Expert Knowledge Elicitation
• Projective Preferential Bayesian Optimization
• Improving pairwise comparison models using Empirical Bayes shrinkage
• Minimizing Time-to-Rank: A Learning and Recommendation Approach
• Fully Gap-Dependent Bounds for Multinomial Logit Bandit
• Capturing Variation and Uncertainty in Human Judgment
• Dueling Bandits with Adversarial Sleeping
• Towards Non-Parametric Learning to Rank
• A Multiresolution Analysis Framework for the Statistical Analysis of Incomplete Rankings
• Learning to Acquire Information