Learning Choice Functions via Pareto-Embeddings

Pfannschmidt, Karlson und Hüllermeier, Eyke (2020): Learning Choice Functions via Pareto-Embeddings. 43rd German Conference on AI, Bamberg, Germany, 21-25 September, 2020. In: KI 2020: Advances in Artificial Intelligence, Vol. 12325 Cham: Springer. pp. 327-333

Abstract

We consider the problem of learning to choose from a given set of objects, where each object is represented by a feature vector. Traditional approaches in choice modelling are mainly based on learning a latent, real-valued utility function, thereby inducing a linear order on choice alternatives. While this approach is suitable for discrete (top-1) choices, it is not straightforward how to use it for subset choices. Instead of mapping choice alternatives to the real number line, we propose to embed them into a higher-dimensional utility space, in which we identify choice sets with Pareto-optimal points. To this end, we propose a learning algorithm that minimizes a differentiable loss function suitable for this task. We demonstrate the feasibility of learning a Pareto-embedding on a suite of benchmark datasets.

• Item Type: Conference or Workshop Item (Paper)
• Form of publication: Publisher's Version
• Faculties: Mathematics, Computer Science and Statistics > Computer Science > Artificial Intelligence and Machine Learning
• Subjects: 000 Computer science, information and general works > 000 Computer science, knowledge, and systems
• ISSN: 0302-9743
• Place of Publication: Cham
• Language: English