Papers for

music streaming service developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Sequential recommenders improve by personalizing reasoning depth for users

Deliberate Latent Reasoning for Sequential Recommendation

Abstract: Sequential recommenders are widely applied in real-world scenarios to model user preferences and behavior patterns based on user interactions. Recent advances in sequential recommendation enhance transformer-based models with latent reasoning to refine user representations by autoregressively generating intermediate reasoning vectors. However, exploring the optimal reasoning depth for diverse user histories remains challenging: existing methods typically employ a fixed number of reasoning steps for all users. This ``one-size-fits-all'' strategy often leads to suboptimal representation learning due to over-thinking in simple histories or under-thinking in complex ones. To address this issue, we propose DESRec, a deliberate latent reasoning framework that performs personalized latent reasoning to learn more informative reasoning states and enhance user modeling for sequential recommendation. Specifically, it designs a reasoning step selection module that identifies the optimal reasoning step for each user sequence during the training phase. Through a self-distillation mechanism, it compresses this most informative state into the final reasoning step, which serves as the final user representation for item ranking during inference. Moreover, it introduces a progressive preference extraction mechanism for personalized reasoning, which dynamically segments a user's history into a variable number of periods and summarizes each into a latent milestone representing the user's preference for that period. It will be used as the input of the subsequent reasoning. The number of milestones varies with the users' history, enabling a personalized reasoning over users' evolving interests. Extensive experimental results on six public datasets and four backbone recommenders demonstrate the superiority of DESRec over eight baseline models.

Wed 4 NovInformation Retrieval
The gist
Sequential recommendation systems help suggest items by understanding users' interaction histories. The authors found that using a fixed number of reasoning steps for all users can be inefficient—some users need more steps, others fewer. They proposed a new method called DESRec that customizes the number of reasoning steps for each user's history and breaks down their preferences over time. Experiments show that this personalized approach helps provide better recommendations across different datasets and models.
Open → 2611.06521v1

Sequential recommendation improves by thinking harder about key items

Think Harder Where It Matters: Item-Level Adaptive Recursion for Sequential Recommendation

Abstract: Existing sequential recommenders usually allocate a fixed computational budget to every item in a user's interaction history, regardless of the item's contribution to the final prediction. We challenge this de facto design with two diagnostic findings. (1) Non-uniform computational need: items within the same sequence vary drastically in how much computation they require. Most converge after shallow processing while a critical minority only stabilizes at full depth. (2) Suboptimality of fixed allocation: given oracle access to the target item, a non-uniform depth assignment consistently outranks the fixed one, indicating that existing uniform computation both wastes capacity on already-converged items and sacrifices overall recommendation quality. These observations motivate a shift from fixed-depth computation to item-level adaptive reasoning. To this end, we propose LoopRec. LoopRec recursively applies a single weight-shared block and introduces a lightweight gate at each recursion boundary that makes a binary exit-or-continue decision for every item independently. Items whose representations have sufficiently matured exit early, while those requiring deeper reasoning continue to subsequent recursions. This design converts the fixed global depth into a learned, per-item property without auxiliary depth labels, and is readily adaptable to diverse backbone architectures. Extensive experiments on public benchmarks with four backbone families demonstrate that LoopRec consistently outperforms matched fixed-depth counterparts. Further analysis reveals that LoopRec's learned allocation exhibits interpretable patterns aligned with our post-hoc oracle analysis: lower-frequency items and more recent interactions naturally receive deeper computation. Our code is available at https://github.com/Elpmis117/LoopRec.

Wed 21 OctInformation RetrievalArtificial IntelligenceComputation and Language
The gist
Many recommendation systems treat every item in a user's history the same when predicting what to suggest next, using equal computer effort. The authors found that some items need more detailed thinking, while others settle quickly with less work. They created LoopRec, which decides for each item separately whether to stop analyzing or keep going deeper, saving work on easy items and focusing on important ones. This method improves recommendation quality and naturally spends more effort on rare or recent items.
Open → 2610.30128v1

Generative recommenders improve long-tail item suggestions with memorization fix

Generative Recommenders Forget the Long Tail: Restoring Memorization in Retrieval and Ranking

