Clicks are not labels
Use clicks are not labels to move the ranking systems production brief toward a defensible release.
Marketplace ranking learns from biased clicks and reinforces its own mistakes.
This lesson isolates clicks are not labels as one decision inside that system. The people affected are product users and operators; the learning data must carry event time, availability time, ownership, and version; and the operating envelope is 80 ms ranking budget.
Choose whether and how to use implicit feedback at a declared prediction cutoff.
Measure decision utility alongside calibration, slice reliability, and system latency—not model score alone.
Marketplace ranking learns from biased clicks and reinforces its own mistakes. An unsafe release must degrade to a named baseline or the last known-good version.
Build the mental model before the machinery.
The core move is to treat clicks are not labels as a contract between data, a computation, and an action. Version index, ranker, features, and catalog together; log exposures and measure each stage separately. The implementation becomes easier to debug once you can state which inputs exist, which state is learned, what output means, and what must remain invariant after serialization.
implicit feedback
Define it in a hand-checkable form and name the prediction-time inputs.
exposure bias
Connect it to the production metric and identify what it cannot guarantee.
two-tower embeddings
Stress it with a slice, a temporal boundary, and a failure-safe alternative.
BPR
Stress it with a slice, a temporal boundary, and a failure-safe alternative.
Lessons 1 in this course.
Name every symbol. Check every shape.
Discounted cumulative gain is the central invariant for this lesson. The formula is useful only when its inputs match the production cutoff and its output maps to an action.
Discounted cumulative gain
| Symbol | Meaning / shape / unit |
|---|---|
rel_r | relevance at rank r |
r | one-indexed rank |
K | slate cutoff |
Open derivation and numerical substitution
Start from the production quantity being optimized, substitute the observed values with their declared units, then isolate the model-controlled term. Preserve shape annotations at each step so broadcasting or aggregation cannot silently change the result.
- Write the named inputs: rel_r, r, K.
- Substitute one small, hand-checkable batch before vectorizing.
- Calculate an independent reference value and compare within a declared tolerance.
# equation → code contract
inputs = validate_shapes_and_units(batch)
value = compute_c08(inputs)
assert is_finite(value)Calculate it small. Shape it realistically. Break it on purpose.
A result you can reproduce on paper
Factorize a five-user matrix, retrieve top five items, and compare dot-product and cosine rankings.
- Write every input and unit.
- Substitute values into the discounted cumulative gain equation above.
- Compare the result to one simple baseline and explain the direction of the difference.
The same reasoning under real constraints
Merge BM25, similar-item, trending, and personalized candidates; score and re-rank for availability and diversity.
The production record includes the data snapshot, transformation state, artifact identity, cutoff, score, decision, and the version of the policy that consumed it.
The attractive result you should reject
A random interaction split and click-only labels improve offline NDCG while amplifying already-prominent items.
Diagnostic: replay the smallest failing slice from immutable inputs, then compare each boundary rather than retuning the model.
Change one assumption and make the tradeoff visible.
This lab runs predefined TypeScript only. It never executes learner code. Use the slider, numeric input, reset, live text, or table—the computation is the same.
Exploration feedback loop
Allocate unbiased exploration and observe learning coverage versus short-term utility.
Assumption: Simplified marketplace with position-biased clicks and fixed demand.
Open nonvisual data table
| Item | Computed state | Interpretation |
|---|---|---|
| rank 1 | 35.0% | 6.2% |
| rank 2 | 30.3% | 6.9% |
| rank 3 | 25.6% | 7.5% |
| rank 4 | 20.8% | 8.2% |
| rank 5 | 16.1% | 8.8% |
Trace the complete operating path.
- 01
Validate and version implicit feedback.
- 02
Compute clicks are not labels from prediction-time-safe inputs.
- 03
Persist model, feature, and configuration identities together.
- 04
Serve or materialize behind explicit 80 ms ranking budget.
- 05
Join telemetry to mature outcomes and retain a rollback path.
Observability
Join service health, input quality, prediction distributions, slice behavior, and mature outcomes by exact version.
Cost
Measure storage, preprocessing, compute, queueing, and human review under a representative arrival pattern.
Failure modes
A random interaction split and click-only labels improve offline NDCG while amplifying already-prominent items. Add a detector, owner, mitigation, and stop condition for this class of failure.
Alternatives
Compare a rule, a simpler statistical baseline, and a different system boundary before adding model complexity.
Explain the contract, not just the vocabulary.
Hybrid catalog ranker
Specify BM25 plus learned retrieval, ranking, re-ranking, temporal evaluation, and a versioned online path.
- Exposure-aware data contract
- Candidate recall analysis
- Ranker and NDCG report
- Diversity/fallback/latency plan
Read primary material with a purpose.
Return to the opening failure.
Version index, ranker, features, and catalog together; log exposures and measure each stage separately.
For this lesson, the release evidence is a hand-checked formal result, deterministic simulation output, a ≥80% checkpoint, the production rubric, and a named fallback. The course resolves when the system can produce candidate generation, ranking metrics, debiasing, and online experiment design.