RecSys Challenge 2026

About top

The RecSys 2026 Challenge will be organized by Seungheon Doh (Korea Advanced Institute of Science and Technology, South Korea), Sergio Oramas (Pandora/SiriusXM), Bruno Sguerra (Deezer Research), Abhinav Bohra (Amazon), Claudio Pomo (Politecnico di Bari, Italy), and Francesco Barile (Maastricht University, Netherlands).

The RecSys Challenge 2026: Music-CRS focuses on the evolving landscape of music discovery, where static recommendation lists are being replaced by dynamic, conversational interactions. As users increasingly interact with AI through natural language, there is a critical need for systems that can seamlessly integrate Natural Language Understanding (NLU) with high-precision Recommender Systems (RecSys). This challenge aims to push the boundaries of how AI understands nuanced user preferences, explores musical tastes through dialogue, and provides contextually relevant track recommendations.

By utilizing the TalkPlayData-Challenge dataset, a large-scale conversation resource generated through an advanced agentic pipeline, we invite the global research community to tackle the complexities of multi-turn preference elicitation. As a research community-driven initiative, the challenge dataset features LLM-generated multi-turn dialogues paired with music metadata and user-item interaction data derived from publicly available research datasets. The dataset does not include proprietary or confidential data provided directly by SiriusXM, Deezer, or any challenge sponsor. This challenge serves as a bridge between the NLP and RecSys communities, fostering next-generation innovation in interactive and personalized music information retrieval.


Challenge Task top

The primary goal is to develop a Conversational Music Recommendation system that acts as an intelligent agent capable of navigating user tastes through dialogue.

Main Task: Conversational Music Recommendation. The system must understand user music preferences from previous conversation turns and user profiles to recommend relevant tracks from a catalog while generating natural, helpful responses.

Candidate catalog rule. During inference, recommender systems must retrieve candidates from the entire track catalog. Participants must not filter, subset, or restrict tracks using track_split_types or any other mechanism. For BM25/BERT baselines, the configuration must include track_split_types: ["all_tracks"]; submissions that do not use all_tracks may be considered invalid.


Evaluation top

The challenge employs a multi-dimensional evaluation framework to assess both what a system recommends and how it communicates those recommendations. The official composite score is:

Score = 0.50 x nDCG@20 + 0.10 x Catalog Diversity + 0.10 x Lexical Diversity + 0.30 x LLM-as-a-Judge

Development vs. blind evaluation. The public evaluator supports transparent development-set evaluation. Blind A served as an interim leaderboard phase, while Blind B is the official final evaluation split. The final ranking is based on the Blind B leaderboard.

Dimension Weight What it measures How it is computed Role in evaluation
nDCG@20 0.50 Ranking quality of the recommended tracks. Computed from the ranked list of predicted tracks against the ground-truth relevant item. Higher-ranked correct recommendations receive more credit. Primary recommendation metric.
Catalog Diversity 0.10 How broadly a system covers the music catalog. Number of unique recommended tracks across all predictions divided by the total catalog size. Complementary diversity indicator.
Lexical Diversity 0.10 How varied the generated language is. Measured with Distinct-2, i.e., unique bigrams divided by total bigrams across generated responses. Complementary response-generation indicator.
LLM-as-a-Judge 0.30 Quality of the generated explanation. Blind-set responses are judged by a Gemini model used as an automatic judge. The judge evaluates two text-only dimensions: Personalization and Explanation Quality. These dimensions evaluate the written response independently from recommendation accuracy. To preserve the integrity of the blind evaluation, we disclose the judge family but do not publish the evaluation prompt. Blind-set response-quality evaluation.

Aggregation policy. Each conversation turn has exactly one ground-truth track. The evaluation reports nDCG@1, nDCG@10, and nDCG@20, with nDCG@20 as the primary retrieval metric. Results are macro-averaged across sessions and turns. LLM judge scores use a 1-5 integer scale and are normalized to [0, 1] before being weighted in the composite score.

To preserve the integrity of the blind evaluation, the judge family is disclosed, but the detailed evaluation prompt is not published. Blind-set scoring is performed on the official Codabench leaderboard infrastructure.


Dataset: TalkPlayData-Challenge top

The challenge uses TalkPlayData-Challenge, a large-scale multi-turn dialogue dataset for conversational music recommendation, with pre-extracted multimodal track and user embeddings provided. It is based on the publicly available TalkPlayData dataset and was prepared for this research challenge by members of the organizing committee affiliated with KAIST.

The leaderboard evaluation proceeds in two blind stages. Blind A supported the interim leaderboard during the main phase of the challenge. Blind B is the final hidden evaluation set and the final leaderboard is based on Blind B. The dataset is released under CC BY-NC 4.0 for non-commercial research use only; redistribution outside the scope of the challenge is not permitted.

Dataset Components

For further details, please refer to the dedicated website .


Useful Resources top

The following resources are provided to support participation in the challenge.

Conversation Datasets top

Shared Recommendation Resources top

The following resources are shared across Train, Development, Blind A, and Blind B.

Code and Participation top

Prize top

The total prize pool is $2,000 USD, funded by external sponsors including SiriusXM and Deezer. Sponsors provide financial support only and do not control or influence the dataset, evaluation methodology, rankings, or outcomes of the challenge.

Winners are responsible for any applicable taxes in their jurisdiction.



Participation top

Registration & Data Access

Registration details and participation resources are available on the linked website.

Registration and Teams top

Participation Tracks top

Submission Format and Limits top



Timeline top

The dates below follow the official Codabench Timeline page. Dates may change; participants should refer to Codabench for the latest schedule.

When? What?
31 March, 2026 Website published.
10 April, 2026 Start of the RecSys Challenge; Train, Development, and Blind A datasets released.
17 April, 2026 Submission system opens; leaderboard live for Blind A.
23 June, 2026 Blind Dataset B released; Blind B final phase opens.
30 June, 2026 End of the RecSys Challenge.
6 July, 2026 Final leaderboard and winners announced; EasyChair opens for paper submissions.
9 July, 2026 Code upload deadline for final predictions.
20 July, 2026 Paper submission deadline.
3 August, 2026 Paper acceptance notifications.
10 August, 2026 Camera-ready papers due.
September 2026 RecSys Challenge Workshop at ACM RecSys 2026.

Paper Submission Guidelines top

Submission website: EasyChair link TBA

Important dates: Paper submission deadline: 20 July 2026; acceptance notifications: 3 August 2026; camera-ready deadline: 10 August 2026.

Important note to authors about ACM's new open access publishing model

ACM has introduced a new open access publishing model for the International Conference Proceedings Series (ICPS). Authors based at institutions that are not yet part of the ACM Open program and do not qualify for a full geographic waiver will be required to pay an article processing charge (APC) to publish their ICPS article in the ACM Digital Library. To determine whether or not an APC will be applicable to your article, please follow the detailed guidance here: ACM ICPS author guidance .

Further information may be found on the ACM website: full details of the new ICPS publishing model and full details of the ACM Open program .

Please direct all questions about the new model to icps-info@acm.org.

Terms & Conditions top

These terms summarize the official Codabench Terms & Conditions for the Music-CRS Challenge 2026. By registering, participants agree to comply with the official rules.

Official reference: Codabench RecSys Challenge 2026 .

Organization top

Organizing Committee top