Abstract: Generative recommenders replace the retrieve-then-rank cascade with a single model: beam search over semantic item identifiers performs retrieval, and the same likelihood performs ranking. We show that this shared score makes them forget long-tail items twice. In retrieval, beam search keeps identifier prefixes by the probability mass of their subtrees, so tail items are pruned early, and a wider beam admits few more of them. In ranking, the likelihood places tail items below head items even when they are admitted, so expanding retrieval alone brings little or no gain. Both failures reflect missing item-level memorization (i.e., direct recall of which items co-occur), which collaborative filtering provides and shared-prefix generation lacks. To this end, we propose CAPE (Co-occurrence-Aware Pool Expansion), a training-free plug-in that restores memorization at both stages: (i) a memorization channel retrieves co-occurrence-supported tail items outside the beam and scores them with the frozen generator, and (ii) memorization-calibrated ranking fuses the generator likelihood with co-occurrence evidence while keeping the generator's first item. Experiments with two generative backbones on product and music domains show that CAPE significantly improves long-tail accuracy over the backbones and over re-ranking baselines that share its candidates, preserves or improves overall accuracy, and adds a small fraction of the latency.

Wed 21 OctInformation Retrieval
The gist
Generative recommenders try to suggest items by generating item identifiers but tend to miss rare or less popular items, called the long tail, because of how they search and score options. The authors found this happens twice: during the selection and ranking steps. They created a simple add-on called CAPE that checks for items often bought or used together, helping the model remember and include those rare items better. This improves recommendation accuracy for niche products without slowing down the system much.
Open → 2610.29298v1

Generative recommender improves recommendations by linking content and knowledge graph

SPRIG: Semantic-ID-enhanced Paths for Knowledge Graph-based Generative Recommendation

Abstract: Recommender systems leveraging generative models often generate item identifiers directly, rather than ranking catalog items by a recommendation score. Recent work extends beyond pure sequential interaction signals by incorporating item content and structured relationships among items, with two distinct directions emerging. Semantic IDs (SIDs) enrich item representations by replacing opaque, randomly initialized embeddings with hierarchically quantized discrete codes derived from item content. Knowledge-graph (KG) path reasoning instead generates entity-relation paths that ground recommendations in structured relationships between items, attributes, and external entities, thereby enriching the relational context. These two lines have complementary limitations: SID-based models lack relational grounding, while KG-based generative recommenders still represent items as arbitrary, opaque tokens tied to large embedding tables, limiting parameter sharing and generalization. We propose SPRIG, a generative recommender that integrates content-derived SIDs into KG path reasoning. SPRIG is trained on information-rich KG paths that terminate in items represented as discrete, content-derived tokens, combining the advantages of both approaches. We evaluate SPRIG on movie and music recommendation datasets against baselines spanning sequential language models, KG-augmented methods, and SID-based approaches. Our results show that SPRIG achieves competitive performance over prior generative models while using fewer parameters and a lower compute cost. Code: https://github.com/justinhangoebl/semantic-id-knowledge-graph-recommender

Mon 5 OctInformation Retrieval
The gist
Making good recommendations means understanding items deeply and how they relate. The authors combined two ways to represent items: one that uses meaningful codes from an item's content, and another that tracks relationships in a knowledge graph. Their new method, SPRIG, uses these together to better predict what users will like. It works well on movie and music recommendations while needing fewer computer resources.
Open → 2610.06590v1

Recommendation methods reduce popularity bias with new weighting scheme

Mitigating Popularity Bias in Recommendation with Global Listwise Learning and Progressive Bi-Weighting

Abstract: In recommender systems, user feedback typically follows a long-tail distribution, which leads many recommendation algorithms to exacerbate popularity bias by disproportionately favoring popular items. To mitigate this issue, recent studies have employed Inverse Propensity Scoring (IPS) to rebalance training data via reweighting user-item interactions. However, the effectiveness of IPS-based approaches is often constrained by locally unbiased objectives and inaccurate propensity estimation. In this paper, we propose Multinomial Likelihood with Bi-Weighting (Mult-BiW) to address these limitations. First, we introduce a debiasing framework, termed Mult-IPS, which integrates multinomial likelihood with IPS to capture global and unbiased user preferences over the entire item set. Second, we develop a Bi-Weighting (BiW) strategy that jointly leverages propensity scores and a collection model, incorporating a smoothing mechanism to enhance the robustness of propensity estimation. We further provide theoretical analyses that establish an upper bound on the empirical bias and characterize the optimal form of the collection model. Third, to mitigate the adverse effects of aggressive reweighting on representation learning, we design a Progressive Bi-Weighting strategy that gradually transitions from discriminative representation learning to popularity debiasing. Extensive experiments on real-world datasets show that Mult-BiW consistently outperforms state-of-the-art baselines.

