R/3F8

Content-discovery architectures encode psychological assumptions stated in their own technical literature, and each measures a response in the audience rather than a property of the work

Three decades of published recommender architecture, read for the model of the reader each one carries. Taste similarity, revealed preference, attention duration as a proxy for satisfaction, and preference decomposed into labeled responses are all named in the papers that define the mechanisms, not attributed to them from outside. The quantity computed in every case is a prediction of audience response, and the same literature records the two places that quantity is known to fail: where engagement diverges from utility, and where an item carries no prior response to fit.

part one

Scope

Recorded here is what each published content-discovery mechanism computes, what it takes to stand for an item, and what assumption about human response its own authors state in defining it. Sources are the systems’ papers and released code, covering 1992 to systems documented in production as of August 2026.

Psychological constructs are recorded where the technical literature names them. Constructs attributed to these systems from outside that literature are not recorded.

Timeline ranking is recorded as released in March 2023; its primary sources returned access errors during verification in 2026, consistent with the system’s replacement in January 2026.

part two

Findings

  1. The first collaborative filter carried no model of the reader; people wrote the filter by hand. Tapestry allowed readers to annotate documents and other readers to compose queries against those annotations.1 The judgment is human at both ends and nothing about response is inferred.

  2. Automation replaced the hand-written query with an assumption of taste similarity. GroupLens predicted a reader’s rating of a Usenet article from the ratings of readers whose prior ratings correlated with that reader’s.2 The premise is that agreement in the past predicts agreement in the future, and the prediction is a weighted opinion of similar others.

  3. Item-to-item filtering takes co-occurrence in one person’s history as evidence of relatedness between items. For each item, the most similar items are computed offline as a function over the sets of customers who interacted with both.3 The published motivation is computational: the similarity matrix is built offline and read in constant time.

  4. Latent-factor models assert that taste is low-dimensional and fit its dimensions to observed ratings. The Netflix Prize ran from 2006 to 2009 against a 10% reduction in root-mean-square error, won at 10.06%.4 Matrix factorization decomposes the ratings matrix into user and item matrices of tens to hundreds of dimensions, and the authors describe a factor as measuring how much a user likes items scoring high on it.5 The dimensions are fitted to reconstruct ratings rather than extracted from the items.

  5. Implicit-feedback models state revealed preference as a formal assumption and record its asymmetry. Systems passively tracking purchase, watching, and browsing treat that behavior as indicating preference, decomposed into a preference term and a confidence term weighting it.6 The authors state that direct input on preferences is unavailable and that evidence of what users dislike is substantially lacking.

  6. Watch time was adopted as the ranking objective in place of click probability, and the stated reason is a psychological failure of the earlier proxy. A documented recommender ranks candidates by predicted expected watch time rather than by click-through.7 Click-through rewarded misleading titles and thumbnails, which duration does not, so the objective changed to a signal the earlier gaming strategy did not produce.

  7. Production deep architectures separate retrieval from ranking, and both stages are fitted to interaction. A corpus of millions is reduced to hundreds of candidates and those are ordered.7 Retrieval is commonly an embedding lookup with approximate nearest-neighbor search over vectors emitted by a user tower and an item tower.8 The item tower accepts item features; both towers are trained against observed interactions.

  8. Preference is decomposed into labeled responses with signed weights. A disclosed timeline ranker predicts probabilities across ten engagement labels and combines them with fixed weights, carrying negative weights for predicted reports and blocks.9 Aversive response is modeled explicitly and enters as a penalty.

  9. Link-graph authority computes importance recursively from the importance of linking pages.10 Developed for search rather than recommendation, it takes prior human choice as its quantity in graph form rather than matrix form.

  10. The field records that engagement and utility diverge, in the vocabulary of dual-process psychology. Work within recommender systems research states that engagement signals are not always aligned with user utility, that optimizing them can push a user toward impulsive rather than deliberative usage, and that longer sessions can carry lower overall utility.11 Satisfaction surveys have been introduced as a separate measurement alongside behavioral signals.

  11. Systems of this kind are fitted on data their own prior output shaped. Recommenders trained on engagement already influenced by earlier rounds of recommendation increase behavioral homogeneity without a corresponding rise in measured utility, and popularity-based algorithms produce the largest such effect among those tested.12

  12. An item carrying no prior response receives a fallback value rather than a fitted position. Findings 2 through 9 fit or index observed interaction. The field’s term for an empty interaction record is cold start, its surveyed treatments are item attributes, user attributes, and popularity priors, and it is defined as the condition of an item that has not yet accumulated a record.8 This follows from the cited fitting procedures.

