Papers for

music streaming platform 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.

Federated method finds communities in bipartite networks without sharing raw data

Federated Community Detection in Bipartite Networks

Abstract: We study federated spectral estimation when a large matrix is horizontally partitioned across servers that cannot share raw data. We propose FLICKER, a target-specific gradient-based power iteration that recovers a singular direction associated with a prescribed spectral target using only matrix-vector products on local blocks. Different target directions can be recovered independently and in parallel. We establish non-asymptotic convergence guarantees and provide a recursive grid-search procedure for spectral target selection. Building on FLICKER, we develop BiFLICKER for federated community detection in bipartite networks, together with a sequential projected variant for nearby or repeated singular directions. Under a sparse bipartite stochastic block model, we show that properly rescaled leading singular values from a reference server provide valid global targets, and that Sequential BiFLICKER achieves a vanishing misclustering rate and exact recovery under stronger sparsity conditions. Simulations show that BiFLICKER remains close to centralized spectral clustering and is more robust than existing federated spectral baselines when local sample sizes are small. On a LastFM user-artist network naturally partitioned by country, Sequential BiFLICKER attains an overall ARI of 0.94 against centralized clustering while revealing cross-country communities with distinct listening profiles.

Mon 19 OctMachine Learning
The gist
Finding groups or communities in networks of two different types of things—like users and artists—usually requires combining all data in one place, which can be impossible due to privacy or size. The authors propose a method called FLICKER that works on pieces of the network stored separately, without sharing the raw data, by focusing on key directions in the data’s structure. They extend this to BiFLICKER for networks connecting two kinds of nodes, showing it can identify communities almost as well as centralized methods and even reveal interesting cross-country music listening groups. Their approach is mathematically supported and works well with small local datasets.
Open → 2610.25997v1

Audio encoders keep different amounts of sound details in embeddings

How Much Audio Is Left In An Embedding? An Inversion Audit Of Audio Encoders

Abstract: Pretrained audio encoders are reused for downstream tasks that are often unknown when the encoder is trained, so their usefulness depends partly on which signal properties survive the pretext objective. We study this retained information through paired source reconstruction. Using a shared Stable Audio Open latent diffusion decoder, we reconstruct five-second, 44.1-kHz stereo music from frozen representations produced by supervised classifiers (VGGish, ConvNeXt), an audio-text contrastive model (CLAP), and a waveform-reconstruction model (EnCodec). These objectives impose different pressures to preserve source detail, while their exposed interfaces vary substantially in temporal and spectral resolution. Evaluating on the Million Song Dataset (MSD), we find clear differences in reconstructability across encoder families, while within encoder comparisons show improved recovery when finer temporal or spectral structure is exposed. Even compressed task oriented embeddings support reconstructions that preserve measurable source specificity and high level musical content.

Thu 8 OctSoundArtificial Intelligence
The gist
This paper looks at how much original music information remains inside different types of audio encoders after they convert sound into compact codes for other tasks. The authors test reconstructing short music clips from these codes to see how well details like timing and pitch survive. They find that some encoders keep more of the sound’s specifics than others, and that exposing finer details in the codes helps make better reconstructions. Even compressed audio representations still hold enough information to recover recognizable musical content.
Open → 2610.12250v1

Personalised search improves ranking by balancing behaviour and meaning

Robust Fusion of Semantic and Behavioural Signals for LLM Reranking in Personalised Search

Abstract: Personalised search must satisfy query intent while incorporating user context and historical interactions. LLM-based cross-encoders provide a single reranking interface, but injecting predictive behavioural statistics into their prompts can encourage shortcut learning: reliance on historical signals at the expense of semantic and user-context patterns that generalise to sparse or unseen searches. We study this problem in the personalised search system of a large-scale audio streaming platform using Query Slice Stats (QSS), an interaction-derived behavioural feature summarising historical success for query-candidate pairs. Naive QSS injection improves ranking when the feature is available but reduces robustness when it is removed. We address this with deterministic dual-sample feature-dropout training, which presents each example once with QSS included and once with QSS removed. Offline, QSS injection improves ranking quality by 13.3% when available. Dual-sample training preserves these gains while improving performance under QSS-removed evaluation by 4.0% relative to naive QSS training. In a live online test, both QSS-aware variants improve search success by roughly 2%. The aggregate test does not distinguish dual-sample from features-only training; the cold-start comparison is directionally consistent with the offline results. Paired feature-present and feature-removed training can therefore reduce the tension between exploiting strong behavioural statistics and remaining robust when they are unavailable.

Tue 22 SeptInformation Retrieval
The gist
Search engines that learn from user history can do better by understanding what people mean and what they like. The authors found that simply adding past user behavior into search ranking can make the system too reliant on old data and less able to handle new or rare searches. They developed a training method that sometimes includes this behavior data and sometimes leaves it out, helping the system stay strong even when such data is missing. Tests on a music streaming platform showed better search results both offline and live with their approach.
Open → 2609.25825v1