DeepAI AI Chat
Log In Sign Up

Learning Choice Functions via Pareto-Embeddings

by   Karlson Pfannschmidt, et al.

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.


page 1

page 3

page 5


Learning Choice Functions

We study the problem of learning choice functions, which play an importa...

Learning Choice Functions with Gaussian Processes

In consumer theory, ranking available objects by means of preference rel...

On the Indecisiveness of Kelly-Strategyproof Social Choice Functions

Social choice functions (SCFs) map the preferences of a group of agents ...

Network-based Representations and Dynamic Discrete Choice Models for Multiple Discrete Choice Analysis

In many choice modeling applications, people demand is frequently charac...

Comparison-Based Choices

A broad range of on-line behaviors are mediated by interfaces in which p...

Predicting Choice with Set-Dependent Aggregation

Providing users with alternatives to choose from is an essential compone...

Pareto Active Learning with Gaussian Processes and Adaptive Discretization

We consider the problem of optimizing a vector-valued objective function...