Mon 28 SeptInformation Retrieval
The gist
Recommendation systems often show popular items too much because they learn from what users interact with most, which isn't always fair or diverse. The authors propose a new approach that looks at all items together and uses smarter ways to adjust how much each item counts during training. They also developed a method that starts by learning simple patterns before focusing on correcting popularity bias, which helps keep recommendations accurate. Tests on real data show their method works better than existing solutions.
Open → 2609.35041v1

Item graph structure improves sequential recommendation performance

Enriching Sequential Recommendation with Graph Laplacian Positional Embeddings

Abstract: Sequential recommenders typically rely on learnable positional embeddings to encode the order of user interactions. In this work, we ask whether this ordinal signal can be replaced by a structural one derived from the item space. We propose to use Laplacian positional embeddings in SASRec: we build an item co-occurrence graph from training interactions, compute eigenvectors of its symmetric normalized Laplacian, and use them as frozen graph-derived positional embeddings. The backbone architecture and training objective remain unchanged. Experiments on four public sequential-recommendation benchmarks show that this simple replacement improves SASRec performance on most ranking metrics and remains competitive with strong positional and temporal encoding baselines. These findings indicate that item-item graph structure can be an effective substitute for standard ordinal positional embeddings in sequential recommendation.

Fri 25 SeptInformation Retrieval
The gist
Sequential recommendation systems usually use special codes to remember the order in which a user clicked on items. This paper explores replacing those order-based codes with codes derived from how items are connected in a graph built from user interactions. The authors compute graph-based codes called Laplacian positional embeddings and use them in an existing recommendation model. They find that this graph-based approach improves recommendation accuracy on several test datasets while keeping the model design and training the same.
Open → 2609.31253v1

Time aware rotary position embedding improves recommendation accuracy

T-RoPE: Time-Aware Rotary Position Embedding for Sequential Recommendation

Abstract: Large-scale recommenders increasingly adopt the sequential generative recipe behind large language models, bringing the Transformer into recommendation along with design choices made for text, including Rotary Position Embedding (RoPE). In language models, RoPE encodes token indices for relative position reasoning, but in recommendation, an interaction index records only event order, saying nothing about elapsed time, behavioral cycles across scales, or calendar phase. We revisit this choice and propose T-RoPE, a time-aware RoPE for sequential generative recommendation that replaces index-only rotation with timestamp-based angles, learnable temporal coefficients, multiscale frequency banks, shifted query alignment, and non-stationary key rotation. We prove that standard RoPE, even on timestamps, remains time-translation invariant and cannot distinguish seasonal contexts, and that T-RoPE breaks this invariance while preserving the RoPE interface. Across five public benchmarks, T-RoPE achieves the best result on every metric on every dataset, improving over the strongest baseline by 78--130\% in HR@10 on the sparse PixelRec data and 8--12\% across metrics on Amazon Books. On an industrial-scale e-commerce dataset with more than 6B interactions, it improves every metric over the HSTU + Time RAB backbone by 13--82\%, with ablations attributing the largest gains to multiscale frequencies ($+56\%$ NDCG@50) and non-stationary keys ($+4\%$). An online A/B test in the Shop app yields positive lifts in conversion rate ($+0.33\%$) and order count ($+0.63\%$). We also provide forward and backward algorithms whose added cost is linear in sequence length and head dimension, keeping time-aware RoPE practical for large generative recommenders.

Thu 24 SeptArtificial IntelligenceInformation RetrievalMachine Learning
The gist
Recommendation systems that suggest items like products or content often rely on the order of previous interactions but ignore the exact timing between them. The authors noticed that using only the order misses important signals like how much time passed or seasonal patterns. They created T-RoPE, a method that adds timing information to better understand user behavior. This improved recommendation accuracy on several datasets and even showed small but positive effects in a real online shopping app.
Open → 2609.30576v1