Keyboard shortcuts

Press โ† or โ†’ to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

๐Ÿ“˜ Part 3: Precise Preference Prediction (Ranking)

Dive into the main battlefield where deep generalization plays out in industrial ranking models โ€” from memorization and generalization to fine-grained modeling of multiple objectives and scenarios.

๐Ÿ“š 5 sections ยท โฑ๏ธ Estimated 2 weeks ยท ๐ŸŽฏ Target: master the design motivations and structural differences of deep ranking models

After the retrieval stage narrows hundreds of millions of items down to a few thousand candidates, ranking takes over the most critical job: precise scoring. Its goal is to compute, for every candidate, a predicted score that comes as close as possible to true user preference (typically click-through rate, conversion rate, and so on), then sort candidates into the best order. Ranking is the main battlefield for the generalization power of deep networks โ€” the five chapters in this Part advance layer by layer along the thread of "how to make the model stronger, more flexible, and better aligned with the business."

This Part doesn't rush to pile up model names. Instead, it keeps asking one question: what shortcoming of the previous method does each new model solve? Only by reading with "motivation" in mind will you know which model to pick when facing a real business problem.


What This Part Covers

SectionTopicThe Big Idea
3.1Wide & DeepJoint training of "linear memorization + deep generalization" sets the foundational ranking framework
3.2Feature CrossingFrom FM's second-order crossing, through DeepFM and xDeepFM, toward automatic high-order crossing
3.3Sequence ModelingDIN dynamically activates history per candidate; DIEN explicitly models the temporal evolution of interests
3.4Multi-Objective OptimizationMMoE and PLE balance multiple objectives; ESMM's entire-space modeling resolves dependency bias
3.5Multi-Scenario ModelingMulti-tower and dynamic weights adapt to distribution shifts across scenarios, capturing both commonality and specificity

What You'll Be Able to Do After This Part

  • ๐ŸŸข Explain the division of labor between "memorization" and "generalization" in Wide & Deep, and why joint training matters
  • ๐ŸŸข Distinguish the different motivations of FM's second-order crossing, xDeepFM's vector-wise high-order crossing, and AutoInt's adaptive crossing
  • ๐ŸŸก Explain how DIN's local activation breaks through the "fixed-length user vector" bottleneck, and how DIEN further models interest evolution
  • ๐ŸŸก Differentiate the essential difference and modeling strategies between multi-task (multiple objectives in one scenario) and multi-scenario (one objective across different scenarios)
  • ๐Ÿ”ด Design appropriate multi-objective / multi-scenario architectures for businesses with dependency relationships (e.g., CTR ร— CVR) or seesaw conflicts
  • ๐ŸŸก Locate each model in this Part on the chain of "solving the previous method's shortcomings"

Core Concepts

ConceptSectionRelevance
Memorization vs generalization / joint training3.1The foundational design philosophy of deep ranking models
Factorized crossing (FM) parameter sharing3.2The core technique for easing sparsity and parameter explosion
Vector-wise / adaptive high-order crossing3.2Letting the model automatically capture feature interactions of arbitrary order
Local activation (attention)3.3The key to modeling user interests that shift with the candidate
Interest evolution / session modeling3.3Upgrading a static "bag of items" into a dynamic sequence
Negative transfer / seesaw / gating3.4Multi-objective conflicts and mitigation mechanisms
Entire-space modeling (sample selection bias)3.4Resolving training bias caused by CVR dependencies
Scenario-private/shared parameters / dynamic modulation3.5Balancing commonality and differences when transferring across scenarios

Prerequisites

  • You have read Part 1 (recommender system paradigms and the three-stage pipeline) and Part 2 (the retrieval algorithm family)
  • You have read 1.3 Feature and Embedding Basics, understand sparse / dense features, bucketing, and embedding lookup; and know about MLPs, activation functions, and backpropagation
  • You roughly know what business metrics like CTR (click-through rate) and CVR (conversion rate) mean

This Part is the natural downstream of retrieval in Part 2 โ€” the candidates are ready, and now we learn how to score them "precisely."


Tips for This Part

  1. Read every model with its "motivation" in mind. When you meet a new model, first ask: what shortcoming of the previous method does it solve? Where do the structural differences lie?
  2. Formulas serve intuition. Understand "why it was designed this way" before looking at the math; formulas are just the precise notation for a design idea.
  3. Read the Advanced chapters comparatively. 3.2 and 3.3 are dense with structurally similar models โ€” comparing them side by side in a table gets you twice the result with half the effort.
  4. Run the interactive demos. 3.2 and 3.3 each include an interactive HTML โ€” use the "next step" button to get a hands-on feel for how high-order crossings and attention activation unfold.

Let's dive in! ๐Ÿš€