Learning Optimal And Nearoptimal Lexicographic Preference Lists
ASecurity
**arXiv ID:** 1909.09072 **Authors:** Ahmed Moussa, Xudong Liu **Published:** 2019-09-19T16:10:46Z **Abstract:** We consider learning problems of an intuitive and concise preference model, called lexicographic preference lists (LP-lists). Given a set of examples that are pairwise ordinal preferences over a universe of objects built of attributes of discrete values, we want to learn (1) an optimal LP-list that decides the maximum number of these examples, or (2) a near-optimal LP-list that dec...
Installs into .claude/skills of the current project.
Sponsors
SSkills DirectorySkills Directory
Know which skills are safe — weekly.
SSkills DirectorySkills Directory
Is that skill safe to install?
Are you the author of Learning Optimal And Nearoptimal Lexicographic Preference Lists?
Add the live security badge to your README. It updates with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-learning-optimal-and-nearoptimal-lexicographic-pre)
# Learning Optimal and Near-Optimal Lexicographic Preference Lists
**arXiv ID:** 1909.09072
**Authors:** Ahmed Moussa, Xudong Liu
**Published:** 2019-09-19T16:10:46Z
**Abstract:**
We consider learning problems of an intuitive and concise preference model, called lexicographic preference lists (LP-lists). Given a set of examples that are pairwise ordinal preferences over a universe of objects built of attributes of discrete values, we want to learn (1) an optimal LP-list that decides the maximum number of these examples, or (2) a near-optimal LP-list that decides as many examples as it can. To this end, we introduce a dynamic programming based algorithm and a genetic algorithm for these two learning problems, respectively. Furthermore, we empirically demonstrate that the sub-optimal models computed by the genetic algorithm very well approximate the de facto optimal models computed by our dynamic programming based algorithm, and that the genetic algorithm outperforms the baseline greedy heuristic with higher accuracy predicting new preferences.
## Skill Description
This skill is generated from the arXiv paper: Learning Optimal and Near-Optimal Lexicographic Preference Lists (1909.09072).
## How to Use
[To be filled in by the user or by future automation]
## References
- [arXiv:1909.09072](http://arxiv.org/abs/1909.09072v1)
