- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes WordCTR, a CTR predictor that compresses retained user histories into candidate-independent, fixed-size multi-head associative memories. Each writer fits a content- and recency-weighted ridge-regression key-to-value map. Stacked reader blocks combine user, candidate, and context fields and repeatedly query the same memory without revisiting the raw history. For fixed model dimensions, candidate-side reading is independent of history length once the memory is available, while writing remains history-dependent.
The authors compare predictive performance against 17 baselines on three public datasets and an InHouse dataset with a behavior stream of up to 1024 events. WordCTR has the best reported public-dataset metrics and InHouse AUC and NE, but not InHouse GAUC. Single-request GPU measurements show weak history-length dependence in candidate-side scoring and benefits from cross-candidate reuse under the tested workload.
Critical strengths
-
The architecture coherently addresses repeated history processing when scoring many candidates for one user. A candidate-independent matrix memory supports distinct candidate-conditioned readouts, while stacked readers refine field interactions without revisiting the sequence. The explicit separation of history-dependent writing from history-independent reading is useful and analytically clear.
-
The reported predictive results are promising across four datasets and 17 baselines. The public-dataset results suggest that fixed-size compression can retain useful predictive information, and the inference breakdown and depth/temporal ablations help characterize practical tradeoffs. The paper also acknowledges that writing is not free and that InHouse GAUC does not improve over the strongest baseline.
Critical weaknesses
-
The predictive advantage is not yet sufficiently supported by protocol and uncertainty information. The train/validation/test chronology, history construction, negative sampling, and baseline search budgets need clearer documentation. The InHouse AUC lead is only 0.0005 and the KuaiVideo lead is 0.0019, making repeated-run uncertainty particularly important. Public datasets retain only 50–100 events, so long-history accuracy evidence rests on the private dataset. Moreover, the existing ablations do not isolate the ridge solve from a capacity-matched simpler associative writer, or content gating from temporal decay. These gaps limit confidence in both the reported advantage and its attribution to the proposed combination.
-
The efficiency comparison does not isolate performance under equivalent user-state reuse. Table 3 shows that the measured MIMN candidate-side cost is lower than WordCTR’s; WordCTR’s total advantage comes from user-side construction. MIMN also supports pre-maintained user states, so rebuilding its history within each request is different from evaluating a cache-hit scoring path. The cached WordCTR measurements still include precompute, leaving cross-candidate versus cross-request cache semantics unclear. The current measurements support the tested implementation and workload, but do not establish a serving advantage when both user states are already available.
Questions for authors
The following clarification requests could materially affect my assessment:
-
Please provide the train/validation/test chronology, history construction and negative-sampling protocols, baseline search budgets, and repeated-seed uncertainty for WordCTR and the strongest baselines.
-
Does cached mean reuse within one candidate batch or a cache hit across requests? Can you compare candidate scoring when both methods’ user states are already available, and report write/refresh costs separately under identical assumptions?
-
Can a focused capacity-matched comparison with a simple associative-memory writer isolate the benefit of the ridge solve? Separating content gating and temporal decay would also clarify which components drive the gains.