The complexity of unsupervised learning of lexicographic preferences

09/23/2022
by   Hélène Fargier, et al.
0

This paper considers the task of learning users' preferences on a combinatorial set of alternatives, as generally used by online configurators, for example. In many settings, only a set of selected alternatives during past interactions is available to the learner. Fargier et al. [2018] propose an approach to learn, in such a setting, a model of the users' preferences that ranks previously chosen alternatives as high as possible; and an algorithm to learn, in this setting, a particular model of preferences: lexicographic preferences trees (LP-trees). In this paper, we study complexity-theoretical problems related to this approach. We give an upper bound on the sample complexity of learning an LP-tree, which is logarithmic in the number of attributes. We also prove that computing the LP tree that minimises the empirical risk can be done in polynomial time when restricted to the class of linear LP-trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2019

Testing Preferential Domains Using Sampling

A preferential domain is a collection of sets of preferences which are l...
research
01/26/2022

Explaining Preferences by Multiple Patterns in Voters' Behavior

In some preference aggregation scenarios, voters' preferences are highly...
research
04/11/2020

Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms

This paper is devoted to a study of single-peakedness on arbitrary graph...
research
06/06/2023

A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems

Linear programming (LP) problems with gainfree Leontief substitution sys...
research
07/13/2020

Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results

A preference profile is single-peaked on a tree if the candidate set can...
research
10/16/2020

Proportional Representation under Single-Crossing Preferences Revisited

We study the complexity of determining a winning committee under the Cha...
research
06/10/2020

Robust Estimation of Tree Structured Ising Models

We consider the task of learning Ising models when the signs of differen...

Please sign up or login with your details

Forgot password? Click here to reset