Tencent Advertising Algorithm Challenge 2025: All-Modality Generative Recommendation

• URL: http://arxiv.org/abs/2604.04976v1
• Date: Sat, 04 Apr 2026 17:05:15 GMT
• Title: Tencent Advertising Algorithm Challenge 2025: All-Modality Generative Recommendation
• Abstract summary: Generative recommender systems are emerging as a new paradigm for recommendation.<n>There is still a lack of public benchmarks that jointly offer large-scale, realistic and fully all-modality data.<n>We organise the Tencent Advertising Algorithm Challenge 2025 to foster research in this direction.
• Score: 60.36971002553298
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Generative recommender systems are rapidly emerging as a new paradigm for recommendation, where collaborative identifiers and/or multi-modal content are mapped into discrete token spaces and user behavior is modelled with autoregressive sequence models. Despite progress on multi-modal recommendation datasets, there is still a lack of public benchmarks that jointly offer large-scale, realistic and fully all-modality data designed specifically for generative recommendation (GR) in industrial advertising. To foster research in this direction, we organised the Tencent Advertising Algorithm Challenge 2025, a global competition built on top of two all-modality datasets for GR: TencentGR-1M and TencentGR-10M. Both datasets are constructed from real de-identified Tencent Ads logs and contain rich collaborative IDs and multi-modal representations extracted with state-of-the-art embedding models. The preliminary track (TencentGR-1M) provides 1 million user sequences with up to 100 interacted items each, where each interaction is labeled with exposure and click signals, while the final track (TencentGR-10M) scales this to 10 million users and explicitly distinguishes between click and conversion events at both the sequence and target level. This paper presents the task definition, data construction process, feature schema, baseline GR model, evaluation protocol, and key findings from top-ranked and award-winning solutions. Our datasets focus on multi-modal sequence generation in an advertising setting and introduce weighted evaluation for high-value conversion events. We release our datasets at https://huggingface.co/datasets/TAAC2025 and baseline implementations at https://github.com/TencentAdvertisingAlgorithmCompetition/baseline_2025 to enable future research on all-modality generative recommendation at an industrial scale. The official website is https://algo.qq.com/2025.

Related papers

• CODA-BENCH: Can Code Agents Handle Data-Intensive Tasks? [37.616773601723416]
  CODA-BENCH is the first benchmark to jointly evaluate code and data intelligence in a data-intensive environment.<n>We construct a data-intensive Linux sandbox based on the Kaggle ecosystem.<n> CODA-BENCH comprises 1,009 tasks spanning 31 communities, with each task environment containing an average of 980 files.
  arXiv  Detail & Related papers  (2026-06-13T13:46:47Z)
• AgentExpt: Automating AI Experiment Design with LLM-based Resource Retrieval Agent [36.65355075707938]
  One key application in AI research is to automate experiment design through agentic and baseline retrieval.<n>We present a comprehensive framework for baseline and dataset recommendation.<n>We develop a reasoning-augmented reranker that exact interaction chains to construct explicit reasoning chains and finetunes a large language model to produce interpretable justifications.
  arXiv  Detail & Related papers  (2025-11-07T01:51:56Z)
• QDER: Query-Specific Document and Entity Representations for Multi-Vector Document Re-Ranking [5.469844680867749]
  We introduce QDER, a neural re-ranking model that unifies approaches by integrating knowledge graph semantics into a multi-vector model.<n>QDER's key innovation lies in its modeling of query-document relationships.<n>We first transform these fine-grained representations through learned attention patterns, then apply carefully chosen mathematical operations for precise matches.
  arXiv  Detail & Related papers  (2025-10-13T16:31:06Z)
• FORGE: Forming Semantic Identifiers for Generative Retrieval in Industrial Datasets [64.51403245281547]
  FORGE is a benchmark for FOrming semantic identifieR in Generative rEtrieval with industrial datasets.<n>For real-world applications, FORGE introduces an offline pretraining schema that reduces online convergence by half.
  arXiv  Detail & Related papers  (2025-09-25T08:44:22Z)
• APIGen-MT: Agentic Pipeline for Multi-Turn Data Generation via Simulated Agent-Human Interplay [86.01901238059261]
  APIGen-MT is a framework that generates verifiable and diverse multi-turn agent data.<n>We train a family of models -- the xLAM-2-fc-r series with sizes ranging from 1B to 70B parameters.<n>Our models outperform frontier models such as GPT-4o and Claude 3.5 on $tau$-bench and BFCL benchmarks.
  arXiv  Detail & Related papers  (2025-04-04T17:13:57Z)
• Cream of the Crop: Harvesting Rich, Scalable and Transferable Multi-Modal Data for Instruction Fine-Tuning [59.56171041796373]
  We harvest multi-modal instructional data in a robust and efficient manner.<n>We take interaction style as diversity indicator and use a multi-modal rich styler to identify data instruction patterns.<n>Across 10+ experimental settings, validated by 14 multi-modal benchmarks, we demonstrate consistent improvements over random sampling, baseline strategies and state-of-the-art selection methods.
  arXiv  Detail & Related papers  (2025-03-17T17:11:22Z)
• Generating Realistic Tabular Data with Large Language Models [49.03536886067729]
  Large language models (LLM) have been used for diverse tasks, but do not capture the correct correlation between the features and the target variable. We propose a LLM-based method with three important improvements to correctly capture the ground-truth feature-class correlation in the real data. Our experiments show that our method significantly outperforms 10 SOTA baselines on 20 datasets in downstream tasks.
  arXiv  Detail & Related papers  (2024-10-29T04:14:32Z)
• MedUniSeg: 2D and 3D Medical Image Segmentation via a Prompt-driven Universal Model [27.58715707047272]
  We introduce MedUniSeg, a prompt-driven universal segmentation model for 2D and 3D multi-task segmentation. MedUniSeg employs multiple modal-specific prompts alongside a universal task prompt to accurately characterize the modalities and tasks. We evaluate MedUniSeg on a comprehensive multi-modal upstream dataset consisting of 17 sub-datasets.
  arXiv  Detail & Related papers  (2024-10-08T11:04:01Z)
• When Pedestrian Detection Meets Multi-Modal Learning: Generalist Model and Benchmark Dataset [40.24765100535353]
  This paper introduces MMPedestron, a novel generalist model for multimodal perception. The proposed approach comprises a unified encoder for modal representation and fusion and a general head for pedestrian detection. With multi-modal joint training, our model achieves state-of-the-art performance on a wide range of pedestrian detection benchmarks.
  arXiv  Detail & Related papers  (2024-07-14T09:16:49Z)
• SMART: Scalable Multi-agent Real-time Motion Generation via Next-token Prediction [4.318757942343036]
  We introduce a novel autonomous driving motion generation paradigm that models vectorized map and agent trajectory data into discrete sequence tokens. These tokens are then processed through a decoder-only transformer architecture to train for the next token prediction task. We have collected over 1 billion motion tokens from multiple datasets, validating the model's scalability.
  arXiv  Detail & Related papers  (2024-05-24T16:17:35Z)
• M5Product: A Multi-modal Pretraining Benchmark for E-commercial Product Downstream Tasks [94.80043324367858]
  We contribute a large-scale dataset, named M5Product, which consists of over 6 million multimodal pairs. M5Product contains rich information of multiple modalities including image, text, table, video and audio.
  arXiv  Detail & Related papers  (2021-09-09T13:50:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.