Papers for

music streaming engineers

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.

Ensemble method adds confidence intervals to audio quality scores

Ensemble-Based Perceptual Audio Quality Assessment with Confidence Intervals

Abstract: Objective audio quality metrics typically provide point estimates, whereas listening tests yield score distributions from which mean opinion scores (MOS), confidence intervals (CIs), and significance decisions are derived. We propose a lightweight intrusive metric that combines a PEAQ-style perceptual front-end (ITU-R BS.1387) with a bagging ensemble of regressors. Calibration with subjective data aligns ensemble outputs with listener scores. The resulting item-dependent score distributions enable uncertainty assessment, panel-size-matched CIs, and identification of less conclusive predictions. Calibration improves agreement with subjective distributions and CI coverage across all evaluated datasets while preserving MOS accuracy. Using only 11 fixed PEAQ features, low-capacity regressors, and public training data, the method performs comparably to more data-intensive end-to-end approaches. Its output can support uncertainty-aware assessment and target listening tests towards uncertain conditions. The distributions also enable approximate pairwise comparisons, but not yet reliable significance inference.

Mon 5 OctSound
The gist
Measuring how good audio sounds is tricky because people’s opinions vary, and traditional methods only give single scores without showing uncertainty. The authors created a lightweight system that uses multiple simple models together to predict audio quality and also estimate how confident those predictions are. This helps identify when the results are less certain and could guide further listening tests more efficiently. Their approach uses few features and public data but matches more complex methods in accuracy.
Open → 2610.06569v1

Diffusion recommenders corrected to reduce popularity bias

FairDiff: Mitigating the Self-Reinforcing Matthew Effect in Diffusion Recommender Models

Abstract: While the "Matthew Effect" and filter bubbles are widely recognized outcome-level biases in recommender systems, we reveal that Diffusion Recommender Models (DRMs) uniquely compound this issue through their generative dynamics. Rather than merely inheriting data imbalances, DRMs trigger a self-reinforcing amplification of popularity bias. We identify that this phenomenon is driven by two compounding mechanisms. First, while optimization loss is universally dominated by high-frequency items across recommenders, DRMs suffer from a unique structural prior mismatch during generation. Because the forward terminal distribution of long-tailed data deviates significantly from the standard Gaussian prior, reverse sampling trajectories inherently collapse toward high-density popular items, fundamentally suppressing niche item generation. To dismantle this self-reinforcing loop, we propose FairDiff, a plug-and-play fairness-aware diffusion framework. To overcome the popularity-dominated loss, we introduce Popularity Condition Guidance (PCG). Rather than altering the training objective, PCG acts as an inference-time distributional reweighting mechanism, mathematically reshaping the score-based gradient field to penalize high-popularity regions and guide trajectories toward niche semantics. Furthermore, we design a Semantic Calibration (SC) Module to bridge the prior mismatch, aligning the forward and reverse distributions via one-step optimal transport. Comprehensive evaluations demonstrate that FairDiff achieves state-of-the-art performance while effectively mitigating the self-reinforcing Matthew Effect, highlighting its value as a general framework for DRMs.

Tue 29 SeptArtificial Intelligence
The gist
Recommender systems suggest items to users, but often popular items get suggested more, making it harder for less popular options to be seen. The authors found that a type of recommender called diffusion models can make this popularity bias even worse by their design. They propose FairDiff, a method that changes how the recommendations are generated to give more chance to less popular, niche items without changing the training process. Their tests show FairDiff can suggest a wider variety of items fairly while keeping good overall recommendations.
Open → 2609.36671v1

Textual taste profiles improve music recommendation with language models

Textual User Taste: Natural-Language User Context for Foundation-Model Recommender System at Scale

Abstract: Foundation model recommender systems require user context that can be consumed by large language models, reasoned over, and refined through natural-language interaction. Traditional behavioral embedding vectors remain highly effective for retrieval and ranking, but they are opaque to users and not natively expressed for language model workflows. We present Textual User Taste, a system that generates structured natural-language taste profiles from listening behavior, interaction signals, content metadata, and optional user feedback, and deploys them to millions of Spotify users. We describe the end-to-end production lifecycle required to generate, evaluate, optimize, and maintain these representations at industrial scale, including prompt development and compression, user steering, and integration with downstream personalization systems. Because no unique ground-truth taste profile exists, we introduce a multi-faceted evaluation framework to evaluate taste profiles as a production representation: they carry user-specific predictive signal independently, and when integrated with behavioral embeddings, improve MRR by 0.6% for future-track prediction and NDCG@7 by 2.2% for search ranking. Our evaluation also reveals that taste profiles support positive natural-language steering, while exposing important limitations, including challenges with negation and short-term temporal adaptation. These findings position taste profiles not as replacements for behavioral embeddings, but as an interpretable and steerable interface between evolving user context and foundation-model recommender systems.

