<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
<title>Paper Daily · Personalization (English)</title>
<link>https://paper-daily.com/en/</link>
<description>Daily GenAI papers picked for search &amp; recommendation engineers: scores, card summaries and deep dives.</description>
<language>en</language>
<lastBuildDate>Thu, 29 Oct 2026 08:00:00 +0800</lastBuildDate>
<atom:link href="https://paper-daily.com/en/feeds/personalization.xml" rel="self" type="application/rss+xml"/>
<generator>Paper Daily site builder</generator>
<ttl>360</ttl>
<item>
<title>Exploratory creative pre-ranking: Hierarchical empirical-Bayes Thompson sampling for real-time creative optimization</title>
<link>https://paper-daily.com/en/papers/exploratory-creative-pre-ranking-hierarchical/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.36020</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;AI-generated content makes it easy for advertisers to produce many creatives, but each gets very few impressions. This Roblox paper adds a creative pre-ranking layer between recall and ad ranking. The historical play rate μ of a new creative&amp;#x27;s campaign, game and target audience serves as the prior mean, and the prior strength κ is computed in closed form from the variance of true differences amon…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.75 · Deep dive · 30 min · Jiale Han, Ajith Moparthi, Dan Xie, Xiaowu Dai · &lt;a href=&quot;https://arxiv.org/abs/2610.36020&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Rethinking Positional Encoding and Interaction Granularity for CTR Prediction</title>
<link>https://paper-daily.com/en/papers/rethinking-positional-encoding-interaction-granularity-ctr/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.37140</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;In unified Transformer CTR models like OneTrans, the authors tried six positional encodings on Kuaishou&amp;#x27;s KuaiRand data, and none beat using no positional encoding at all. Building on this, the Wuhan University and Tencent paper proposes TRIP (the authors&amp;#x27; name for the whole method). Each behavior encodes both its rank in the sequence and how long before this prediction it happened. Behaviors are…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.40 · Deep dive · 30 min · Xinxun Zhang, Yuxiang Wang, Xiaokai Zhou, Jiayue Li, Yi Li, Yue Liu, Jun Zhang, Xiaoling Zhou, Tiey… · &lt;a href=&quot;https://arxiv.org/abs/2610.37140&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Can Complementary Signals Bridge Similarity Islands? Manifold-Augmented Graph Embedding for Multimodal Recommendation</title>
<link>https://paper-daily.com/en/2026-10-29/personalization/#paper-arxiv:2610.37409</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.37409</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Multimodal recommenders often build item graphs from content similarity, so similar substitutes connect tightly while complements that are bought together but look different (a camera and a memory card) stay isolated. MAGE works in two steps. Offline, it splits each item&amp;#x27;s co-purchased items by text similarity into substitutes and complements. The text vectors of the item and its substitutes form…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Zhenye Yang, Jinpeng Chen, Wenbo Fu, Jun Ma, Huan Li, Qimin Zhou, Tao Wang, Li Sun, Senzhang Wang · &lt;a href=&quot;https://arxiv.org/abs/2610.37409&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Compote: Collapse-Resistant Multiple Hypothesis Learning For Sequential Recommendation</title>
<link>https://paper-daily.com/en/papers/compote-collapse-resistant-multiple-hypothesis-learning/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.37005</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;A common problem in multi-interest retrieval is that the interest vectors end up pointing the same way. Criteo and Sorbonne&amp;#x27;s COMPOTE (the authors&amp;#x27; name, short for collapse-resistant multiple-hypothesis learning) puts several prediction heads on a shared causal Transformer. Each sample splits its gradient across heads in proportion to the probability each gives the true item, raised to the power…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Deep dive · 28 min · Louis Castres Saint Martin, Clement Calauzenes, Alain Rakotomamonjy, Patrick Gallinari · &lt;a href=&quot;https://arxiv.org/abs/2610.37005&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>BehaveRec: When Does Long-Term Behavioral History Help Sequential Recommendation? A Study with Session, History, and Community Signals</title>
<link>https://paper-daily.com/en/2026-10-29/personalization/#paper-arxiv:2610.36239</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.36239</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Are long-term history and community signals always useful? BehaveRec&amp;#x27;s answer is that it depends on how much history a user has. It combines three signals: a causal Transformer over the current session, a bidirectional encoder over 90 days of history, and a user graph built from behavioral similarity, with a gate deciding per user how much of each to use. On industrial data with over ten million…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Aysenur Inan, Reza Yousefi Maragheh, Jayesh Uddhav Kudase, Selene Xu, Kaushiki Nag, Jianpeng Xu, Su… · &lt;a href=&quot;https://arxiv.org/abs/2610.36239&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>RELAY: One Query, Two Roles for Sequential Recommendation</title>
<link>https://paper-daily.com/en/2026-10-29/personalization/#paper-arxiv:2610.36000</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.36000</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;In sequential recommendation, the part that represents user preference and the history used for scoring often look at different evidence. RELAY has one learned query attend over the history to form a preference representation, then reuses the same attention weights for two memories. Direct history boosts items the user already engaged with. Transition memory holds training-set counts of item b fo…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Zesheng Li, Chengchang Pan, Honggang Qi · &lt;a href=&quot;https://arxiv.org/abs/2610.36000&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Cross-Day Compatibility of Daily Item Embeddings: An Empirical Study of Alignment, Scale Management, and CTR Adaptation</title>
<link>https://paper-daily.com/en/2026-10-29/personalization/#paper-arxiv:2610.36408</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.36408</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Many teams retrain item co-occurrence embeddings daily and feed them to CTR models, but the same item&amp;#x27;s vector changes direction and length every day, so multi-day training data actually mixes several versions. This industrial empirical study compares many ways to handle it and reaches three conclusions. First, orthogonally aligning each new day&amp;#x27;s vectors to the previous day makes vectors more co…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.05 · Yicheng Wang · &lt;a href=&quot;https://arxiv.org/abs/2610.36408&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Meta Andromeda: Powering the Next Generation of Ads Retrieval Through Model-System Co-Design</title>
<link>https://paper-daily.com/en/papers/meta-andromeda-powering-next-generation-ads-retrieval/</link>
<guid isPermaLink="false">paper-daily:en:blog_rss:meta_research_blog:https://engineering.fb.com/2026/10/28/ml-applications/meta-andromeda-next-gen-ads-retrieval-gpu-co-design</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Meta&amp;#x27;s next-generation ads retrieval engine Andromeda brings near-ranking-quality models to retrieval, scoring every eligible ad. The new version replaces the single user tower with several specialized user towers as experts, and encodes the ad tower with real-time request context. An attention-based gate in the interaction layer activates only the most relevant experts per ad, cutting inference…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.00 · Deep dive · 30 min · &lt;a href=&quot;https://engineering.fb.com/2026/10/28/ml-applications/meta-andromeda-next-gen-ads-retrieval-gpu-co-design/&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>DuTri: Dual-Branch Modeling with Triadic Factorization for Multimodal Multi-Scenario Recommendation</title>
<link>https://paper-daily.com/en/2026-10-29/personalization/#paper-arxiv:2610.36836</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.36836</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;When multi-scenario recommenders add text and image information, they usually feed the vectors as ordinary features into the original parameter-sharing structure. DuTri&amp;#x27;s authors show with controlled experiments that this is not optimal, so they split the model in two. The collaborative branch applies CP decomposition to the three-way tensor of user, scenario and item interactions, yielding user,…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.00 · Jintao Huang, Chaohua Yang, Kailiang Hao, Dugang Liu, Xing Tang, Zhong Ming · &lt;a href=&quot;https://arxiv.org/abs/2610.36836&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Preserving rare-item recall under a storage budget: quantization, distillation, and the limits of teacher fidelity</title>
<link>https://paper-daily.com/en/2026-10-29/personalization/#paper-arxiv:2610.36267</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.36267</guid>
<pubDate>Thu, 29 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;With a fixed embedding storage budget, should you use a small full-precision model, a distilled student, or a higher-dimensional low-precision model? This paper compares several options with exactly the same byte count on six datasets, focusing on recall of rare items. The result is consistent. Factorizing a large teacher&amp;#x27;s user-by-item score matrix into fairly high-dimensional user and item vect…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.85 · Han Chen, Yingrui Li · &lt;a href=&quot;https://arxiv.org/abs/2610.36267&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Unified Heterogeneous Feature Interaction via Effective-Rank Scaling for Recommender Systems</title>
<link>https://paper-daily.com/en/papers/unified-heterogeneous-feature-interaction-effective-rank/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.35318</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Most production ranking models squeeze the user&amp;#x27;s behavior sequence into one fixed vector before it reaches the feature-interaction module, so later interaction layers can no longer see which clicks or add-to-carts actually happened. Alibaba Taobao&amp;#x27;s HiRank keeps the behavior sequence alive through every layer of the backbone, and builds the retrieval query over long-term history from the user&amp;#x27;s…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.50 · Deep dive · 38 min · Ao Zhang, Haochuan Li, Boya Du, Jian Yang, Qihang Fang, Yulin Xu · &lt;a href=&quot;https://arxiv.org/abs/2610.35318&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Towards a Unified Framework of Optimal Input-Side Dimensional Configuration for Deep CTR Prediction</title>
<link>https://paper-daily.com/en/papers/unified-framework-optimal-input-side-dimensional/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.35695</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;There are three common ways to trim the input side of a CTR model: drop low-quality training samples, switch off useless features, and prune useless embedding dimensions. Earlier methods do one at a time. This paper from Shenzhen University and collaborators argues that all three are the same operation, multiplying one embedding tensor by a mask at different granularities. They also interact: onc…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.40 · Deep dive · 35 min · Chaohua Yang, Fuyuan Lyu, Xing Tang, Dugang Liu, Xiuqiang He, Zhong Ming · &lt;a href=&quot;https://arxiv.org/abs/2610.35695&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>How Much Fresh Data Should CTR Recalibration Use? A Temporal Evaluation of Post-hoc Calibration</title>
<link>https://paper-daily.com/en/papers/how-much-fresh-data-should-ctr-recalibration-use-temporal/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.33168</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;In ad systems, recalibrating a CTR model on the last few hours of fresh data is usually treated as a routine step that can only help. Testing it day by day on ten days of Avazu ad logs, this paper finds that a calibrator fitted on the first 6 hours of a day makes calibration error worse about a third of the time, and in the worst case doubles it. Stretching the fitting window to the first 12 hour…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.30 · Deep dive · 29 min · Rui Liu · &lt;a href=&quot;https://arxiv.org/abs/2610.33168&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Do Similarity Measures Measure Similarity? How User Activity Creates Phantom Correlation in Recommender Systems</title>
<link>https://paper-daily.com/en/2026-10-28/personalization/#paper-arxiv:2610.35765</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.35765</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Two items being consumed by the same people does not necessarily mean they appeal to the same taste. This University of Antwerp paper proves that even when every user picks items completely independently and at random, large differences in user activity are enough to make lift, cosine and Pearson show positive correlation between item pairs, which the authors call phantom correlation. On MovieLen…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Marco Favier, Noah Daniëls, Jens Leysen, Sander Marinus, Bart Goethals · &lt;a href=&quot;https://arxiv.org/abs/2610.35765&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Discovering Topics from Linear Autoencoders</title>
<link>https://paper-daily.com/en/2026-10-28/personalization/#paper-arxiv:2610.34739</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.34739</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;The item-by-item weight matrix of a linear recommender such as EASE already contains topics. This Chiang Mai University paper proves that if user behavior follows a latent-factor model, the top K eigenvectors of that matrix span the space of K topics. The authors build TEA on this, so one model both makes recommendations and yields topics directly. On six datasets its topic quality is significant…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Jutiyakhun Srisoparp, Donlapark Ponnoprat · &lt;a href=&quot;https://arxiv.org/abs/2610.34739&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>MIDA: Multi-Interest Decoding with Adaptive Aggregation for Session-based Recommendation</title>
<link>https://paper-daily.com/en/2026-10-28/personalization/#paper-arxiv:2610.34192</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.34192</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Session-based recommendation has a counterintuitive problem. The longer the session, and the more information it carries, the worse the next click is predicted, whether the encoder is a GRU, a graph network or a Transformer. This paper from the University of Technology Sydney and collaborators traces the cause to the decoder, because common decoders lean on the last few clicks, drowning out earli…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Linjiang Guo, Nitin Bisht, Shiqing Wu, Guandong Xu · &lt;a href=&quot;https://arxiv.org/abs/2610.34192&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Reinforcement Learning for Controller Parameters in the Auto-Bidding System at Pinterest</title>
<link>https://paper-daily.com/en/papers/reinforcement-learning-controller-parameters-auto-bidding/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.33248</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;In ad auto-bidding, a PID (proportional-integral-derivative) controller keeps adjusting bids according to spend pacing, yet one set of control parameters has to serve hundreds of thousands of campaigns with very different budgets, durations and traffic. Pinterest does not let reinforcement learning set bids directly. Instead, once a day it picks a multiplier for each campaign&amp;#x27;s proportional and i…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Deep dive · 29 min · Yichu Zhou, Qinyi Chen, Fei Feng, Jacob Loh, Mehdi Ben Ayed, Lin Yang, Andrei Curelea, Jiajing Xu · &lt;a href=&quot;https://arxiv.org/abs/2610.33248&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Decomposing Predictive Roles of Semantic and Collaborative Information for Sequential Recommendation</title>
<link>https://paper-daily.com/en/2026-10-28/personalization/#paper-openalex:W7196928235</link>
<guid isPermaLink="false">paper-daily:en:openalex:W7196928235</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;In sequential recommendation, simply concatenating item-text embeddings with ID embeddings, or feeding both into one encoder, mixes signals that play different roles. This paper splits the information used to predict the next item into three parts: a part shared by text and collaborative behavior, a part only the text has, and a part only collaborative behavior has. RIDRec learns one representati…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.00 · Jiangnan Xia, Yu Yang, Xiang Wang, Ninghao Liu · &lt;a href=&quot;https://doi.org/10.1145/3770855.3818088&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Theoretically Sound Item Similarity Measures for Recommender Systems</title>
<link>https://paper-daily.com/en/2026-10-28/personalization/#paper-arxiv:2610.34402</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.34402</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Item similarities such as cosine and conditional probability are mostly rules of thumb: nobody can say exactly why they work or how to improve them. This University of Antwerp paper derives neighborhood-based collaborative filtering as Naive Bayes classification, obtains two new similarity measures, and finds that the key is to treat the zeros in the interaction matrix as unseen rather than disli…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.00 · Noah Daniëls, Joey De Pauw, Bart Goethals · &lt;a href=&quot;https://arxiv.org/abs/2610.34402&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Cross-Domain Sequential Recommendation with Representation-Level User Transfer</title>
<link>https://paper-daily.com/en/2026-10-28/personalization/#paper-arxiv:2610.35550</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.35550</guid>
<pubDate>Wed, 28 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Most cross-domain sequential recommendation papers assume the raw behavior logs of two businesses can be pooled for training and that users appear in both. In practice the data is often isolated by business rules, and many users exist in only one domain. FLADRec, from Skoltech, Sber AI Lab and collaborators, passes only a fixed-length user vector between domains. The source-domain model compresse…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.85 · Abdulaziz Samra, Nikita Sukhorukov, Alexey Grishanov, Alexey Vasilev, Evgeny Frolov · &lt;a href=&quot;https://arxiv.org/abs/2610.35550&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Hierarchical GTV Estimation: Bridging the Gap between Container-Level Ranking and Item-Level Conversion</title>
<link>https://paper-daily.com/en/papers/hierarchical-gtv-estimation-bridging-gap-between/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.32420</guid>
<pubDate>Tue, 27 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Local-services and live-commerce ads are ranked and billed per store or livestream room, but users actually buy one voucher or one product inside it, so directly predicting how much a click will sell gives a noisy label that is hard to learn. This Meituan paper splits a store&amp;#x27;s expected sales into parts: first whether the user orders at all, then each voucher&amp;#x27;s purchase probability and quantity,…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.65 · Deep dive · 38 min · Zerong Lan, Fan Zhang, Chuang Chen, Tianchun Huang, Teng Zhang, Xingxing Wang · &lt;a href=&quot;https://arxiv.org/abs/2610.32420&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>iFusion: Integrating Dynamic Interest Streams via Diffusion Model for Click-Through Rate Prediction</title>
<link>https://paper-daily.com/en/papers/ifusion-integrating-dynamic-interest-streams-diffusion-model/</link>
<guid isPermaLink="false">paper-daily:en:openreview:iYQgXETC1D</guid>
<pubDate>Tue, 27 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;CTR models usually encode long-term and short-term behavior separately, then concatenate or gate them into one interest vector, so one-off noise in recent behavior, such as stocking up during a sale or buying for someone else, gets written straight into long-term preference. This JD.com ICLR 2026 paper treats long-term interest as a draft: it adds noise, then denoises step by step conditioned on…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.50 · Deep dive · 39 min · Ziheng Ni, Congcong Liu, Yuying Chen, Zhiwei Fang, Changping Peng, Zhangang Lin, Ching Law, Jingpin… · &lt;a href=&quot;https://openreview.net/forum?id=iYQgXETC1D&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>MARS: Multi-resolution Adaptive Routing for Sequential Recommendation</title>
<link>https://paper-daily.com/en/papers/mars-multi-resolution-adaptive-routing-sequential/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.07505</guid>
<pubDate>Tue, 27 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;To save compute, long-history recommenders compress a user&amp;#x27;s thousands of actions into a small set of cached vectors. This Duke and Meta paper finds that such caches barely remember a user&amp;#x27;s latest actions while very old ones survive best: recent interests get buried under old ones. MARS writes the history into four memory tracks at once. With each new action, every track fades old content at its…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.20 · Deep dive · 34 min · Ming Yin, Sixun Dong, Yudong Liu, Wen-Yun Yang, Yunjiang Jiang, Yiran Chen · &lt;a href=&quot;https://arxiv.org/abs/2610.07505&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>GCIB: Graph Contrastive Information Bottleneck for Multi-Behavior Recommendation</title>
<link>https://paper-daily.com/en/2026-10-27/personalization/#paper-openreview:jq7Nk1p7mW</link>
<guid isPermaLink="false">paper-daily:en:openreview:jq7Nk1p7mW</guid>
<pubDate>Tue, 27 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Multi-behavior recommenders use auxiliary behaviors such as views, favorites and add-to-cart to make up for sparse target behavior like purchases, but many auxiliary interactions have nothing to do with the target and pull user and item embeddings off course. GCIB works on two levels. On the graph, it learns to drop edges from the auxiliary graph so that what remains reflects the target-behavior…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.00 · Likang Wu, Zihao Chen, Jianxin Zhang, Sangqi Zhu, Yuanyuan Ge, Haipeng Yang, Lei Zhang · &lt;a href=&quot;https://openreview.net/forum?id=jq7Nk1p7mW&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Adaptive Diffusion-based Augmentation for Recommendation</title>
<link>https://paper-daily.com/en/papers/adaptive-diffusion-based-augmentation-recommendation/</link>
<guid isPermaLink="false">paper-daily:en:openalex:W7137888784</guid>
<pubDate>Tue, 27 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Recommenders train on negatives drawn from items a user never clicked. Random picks teach little, while picking the items the model scores highest often turns things the user would like but never saw into false negatives. This AAAI 2026 paper from Harbin Institute of Technology and others synthesizes negatives with a diffusion model: it noises a liked item&amp;#x27;s vector step by step, learns to restore…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.00 · Deep dive · 29 min · Na Li, Fanghui Sun, Yan Zou, Yangfu Zhu, Xiatian Zhu · &lt;a href=&quot;https://doi.org/10.1609/aaai.v40i18.38535&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Beyond Single Embedding: Modeling User Preferences as Distribution in Federated Recommendation</title>
<link>https://paper-daily.com/en/2026-10-27/personalization/#paper-openreview:9UohNmtqK5</link>
<guid isPermaLink="false">paper-daily:en:openreview:9UohNmtqK5</guid>
<pubDate>Tue, 27 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;In federated recommendation each device sees only a fragment of a user&amp;#x27;s behavior, yet most methods still represent a user with one fixed embedding, as if preferences were settled and precisely knowable. With little data, that estimate is brittle. This paper represents a user&amp;#x27;s preference as a distribution instead: a diffusion model generates several preference vectors that all fit the user&amp;#x27;s obs…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.75 · Chunxu Zhang, Weipeng Zhang, Guodong Long, Zhiheng Xue, Bo Yang · &lt;a href=&quot;https://openreview.net/forum?id=9UohNmtqK5&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Bayesian Ensemble for Sequential Decision-Making</title>
<link>https://paper-daily.com/en/2026-10-27/personalization/#paper-openreview:s2hxd8JghB</link>
<guid isPermaLink="false">paper-daily:en:openreview:s2hxd8JghB</guid>
<pubDate>Tue, 27 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Recommendation and reinforcement learning often use an ensemble to estimate uncertainty: each decision samples one member, and disagreement among members signals uncertainty. The sampling is usually fixed and uniform, regardless of which member has been doing well. This paper proposes Bayesian Ensemble (BE), which treats choosing a member as a bandit problem of its own: it updates each member&amp;#x27;s s…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.70 · Rui Liu, Enmin Zhao, Lu Wang, Yu Li, Ming Pang, Changping Peng, Zhangang Lin, Ching Law, Jingping S… · &lt;a href=&quot;https://openreview.net/forum?id=s2hxd8JghB&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Bridging Exploration and Persona: Information-Directed Dueling for Test-Time Agent Personalization</title>
<link>https://paper-daily.com/en/2026-10-27/personalization/#paper-arxiv:2610.24385</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.24385</guid>
<pubDate>Tue, 27 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;The same user may want a bold collaborator when brainstorming with an AI assistant and a strict critic when editing, so one fixed persona rarely fits. This paper lets the assistant switch personas from light feedback: the user simply prefers one of two answers, and the assistant picks the best of several hundred pre-built personas. Each round, the current top persona defends its spot against a ch…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.35 · Jie Mao, Pingchen Lu, Xiangyi Wang, Hengquan Huang, Shuang Qiu, Min Zhang, Zhongxiang Dai · &lt;a href=&quot;https://arxiv.org/abs/2610.24385&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>SynRec: Synergistic multi-domain recommendation with frequency-guided expert specialization</title>
<link>https://paper-daily.com/en/2026-10-26/personalization/#paper-doi:10.1016%2Fj.knosys.2026.116867</link>
<guid isPermaLink="false">paper-daily:en:doi:10.1016/j.knosys.2026.116867</guid>
<pubDate>Mon, 26 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;When several businesses each run their own recommender and share no users, knowledge cannot be transferred between them through shared user IDs. This paper proposes SynRec, which lets several domains share one Transformer recommender and shares only domain-agnostic behavior patterns, such as the fast and slow rhythms of behavior sequences over time. It replaces the feed-forward layer with a domai…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.50 · Zechuan Wang, Dong Wang, Ming Zong, Guogang Cao · &lt;a href=&quot;https://www.sciencedirect.com/science/article/pii/S0950705126015935&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>PAIR: Preference-Aligned Intent Retrieval for Premium People Recommendation at LinkedIn</title>
<link>https://paper-daily.com/en/papers/pair-preference-aligned-intent-retrieval-premium-people/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.30941</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;On LinkedIn, a software engineer who starts looking for a job usually wants to open the profiles of recruiters, hiring managers and HR, not other engineers. In professional networking, who should be recommended is often complementary, not similar. Yet most recommender systems assume that the more alike two profiles are, the more one should be recommended, so they keep showing him his peers. PAIR…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.00 · Deep dive · 27 min · Zhongkai Shangguan, Yanbin Kang, Yihan Cao, Ruijie Jiang, Qiannan Yin, Chang Yue, Zijian Zhou, Giri… · &lt;a href=&quot;https://arxiv.org/abs/2610.30941&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Ranking Bandits for Carousel Interfaces with Observable Browsing Depth</title>
<link>https://paper-daily.com/en/papers/ranking-bandits-carousel-interfaces-observable-browsing/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.05220</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;A recommender places a film in a row of items, and the user does not click it. Should the system record that the user doesn&amp;#x27;t like it? If the user never swiped far enough to see it, that record is wrong. Most online learning-to-rank algorithms cannot tell these two cases apart and have to guess: first estimate roughly how many people see each position, then scale click counts by that proportion.…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.00 · Deep dive · 27 min · Takuma Yasuda, Atsuyoshi Nakamura, Dai Hai Nguyen · &lt;a href=&quot;https://arxiv.org/abs/2610.05220&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>UserArena: Benchmarking Interactive User Simulation for Long-Horizon Shopping Agents</title>
<link>https://paper-daily.com/en/2026-10-25/personalization/#paper-arxiv:2610.30932</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.30932</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;To evaluate shopping recommendation policies offline, the policy differences a user simulator measures must match online A/B results. Most simulators fail: checked against a real online ranking-policy comparison, other dedicated simulators measure at most 0.297 of the real click-through lift. UserArena builds such a test bed from real e-commerce logs and also offers a way to train the simulator.…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.85 · Jujia Zhao, Jiakai Tang, Jing Yu, Wen Chen, Jian Wu, Han Zhu, Fei Sun, Suzan Verberne, Zhaochun Ren · &lt;a href=&quot;https://arxiv.org/abs/2610.30932&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>MAPS: A Multi-Agent Personalized Script-Driven Video Advertising System Enhanced by Reinforcement Learning</title>
<link>https://paper-daily.com/en/2026-10-25/personalization/#paper-arxiv:2610.25748</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.25748</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Personalizing video ads usually just means picking the best-fitting one from a library of ready-made creatives; the creatives themselves don&amp;#x27;t differ by person. Kuaishou&amp;#x27;s MAPS instead writes an ad script and generates a video for each user on the spot: it first infers preferences from viewing history, then writes the script using the product information. The script-writing model is trained with…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.85 · Zhongyu Wang, Chen Zuo, Qingxuan Sun, Jiayang Qiao, Qiuhao Qian, Songyan Cui, Guocheng Chen · &lt;a href=&quot;https://arxiv.org/abs/2610.25748&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Bezier-Guided Adaptive Flow for Cross-domain Sequential Recommendation</title>
<link>https://paper-daily.com/en/2026-10-25/personalization/#paper-arxiv:2610.30825</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.30825</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;In cross-domain recommendation, users differ widely in how much their interests overlap between two domains, and deciding per user how much to transfer and in which direction works better than one uniform transfer. On the Movie, Book, Sport and Cloth domains of Amazon review data, it beats the strongest baseline on hit rate and NDCG by 3.91% to 16.62%. Each user has a semantic representation in e…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.75 · Ziang Lu, Yu Zhang, Xinzhe Jiang, Lei Sang, Yiwen Zhang · &lt;a href=&quot;https://arxiv.org/abs/2610.30825&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Behavior lifetime modeling uses time sensitive behavioral signals to rank candidate items for purchase in E commerce recommendation</title>
<link>https://paper-daily.com/en/2026-10-25/personalization/#paper-doi:10.1007%2Fs44163-026-02419-1</link>
<guid isPermaLink="false">paper-daily:en:doi:10.1007/s44163-026-02419-1</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;The purchase signal of views, favourites and add-to-carts fades with time, and something added to the cart last week without buying may no longer be wanted today. Estimating how much signal each behavior still carries, from its type and age, and down-weighting stale ones in ranking clearly improves purchase prediction. BLMRec gives each behavior an initial strength and a decay rate, with the rema…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.65 · Yu Chen · &lt;a href=&quot;https://link.springer.com/article/10.1007/s44163-026-02419-1&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>FairFRESH: A Neuro-Symbolic Framework for Fair and Explainable Household Food Recommendation</title>
<link>https://paper-daily.com/en/2026-10-25/personalization/#paper-arxiv:2610.31506</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.31506</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;A family shares one fridge but each member has their own dietary restrictions, so recommending for each person separately easily has them competing for the same ingredients, or suggests a dish someone can&amp;#x27;t eat. The authors treat it as an allocation problem. A learned model first scores every food for every member from taste, pantry stock and dietary rules. Foods are then handed out round by roun…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.55 · Kodur Sai Vinay Sathvik, Kakoli Bora, Tejaswini R. M · &lt;a href=&quot;https://arxiv.org/abs/2610.31506&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Truthful by Omission: Click Thinning for LLM-Native Advertising</title>
<link>https://paper-daily.com/en/2026-10-25/personalization/#paper-arxiv:2610.30999</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.30999</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Inserting ads into an LLM answer is different from search ad slots: once users click the first ad they stop reading, so earlier ads steal clicks from later ones, and advertisers may therefore not bid truthfully. Instead of reordering the ads, the authors randomly omit some ads, omitting earlier ones more often. Each ad&amp;#x27;s keep probability is one over one plus the sum of the standalone click rates…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.45 · Junhua Liu, Zhicheng Liang, Zejun Zhang, Langzhou He, Feng Qian · &lt;a href=&quot;https://arxiv.org/abs/2610.30999&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>From Scores to Safe Sets: Exact Safety--Constrained Decoding for Medication Recommendation</title>
<link>https://paper-daily.com/en/2026-10-25/personalization/#paper-arxiv:2610.29228</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.29228</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Medication recommendation has a hard constraint: a set of drugs can&amp;#x27;t contain too many conflicting pairs, and conflicts depend on the whole set, not on any single drug. The usual approach picks drugs by score, then deletes conflicting drugs one by one and adds substitutes. The authors keep the same model&amp;#x27;s scores fixed and replace this step with a single solve: within the conflict limit, directly…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.45 · Animesh Agarwal, Meysam Ghaffari, Nina Fatehi, Anushka Swarup, Carlos Morato · &lt;a href=&quot;https://arxiv.org/abs/2610.29228&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>FAIRGate: Agentic Runtime Policy Selection and Verified Repair for Fairer Recommendation Delivery</title>
<link>https://paper-daily.com/en/2026-10-25/personalization/#paper-arxiv:2610.30359</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.30359</guid>
<pubDate>Sun, 25 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Fairness adjustments in recommendation usually fix one objective at training time, or apply one fixed reranking rule after ranking, yet the candidates and exposure differ on every request. FAIRGate has a language model pick one policy from a fixed menu on each request, such as guaranteeing a floor for long-tail movies or balancing exposure across genres. The list is actually changed by a determin…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.20 · Navkar Jain, Enock Ayiku, Kenneth Fletcher · &lt;a href=&quot;https://arxiv.org/abs/2610.30359&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>A Framework for Value-Aligned Modeling and Robust Experimentation</title>
<link>https://paper-daily.com/en/papers/framework-value-aligned-modeling-robust-experimentation/</link>
<guid isPermaLink="false">paper-daily:en:web:recsys26-value-aligned</guid>
<pubDate>Sat, 24 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;In the Google Discover ads team&amp;#x27;s model iteration, offline and online results did not line up. The correlation between the change in the conversion model&amp;#x27;s offline loss and online advertiser value was only 0.1, and many changes that looked better offline failed in the small-traffic A/B stage. This paper weights the offline loss by how much each click is worth to the advertiser, so that a loss dec…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.60 · Deep dive · 35 min · Krishna Harsha Reddy Kothapalli, Angela Liu, Kamal Nayan Reddy Challa, Pavithra Seshadrivijayakrish… · &lt;a href=&quot;https://recsys.acm.org/recsys26/session-8/#value-aligned-modeling&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>scikit-rec: A Unified, Extensible Recommendation Library with scikit-rec-agent, a Conversational Interface</title>
<link>https://paper-daily.com/en/papers/scikit-rec-unified-extensible-recommendation-library/</link>
<guid isPermaLink="false">paper-daily:en:web:recsys26-scikit-rec</guid>
<pubDate>Sat, 24 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;When a recommendation team maintains ranking models, contextual bandits, uplift models and sequential recommenders at the same time, it usually ends up with one library for each, plus separate glue code for evaluation, each with its own interface. To compare a ranking policy against a bandit policy on the same logs, the team has to make sure both sides are evaluated the same way by hand. The open…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.15 · Deep dive · 29 min · Shankar Sankararaman, Ivelin Angelov, Tin Nguyen, Jingyuan Zhang, Shivani Gowrishankar, Jaspreet Si… · &lt;a href=&quot;https://recsys.acm.org/recsys26/session-8/#scikit-rec&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Generalized Position-Based Model: Rethinking Position Weights in Ranking Off-Policy Evaluation</title>
<link>https://paper-daily.com/en/2026-10-24/personalization/#paper-web:recsys26-gpbm</link>
<guid isPermaLink="false">paper-daily:en:web:recsys26-gpbm</guid>
<pubDate>Sat, 24 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;When click logs from an old ranking policy are used to estimate a new policy&amp;#x27;s clicks, existing methods rely on hand-set rules for how clicks at each position are converted. GPBM learns a weight for every position from the data and is far more accurate when the assumed position bias is wrong. To predict clicks at one position of the new policy, the existing INTERPOL just pools, with equal weight,…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.90 · Norman Knyazev, Vito Bellini, Huseyin Yurtseven, Ben London · &lt;a href=&quot;https://recsys.acm.org/recsys26/session-8/#gpbm&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Progressive Learning from Content to Relevance to Personalization for CTR Prediction</title>
<link>https://paper-daily.com/en/papers/progressive-learning-content-relevance-personalization-ctr/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.29138</guid>
<pubDate>Fri, 23 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Taobao search CTR models mainly remember historical clicks through item IDs, so the same item with a different main image is almost indistinguishable to the model. FineSID turns each item image into 30 discrete codes across four VAR tokenizer scales from 1×1 to 4×4, tokenizes titles and OCR text by field, and looks them all up like ordinary ID features; the shared network is first trained on quer…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.75 · Deep dive · 19 min · Zhiguang Yang, Yulin Yang, Fuyu Lv, Dan Ou · &lt;a href=&quot;https://arxiv.org/abs/2610.29138&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Think Harder Where It Matters: Item-Level Adaptive Recursion for Sequential Recommendation</title>
<link>https://paper-daily.com/en/papers/think-harder-where-it-matters-item-level-adaptive-recursion/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.30128</guid>
<pubDate>Fri, 23 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;When a sequential recommender encodes each historical behavior, some behaviors converge after one layer while others need several stacked layers to stabilize. In a three-layer SASRec, 76.1% of behaviors are stable after the first layer and 6.7% need the third. LoopRec lets each historical behavior choose how many layers to stack instead of sharing one depth for the whole request. On the Amazon So…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Deep dive · 25 min · Zhanshuo Cao, Jiakai Tang, Yuqi Zhou, Sunhao Dai, Jun Xu · &lt;a href=&quot;https://arxiv.org/abs/2610.30128&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>PerSPL: Personalized Semi-supervised Preference Learning</title>
<link>https://paper-daily.com/en/papers/perspl-personalized-semi-supervised-preference-learning/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.29219</guid>
<pubDate>Fri, 23 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Personalized reward models score replies per user, but each user labels only a few dozen preference pairs, so most unlabeled replies go unused. Pairwise loss only constrains the score gap under the same prompt, so scores from different prompts can shift as a whole and a single reply cannot be judged with one threshold. PerSPL pushes each labeled pair&amp;#x27;s mean score toward 0 so scores are comparable…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.10 · Deep dive · 32 min · Xiaoan Xu, Tingzhou Wei, Juncheng Dong, Korel Gundem, Ethan X. Fang, Zhengling Qi · &lt;a href=&quot;https://arxiv.org/abs/2610.29219&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Generative Recommenders Forget the Long Tail: Restoring Memorization in Retrieval and Ranking</title>
<link>https://paper-daily.com/en/papers/generative-recommenders-forget-long-tail-restoring/</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.29298</guid>
<pubDate>Fri, 23 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Generative recommenders use beam search to emit item-ID tokens one by one, and tail items have low generation probability and are often pruned in the first one or two steps: on Amazon Industrial &amp;amp; Scientific, MiniOneRec&amp;#x27;s 50 candidates cover only 11.94% of tail targets. CAPE does not retrain the model; at inference it counts which items co-occurred with the user&amp;#x27;s history in the training data, re…&lt;/p&gt;&lt;p&gt;Personalization · Score 4.05 · Deep dive · 41 min · Xu Huang, Jiancan Wu, Hongzheng Qin, Jiawei Feng, Can Ye, Wencong Zeng, Fengze Li, Xiang Wang · &lt;a href=&quot;https://arxiv.org/abs/2610.29298&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>PreCoMem: Predictive Cognitive Memory for Self-Evolving Long-Term Dialogue Agents</title>
<link>https://paper-daily.com/en/2026-10-23/personalization/#paper-arxiv:2610.29467</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.29467</guid>
<pubDate>Fri, 23 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;Long-horizon assistants must remember user preferences and update them when preferences truly change. Common practice appends or overwrites by rule each turn, so one casual remark can overwrite an old memory. PreCoMem stores a confidence on each memory and computes a surprise score each turn: how far the new content is from retrieved memories and whether they conflict; the score is lowered when r…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.85 · Jian Zhong, Zeyu Liu, Pingchuan Cao, Rongduo Han, Shunye Tang, Guohuan Xie, Mingyuan Qin, Ran Ji, X… · &lt;a href=&quot;https://arxiv.org/abs/2610.29467&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>RESEARCHHUB: A Personalized Literature Discovery System for Biomedical Preprints</title>
<link>https://paper-daily.com/en/2026-10-23/personalization/#paper-arxiv:2610.28636</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.28636</guid>
<pubDate>Fri, 23 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;ResearchHub recommends biomedical preprints over 44,937 MedRxiv papers from 2023–2025. Its core retriever PRISM is a dual-encoder: GPT-4o first writes researcher-style queries for each abstract, then contrastive loss plus cross-encoder distillation (MarginMSE) fine-tunes the encoder. On those queries Recall@10 is 0.892, 12.4 points above SPECTER2-Search. Optional post-steps prefer results farther…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.85 · Viswonathan Manoranjan, Taeyoon Kim, Nicholas Do, Sang Woo Kim, Dawei Li, Zhen Tan, Tianlong Chen,… · &lt;a href=&quot;https://arxiv.org/abs/2610.28636&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>SOAR: Social and Opinion-Aware Recommendations</title>
<link>https://paper-daily.com/en/2026-10-23/personalization/#paper-arxiv:2610.29556</link>
<guid isPermaLink="false">paper-daily:en:arxiv:2610.29556</guid>
<pubDate>Fri, 23 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;SOAR recommends points of interest on Yelp by folding review sentiment and friend ties into the score: each place gets an initial score from public review polarity, then friends&amp;#x27; reviews add or subtract. Versus a baseline without reviews or friends, Top-10 recall rises from 47.01% to 56.59% and Top-1 from 13.37% to 16.37%. Expanding friends to friends-of-friends barely changes quality while predi…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.75 · Giannis Christoforidis, Apostolos N. Papadopoulos · &lt;a href=&quot;https://arxiv.org/abs/2610.29556&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
<item>
<title>Retrieval Augmented Generation Compositionality</title>
<link>https://paper-daily.com/en/2026-10-23/personalization/#paper-hf:2610.29722</link>
<guid isPermaLink="false">paper-daily:en:hf:2610.29722</guid>
<pubDate>Fri, 23 Oct 2026 08:00:00 +0800</pubDate>
<category>Personalization</category>
<description>&lt;p&gt;RAG stages—embedding models, chunking, retrieval, reranking, query rewrite, context compression, agentic checks—are usually evaluated alone. LASAGNA runs 450 configs on 8 benchmarks with corpora from 5K to 200K documents to measure how much single-component gains survive when combined. The three strongest retrieval techniques alone would sum to NDCG@10 +47%, but together only +17%; the components…&lt;/p&gt;&lt;p&gt;Personalization · Score 3.55 · Ido Levy, Segev Shlomov, Leshem Choshen · &lt;a href=&quot;https://huggingface.co/papers/2610.29722&quot;&gt;Source&lt;/a&gt;&lt;/p&gt;</description>
</item>
</channel>
</rss>
