Learning Choice Functions with Gaussian Processes
Not on the map. Why?
Abstract (arXiv)
In consumer theory, ranking available objects by means of preference relations yields the most common description of individual choices. However, preference-based models assume that individuals: (1) give their preferences only between pairs of objects; (2) are always able to pick the best preferred object. In many situations, they may be instead choosing out of a set with more than two elements and, because of lack of information and/or incomparability (objects with contradictory characteristics), they may not able to select a single most preferred object. To address these situations, we need a choice-model which allows an individual to express a set-valued choice. Choice functions provide such a mathematical framework. We propose a Gaussian Process model to learn choice functions from choice-data. The proposed model assumes a multiple utility representation of a choice function based on the concept of Pareto rationalization, and derives a strategy to learn both the number and the values of these latent multiple utilities. Simulation experiments demonstrate that the proposed model outperforms the state-of-the-art methods.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 16 of its 53 references that are in the map. First posted on arXiv 1 Feb 2023.
Builds on
16 of 53 references.
References · 16
- 2013Gaussian Processes for Big Datacited by 383
- 2014Scalable Variational Gaussian Process Classificationcited by 228
- 2015Practical Bayesian model evaluation using leave-one-out cross-validation and WAICcited by 110
- 2016Understanding Probabilistic Sparse Gaussian Process Approximationscited by 68
- 2020Preferential Batch Bayesian Optimizationcited by 19
- 2020Preferential Bayesian optimisation with Skew Gaussian Processescited by 18
- 2016Statistical comparison of classifiers through Bayesian hierarchical modellingcited by 14
- 2020Learning Inconsistent Preferences with Gaussian Processescited by 12
- 2019Recursive Estimation for Sparse Gaussian Process Regressioncited by 11
- 2015Scalable Gaussian Process Classification via Expectation Propagationcited by 8
- 2020Skew Gaussian Processes for Classificationcited by 8
- 2019Learning Context-Dependent Choice Functionscited by 7
4 more
- 2021Correlated Product of Experts for Sparse Gaussian Process Regressioncited by 7
- 2020A unified framework for closed-form nonparametric regression, classification, preference and mixed problems with Skew Gaussian Processescited by 6
- 2019Prior Specification for Bayesian Matrix Factorization via Prior Predictive Matchingcited by 3
- 2020Learning Choice Functions via Pareto-Embeddingscited by 3
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 3.
5 papers.
- 2023Looping in the Human Collaborative and Explainable Bayesian Optimizationcited by 27
- 2024Principled Bayesian Optimisation in Collaboration with Human Expertscited by 5
- 2025Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspectivecited by 3
- 2025Interactive Multi-Objective Probabilistic Preference Learning with Soft and Hard Boundscited by 2
- 2025The AI off-switch problem as a signalling game: bounded rationality and incomparabilitycited by 0
- 2025Interactive Multi-Objective Probabilistic Preference Learning with Soft and Hard Bounds27 Jun 2025
- 2025The AI off-switch problem as a signalling game: bounded rationality and incomparability10 Feb 2025
- 2025Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspective30 Jan 2025
- 2024Principled Bayesian Optimisation in Collaboration with Human Experts14 Oct 2024
- 2023Looping in the Human Collaborative and Explainable Bayesian Optimization26 Oct 2023