table 1
Each mechanism, what stands for an item inside it, and the assumption about human response its own literature states.
MechanismAn item is represented byStated assumption about the reader
Manual collaborative filtering, 1992annotations other readers recordednone; people write the filter
Neighbor prediction, 1994its column of ratingsprior agreement predicts future agreement
Link-graph authority, 1998authority of linking pagesa link is an endorsement
Item-to-item similarity, 2003customer sets shared with other itemsco-occurrence indicates relatedness
Latent-factor models, 2006–2009a vector fitted to the ratings matrixtaste is low-dimensional
Implicit feedback, 2008tracked behavior, weighted by confidencebehavior reveals preference; dislike is unobserved
Watch-time ranking, 2016predicted expected watch timeduration proxies satisfaction where clicks do not
Two-tower retrieval, 2016 onwarda vector trained against interactionsproximity in fitted space indicates interest
Multi-label ranking, 2023probabilities over engagement labelspreference decomposes into labeled responses
Content-based filtering, throughoutattributes extracted from the itemattribute match predicts acceptance
part three

The published goals and the point of reception

Each mechanism states a goal, and the goals describe one problem restated as its scale changes. Tapestry addresses a reader receiving more documents than can be read, and routes the judgment of named colleagues to that reader through queries the reader composes.1 GroupLens keeps the problem and removes the composition step, predicting a rating for an unread article from the ratings of correlated readers.2 Item-to-item filtering keeps the prediction and changes what is precomputed, because a similarity matrix over items can be built offline and read in constant time where user-neighbor computation at catalog scale could not.3 The Netflix Prize states the goal as a numeric target, a 10% reduction in error on held-out ratings.4 Watch-time ranking states the goal as a quantity to maximize rather than an error to minimize.7 Multi-label ranking states it as a weighted sum over predicted responses, with aversive responses carrying negative weight.9

Across that sequence the object being predicted moves. Tapestry predicts nothing. GroupLens predicts a rating a reader would give. Implicit-feedback models predict a preference from behavior recorded without the reader supplying it.6 Watch-time and multi-label ranking predict the behavior itself. What began as an estimate of a judgment ends as an estimate of a response.

Where these mechanisms sit determines what reception is possible. Production architectures run in two stages, and the first reduces a corpus of millions to a few hundred candidates before any ordering occurs.7 Ranking orders what retrieval admitted; it does not reach what retrieval did not return. Retrieval operates by proximity in a space whose coordinates are fitted to observed interaction,8 so the position determining admission is derived from prior response to the item.

The literature records two conditions under which that quantity departs from what it stands for. Engagement signals are not always aligned with user utility, and optimizing them can move a reader toward impulsive rather than deliberative use, producing longer sessions carrying lower utility; satisfaction surveys are introduced as a separate measurement alongside behavioral signals.11 Separately, a system fitted on engagement its own earlier output shaped increases behavioral homogeneity without a corresponding rise in measured utility, with popularity-based algorithms producing the largest such effect among those tested.12 An item carrying no prior response is admitted by neither route, and receives one of the cold-start treatments in place of a fitted position.8


related
R/5C2
Interfaces that interrupt a person for a decision are waved through in every domain measured
Five classes of interrupting interface, one convergence: wave-through from 70 to 97%, and vigilance that decays within an afternoon.

sources

System papers and released code, consulted August 2026.

1
Goldberg, D., Nichols, D., Oki, B. M. & Terry, D. Using collaborative filtering to weave an information tapestry
Communications of the ACM 35(12), 1992
2
Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P. & Riedl, J. GroupLens: an open architecture for collaborative filtering of netnews
CSCW ’94
3
Linden, G., Smith, B. & York, J. Amazon.com recommendations: item-to-item collaborative filtering
IEEE Internet Computing 7(1), 2003
4
Bennett, J. & Lanning, S. The Netflix Prize
KDD Cup and Workshop, 2007
5
Koren, Y., Bell, R. & Volinsky, C. Matrix factorization techniques for recommender systems
IEEE Computer 42(8), 2009
6
Hu, Y., Koren, Y. & Volinsky, C. Collaborative filtering for implicit feedback datasets
ICDM 2008, 263–272
7
Covington, P., Adams, J. & Sargin, E. Deep neural networks for YouTube recommendations
RecSys ’16, 191–198
8
A comprehensive survey on retrieval methods in recommender systems
arXiv:2407.21022 · arxiv.org/abs/2407.21022
9
Twitter, Inc. Twitter’s Recommendation Algorithm; twitter/the-algorithm
released March 2023
10
Brin, S. & Page, L. The anatomy of a large-scale hypertextual web search engine
Computer Networks and ISDN Systems 30(1–7), 1998
11
System-2 recommenders: disentangling utility and engagement in recommendation systems via temporal point-processes
FAccT ’24; arXiv:2406.01611 · arxiv.org/abs/2406.01611
12
Chaney, A. J. B., Stewart, B. M. & Engelhardt, B. E. How algorithmic confounding in recommendation systems increases homogeneity and decreases utility
RecSys ’18, 224–232