searchresultoptimization.com
Start/Information retrieval/Learning to rank

A ranking model learns from past clicks. Past clicks were produced by past rankings.

The system is trained on the behaviour it caused.

Sufficient consensus

Learning to rank trains a model to order documents by relevance, using features from the query, the document and past interactions. Pointwise, pairwise and listwise approaches are the standard families.

It replaced hand-tuned formulas in every large search system.

What the result pages leave out

These belong to the subject. People ask about them. They are missing from the agreed coverage.

  • The feedback loop. Documents that were never shown generate no clicks, so they stay unlearnable. Position creates the data that confirms the position.
  • What counts as a good document. Relevance labels come from raters working to a definition. The definition is a decision, and it is rarely published next to the result.
  • New documents. A page with no interaction history starts with the weakest possible evidence, regardless of quality.
  • Why a page lost. The model produces an order. It does not produce a reason that a publisher could act on.
  • Optimization against the model. Once features are known, they are targeted. The model then measures the targeting rather than the quality.

What people actually want to know

  • If my page has never been shown, how is it supposed to earn the data that would get it shown?
  • Who wrote the definition of relevance that decides my visibility?
  • What did the pages above me do that I can see, and what did they do that I cannot?
  • How long does a new page need before the system has an opinion about it?

A learned ranking is a record of what was already visible. Publishing something that was never visible is the one move it cannot anticipate.

More in information retrieval