PERSONALIZATION · 2026-10-21
Personalization — Paper Daily, 2026-10-21
Community UGC search: relevance (nDCG), CTR, semantic matching, user interest modeling, and ranking efficiency.
4.45
LEAD STORY ·
NUS /
USTC
NUS
USTCCTR self-distillation can be replaced with a computable disagreement penalty. FLMNet keeps gates on clean inputs and distills independently trained towers into one serving model. The distilled model reaches 0.8169 AUC on Criteo.
Key insight: Separate mask disagreement from seed disagreement: regularize the former within a run and distill the latter across runs. The moment formulas require gates that do not read masked intermediate activations.
4.35
Google DeepMind
Oracle
UC IrvineDuoLM precomputes one vector per item and uses a personalized ranker with user history and feedback. Shared history computation and a specialized runtime reduce online work. Throughput reaches about 26,400 candidate scores per second on one H100.
Key insight: Train reusable content representations and personalized judgments jointly. Compression pays off in end-to-end serving only when repeated history prefill, input transmission, and scheduling are reduced too.
4.15
PerCDR uses inferred user personas to transfer behavior across domains, while local semantic relations strengthen within-domain modeling. On the Movie domain, NDCG@10 improves 15.40% over the strongest baseline.
Key insight: Transfer user behavioral tendencies rather than relying on global item-text similarity. Local semantic links and persona-guided cross-domain links serve different purposes.
4.15
HITMOSS decouples multimodal features, alternates collaborative and semantic graph propagation, and regularizes category exposure. Its diversity-oriented configuration reaches 0.6348 Coverage@10 on Game.
Key insight: Diversity depends on representation geometry as well as the final ranking objective. Compare accuracy-oriented and diversity-oriented configurations separately rather than combining their best numbers.
4.03
Alibaba
Nankai University
USTCUpdating semantic item codes can invalidate paths learned by a generative retriever. Preserving old codes, inserting new items, and warm-starting the model yields a 1.16% GMV lift in a three-week TmallAPP test.
Key insight: Treat code stability as part of the learned model. Small-beam hit rate and the fraction of remapped old items expose drift that a wide beam can conceal.
4.00
DidiTaQFormer models interactions among category-specific coupon discounts. Observational pretraining is followed by randomized-data adaptation and request-specific fusion. At essentially unchanged subsidy cost rate, business value per user rises 1.26%.
Key insight: A frozen observational branch preserves broad patterns while a randomized-data branch corrects policy bias. Request-specific fusion makes their roles clearer than simply mixing the logs.
3.97
Chongqing University
China Telecom
CASSAHL reconstructs masked history at granularities defined by its structured item codes. This links item representation and persistent preference learning. NDCG@10 improves 18.6–30.0% over RPG across four Amazon categories.
Key insight: Align reconstruction units with the code hierarchy. Shuffle the preceding history while retaining current-item clues to test whether reconstruction truly uses the user trajectory.
3.85
UCASOneChord aligns recommendation supervision, refinement distillation, and serving through one normalized ranking fusion. Across six Amazon datasets, average relative NDCG@5 improves 7.12% over the strongest baseline.
Key insight: Distill the distribution actually used for ranking, including its candidate set and normalization. Matching an intermediate code objective alone can leave a training–serving mismatch.
3.85
SpecMRL derives an ordered spectral basis from model parameters so compact embedding prefixes retain more useful information. On MTEB, half-dimensional representations exceed full-dimensional standard MRL.
Key insight: Compact embeddings need a useful coordinate ordering as well as useful information. Changing the readout basis can improve short vectors while retaining one shared representation model.
3.80
Candidate-dependent residual routing reweights a user history for each item. Paired-seed comparisons on REES46 show Recall@10 increasing 1.81%, with many new hits appearing lower in the top ten.
Key insight: Recall gains can cancel a decline in first-hit rank. Inspect where additional hits appear before deciding whether a module belongs in candidate expansion or top-of-list ranking.