What does Completing Preferences from Sparse Purchases conclude, in numbers, about “Missing Not at Random: How Far Seeing Only Purchases Leads Inference Astray”?
Answer: Chapter 5 asks what happens when only purchases are seen: under strong selection the unbought cells are predicted 0.4245 too high, and propensity weights cut this to 0.1671; a model fitted to bought cells alone hits only 0.286, while weighted alternating least squares that counts the unbought cells reaches 0.743.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (23 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.1671, 0.4245
| b = 2, seen 299, true unseen mean 2.6881 | |||||
| method | weight | mean est | unseen bias | unseen RMSE | |
| plain | ess | 299 | 3.7260 | +0.4245 | 0.8633 |
| ipw cap 20 | ess | 158 | 3.1522 | +0.1671 | 0.2619 |
Show the full program
# Chapter 5. p52: inverse-propensity weights against selection bias.
# Model: the store of p51 with selection strength b = 2. When the
# purchase probability pi of each cell is known (in practice it must
# be estimated), weighting each observed cell by 1/pi in ALS and in
# the mean undoes the selection on average. Weights are capped at 20.
# Effective sample size (sum w)^2 / sum w^2 shows the price paid.
# All parameters illustrative.
import math
import random
def dot(a, b):
return math.fsum(x * y for x, y in zip(a, b))
def solve(A, b):
# Gaussian elimination with partial pivoting for a small system
n = len(b)
M = [list(A[i]) + [b[i]] for i in range(n)]
for k in range(n):
p = max(range(k, n), key=lambda i: abs(M[i][k]))
M[k], M[p] = M[p], M[k]
for i in range(k + 1, n):
f = M[i][k] / M[k][k]
M[i] = [M[i][j] - f * M[k][j] for j in range(n + 1)]
x = [0.0] * n
for i in range(n - 1, -1, -1):
s = math.fsum(M[i][j] * x[j] for j in range(i + 1, n))
x[i] = (M[i][n] - s) / M[i][i]
return x
def update(trip, F, r, lam, prior=None):
# weighted ridge step for one row: minimise
# sum w (y - f.x)^2 + lam |x - prior|^2 over x
pr = prior if prior is not None else [0.0] * r
A = [[math.fsum(w * F[j][a] * F[j][b] for j, _, w in trip)
+ (lam if a == b else 0.0) for b in range(r)]
for a in range(r)]
y = [math.fsum(w * F[j][a] * v for j, v, w in trip) + lam * pr[a]
for a in range(r)]
return solve(A, y)
def als(nu, ni, obs, r, lam, iters, seed, V=None, trace=None):
# alternating least squares on (u, i, value, weight) tuples
rng = random.Random(seed)
if V is None:
V = [[rng.gauss(0.0, 1.0) for _ in range(r)] for _ in range(ni)]
bu = [[] for _ in range(nu)]
bi = [[] for _ in range(ni)]
for u, i, x, w in obs:
bu[u].append((i, x, w))
bi[i].append((u, x, w))
U = None
for t in range(iters):
U = [update(bu[u], V, r, lam) for u in range(nu)]
V = [update(bi[i], U, r, lam) for i in range(ni)]
if trace is not None:
trace.append((t + 1, U, V))
return U, V
def factors(n, r, rng):
return [[rng.gauss(0.0, 1.0) for _ in range(r)] for _ in range(n)]
def product(A, B):
return [[dot(a, b) for b in B] for a in A]
def mask(nu, ni, p, rng):
return [(u, i) for u in range(nu) for i in range(ni)
if rng.random() < p]
def logistic(x):
return 1.0 / (1.0 + math.exp(-x))
rng = random.Random(20261113)
nu, ni, r, b = 40, 30, 2, 2.0
F = product([[0.7 * x for x in row] for row in factors(nu, r, rng)],
factors(ni, r, rng))
T = [[3.0 + x for x in row] for row in F]
cells = [(u, i) for u in range(nu) for i in range(ni)]
mu = math.fsum(T[u][i] for u, i in cells) / len(cells)
sd = math.sqrt(math.fsum((T[u][i] - mu) ** 2 for u, i in cells)
/ len(cells))
draws = [rng.random() for _ in cells]
z = [(T[u][i] - mu) / sd for u, i in cells]
lo, hi = -10.0, 10.0
for _ in range(80):
a = (lo + hi) / 2
share = math.fsum(logistic(a + b * x) for x in z) / len(z)
lo, hi = (a, hi) if share < 0.25 else (lo, a)
pi = {c: logistic(a + b * x) for c, x in zip(cells, z)}
seen = [c for c, d in zip(cells, draws) if d < pi[c]]
ss = set(seen)
rest = [c for c in cells if c not in ss]
true = math.fsum(T[u][i] for u, i in rest) / len(rest)
print("b = 2, seen {}, true unseen mean {:.4f}".format(len(seen), true))
print(" method weight mean est unseen bias unseen RMSE")
for name, cap in (("plain", None), ("ipw cap 20", 20.0)):
wt = {c: 1.0 if cap is None else min(cap, 1.0 / pi[c]) for c in seen}
W = math.fsum(wt.values())
m0 = math.fsum(wt[c] * T[c[0]][c[1]] for c in seen) / W
obs = [(u, i, T[u][i] - m0, wt[(u, i)]) for u, i in seen]
U, V = als(nu, ni, obs, r, 0.1, 60, 4)
pr = [m0 + dot(U[u], V[i]) for u, i in rest]
bias = math.fsum(pr) / len(pr) - true
err = math.sqrt(math.fsum((x - T[u][i]) ** 2
for x, (u, i) in zip(pr, rest)) / len(pr))
ess = W * W / math.fsum(x * x for x in wt.values())
print(" {:11s} ess {:4.0f} {:.4f} {:+.4f} {:.4f}".format(
name, ess, m0, bias, err))Single source and citation
Fan, Y. (2026). Low-Rank Matrix Completion and Alternating Least Squares: Inferring Unstated Preferences from Sparse Purchase Records (Version 1.0.0), Chapter 5: Missing Not at Random: How Far Seeing Only Purchases Leads Inference Astray. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-328 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026328,
author = {Fan, Yafu},
title = {Low-Rank Matrix Completion and Alternating Least Squares: Inferring Unstated Preferences from Sparse Purchase Records},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Sparse Yet Completable: How Many Entries a Low-Rank Matrix Needs
- Chapter 2 · Alternating Least Squares: Breaking a Hard Problem into a Chain of Small Systems
- Chapter 3 · Power Iteration and the Leading Singular Vector: A Good Start for Alternating Least Squares
- Chapter 4 · Incoherence: How Best-Sellers, Small Niches and Long Tails Defeat Completion
- Chapter 6 · Cold Start: Catching New Customers and New Products with Means and Category Priors
- Chapter 7 · Eastern and Western Sources: "Things of a Kind Gather Together" and Spearman's General Factor
- Chapter 8 · The Buyer's Recommendation Sheet and a Plan to Refute the Book: A Loop on the Shop's Own Data