arXiv:2512.07650cs.IRcs.LG2025-12

测试时通过合并预测实现推荐系统高效扩展

Exploring Test-time Scaling via Prediction Merging on Large-Scale Recommendation

  • 利用不同架构或初始化的模型生成多样化预测
  • 相同推理预算下,测试时扩展优于参数扩展
  • 支持线上并行部署,用户端延迟不变

受语言模型成功的启发,大规模推荐系统(DLRS)的模型规模扩展成为近期趋势。以往方法均在训练阶段扩展模型参数,但测试阶段如何高效利用计算资源仍缺乏探索。本文提出两种测试时扩展策略:利用不同模型架构的异构性,或在同一架构下利用初始化的随机性生成多样化输出。在三个基准数据集上对八种模型(包含经典与SOTA模型)进行评估,结果证明两种方法均有效。进一步验证,在相同推理预算下,测试时扩展性能优于参数扩展。该方法可随并行服务器数量增加而无缝加速,不影响用户侧推理时间。代码已开源。

原文摘要 · Abstract (English)

Inspired by the success of language models (LM), scaling up deep learning recommendation systems (DLRS) has become a recent trend in the community. All previous methods tend to scale up the model parameters during training time. However, how to efficiently utilize and scale up computational resources during test time remains underexplored, which can prove to be a scaling-efficient approach and bring orthogonal improvements in LM domains. The key point in applying test-time scaling to DLRS lies in effectively generating diverse yet meaningful outputs for the same instance. We propose two ways: One is to explore the heterogeneity of different model architectures. The other is to utilize the randomness of model initialization under a homogeneous architecture. The evaluation is conducted across eight models, including both classic and SOTA models, on three benchmarks. Sufficient evidence proves the effectiveness of both solutions. We further prove that under the same inference budget, test-time scaling can outperform parameter scaling. Our test-time scaling can also be seamlessly accelerated with the increase in parallel servers when deployed online, without affecting the inference time on the user side. Code is available.

推荐系统测试时扩展模型融合

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。