Pith. sign in

REVIEW 1 cited by

Learning Choice Functions with Gaussian Processes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.00406 v1 pith:DAW7C7YC submitted 2023-02-01 cs.LG

classification cs.LG
keywords choicefunctionsmodelobjectsablegaussianindividuallearn
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bayesian Optimization for Building Social-Influence-Free Consensus

    cs.MA 2025-02 reject novelty 7.0 of 10

    SBO estimates an unknown social influence graph from paired public and private votes, then debiases cheap public votes to find the aggregation-maximizing consensus with few expensive private queries.

Pith tools