Decomposition Strategies for Constructive Preference Elicitation

Authors

  • Paolo Dragone University of Trento
  • Stefano Teso KU Leuven
  • Mohit Kumar KU Leuven
  • Andrea Passerini University of Trento

Keywords:

machine learning, structured output prediction, preference elicitation

Abstract

We tackle the problem of constructive preference elicitation, that is the problem of learning user preferences over verylarge decision problems, involving a combinatorial space of possible outcomes. In this setting, the suggested configuration is synthesized on-the-fly by solving a constrained optimization problem, while the preferences are learned iteratively by interacting with the user. Previous work has shown that Coactive Learning is a suitable method for learning userpreferences in constructive scenarios. In Coactive Learning the user provides feedback to the algorithm in the form of an improvement to a suggested configuration. When the problem involves many decision variables and constraints, this type of interaction poses a significant cognitive burden on the user. We propose a decomposition technique for large preference-based decision problems relying exclusively on inference and feedback over partial configurations. This has the clear advantage of drastically reducing the user cognitive load. Additionally, part-wise inference can be (up to exponentially) less computationally demanding than inference over full configurations. We discuss the theoretical implications of working with parts and present promising empirical results on one synthetic and two realistic constructive problems.

Downloads

Published

2018-04-29

How to Cite

Dragone, P., Teso, S., Kumar, M., & Passerini, A. (2018). Decomposition Strategies for Constructive Preference Elicitation. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/11800