Mon 28 SeptArtificial Intelligence
The gist
Music recommendation systems usually use hidden numbers to represent what a user likes, but these numbers are hard for people or language models to understand. The authors created a way to turn a user's music listening habits and feedback into clear text descriptions of their taste. These text profiles help language models make better recommendations and allow users to influence results with natural language. Their tests with millions of Spotify users showed small but real improvements in predicting songs and ranking searches. The profiles add explainability and steering but don’t replace traditional methods yet.
Open → 2609.35285v1

YouTube music uses large language models to explain new artist picks

Explainable Recommendations at Scale: LLM Rationales for YouTube Music Artist Discovery

Abstract: Modern music streaming platforms face a persistent tradeoff: exploiting familiar content versus driving the exploration of novel items. While users frequently desire discovery, they hesitate to select unknown artists over proven favorites. Providing transparent, natural language rationales that explain why an unexplored item is recommended lowers this barrier. However, while Large Language Models (LLMs) excel at this nuanced explainability, their real-time deployment is severely bottlenecked by prohibitive inference costs and computational overhead. In this paper, we present an industry case study of a decoupled recommendation architecture that successfully scales exploration without compromising latency. Our system isolates LLM inference asynchronously offline, pre-computing personalized candidate pools of undiscovered artists alongside tailored rationales. Large-scale online A/B experiments validate our design. We demonstrate that combining LLM-backed recommendations with these explanatory rationales significantly reduces the trust barrier for new content, yielding statistically significant improvements in both user exploration and overall engagement on the discovery surfaces.

Sun 20 SeptArtificial IntelligenceInformation Retrieval
The gist
Music streaming services want to help people discover new artists, but listeners often stick to familiar favorites. The authors show how YouTube Music created explanations in everyday language to explain why new artists are recommended. Because running large language models in real-time is too slow and costly, they pre-generate these explanations ahead of time. Tests on millions of users proved this approach encourages people to explore more new music while keeping the service fast and responsive.
Open → 2609.23877v1

Multi-interest recommendation improves by assigning positives exclusively

MIMA: Multi-Interest Recommendation via Multi-Positive Exclusive Assignment

Abstract: Multi-interest recommendation represents each user with multiple interest vectors for fine-grained candidate matching, yet it often suffers from interest collapse, where the learned interests converge to similar representations. We highlight the prevailing single-positive paradigm as one important factor behind this issue. Since each instance provides only one positive item, intents are optimized independently, potentially causing the same best-matching interest to be repeatedly updated toward different positives while leaving the others under-supervised. Moreover, existing methods rarely model how strongly a user activates each interest, leaving scores from different interest channels incomparable at inference. To address these problems, we propose MIMA, a Multi-Interest recommendation framework built on Multi-positive exclusive Assignment. MIMA groups items co-occurring within the same request into a positive set, generates complementary interests with a causal Transformer decoder, and exclusively assigns each positive to supervise a distinct interest via Hungarian matching, so that interest differentiation emerges from the training objective itself rather than auxiliary regularization. A lightweight routing module further estimates user-interest activation probabilities to calibrate scores across interest channels. Experiments on three public datasets and an industrial dataset show that MIMA consistently outperforms state-of-the-art baselines, and an online A/B test yields significant business gains.

Fri 11 SeptInformation Retrieval
The gist
Recommendation systems often try to understand your different interests by creating multiple interest profiles, but these profiles can end up too similar, making recommendations less effective. The authors found that this happens because typical training only focuses on one positive item at a time, which doesn't help differentiate interests well. They propose MIMA, which groups related items together and assigns each one exclusively to a unique interest, helping the system learn more distinct interests. MIMA also adjusts scores to fairly compare these interests at recommendation time, leading to better results in tests on several datasets and in live business environments.
Open → 2609.12842v1