Preference learning

Key takeaways

Preference learning belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Preference learning to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Preference learning from memory before moving on to harder problems.

Reference excerpt

Preference learning is a subfield of machine learning that focuses on modeling and predicting preferences based on observed preference information. Preference learning typically involves supervised learning using datasets of pairwise preference comparisons, rankings, or other preference information.

Tasks The main task in preference learning concerns problems in "learning to rank". According to different types of preference information observed, the tasks are categorized as three main problems in the book Preference Learning:

Label ranking In label ranking, the model has an instance space X = { x i } {\displaystyle X=\{x_{i}\}\,\!} and a finite set of labels Y = { y i | i = 1 , 2 , ⋯ , k } {\displaystyle Y=\{y_{i}|i=1,2,\cdots ,k\}\,\!} . The preference information is given in the form y i ≻ x y j {\displaystyle y_{i}\succ _{x}y_{j}\,\!} indicating instance x {\displaystyle x\,\!} shows preference in y i {\displaystyle y_{i}\,\!} rather than y j {\displaystyle y_{j}\,\!} . A set of preference information is used as training data in the model. The task of this model is to find a preference ranking among the labels for any instance. It was observed that some conventional classification problems can be generalized in the framework of label ranking problem: if a training instance x {\displaystyle x\,\!} is labeled as class y i {\displaystyle y_{i}\,\!} , it implies that ∀ j ≠ i , y i ≻ x y j {\displaystyle \forall j\neq i,y_{i}\succ _{x}y_{j}\,\!} . In the multi-label case, x {\displaystyle x\,\!} is associated with a set of labels L ⊆ Y {\displaystyle L\subseteq Y\,\!} and thus the model can extract a set of preference information { y i ≻ x y j | y i ∈ L , y j ∈ Y ∖ L } {\displaystyle \{y_{i}\succ _{x}y_{j}|y_{i}\in L,y_{j}\in Y\backslash L\}\,\!} . Training a preference model on this preference information and the classification result of an instance is just the corresponding top ranking label.

Instance ranking Instance ranking also has the instance space X {\displaystyle X\,\!} and label set Y {\displaystyle Y\,\!} . In this task, labels are defined to have a fixed order y 1 ≻ y 2 ≻ ⋯ ≻ y k {\displaystyle y_{1}\succ y_{2}\succ \cdots \succ y_{k}\,\!} and each instance x l {\displaystyle x_{l}\,\!} is associated with a label y l {\displaystyle y_{l}\,\!} . Giving a set of instances as training data, the goal of this task is to find the ranking order for a new set of instances.

Object ranking Object ranking is similar to instance ranking except that no labels are associated with instances. Given a set of pairwise preference information in the form x i ≻ x j {\displaystyle x_{i}\succ x_{j}\,\!} and the model should find out a ranking order among instances.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Preference learning

Start with the simplest possible case. Write down what Preference learning claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Preference learning before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Preference learning ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Preference learning

In research: Preference learning appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Preference learning in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Preference learning is common in secondary-school and first-year university syllabi. It links to neighbouring topics Information retrieval techniques, Machine learning, so understanding it makes those chapters shorter.
In everyday life: Look for Preference learning outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Preference learning in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Preference learning means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Preference learning out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Preference learning in simple terms?

Preference learning is a subfield of machine learning that focuses on modeling and predicting preferences based on observed preference information. Preference learning typically involves supervised learning using datasets of pairwise preference comparisons, rankings, or other preference information.

Why does Preference learning matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Preference learning?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Preference learning.