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

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lyu, Fuyuan, Chen, Zhentai, Jiang, Jingyan, Li, Lingjie, Tang, Xing, He, Xiuqiang, Liu, Xue
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917132993822720
author Lyu, Fuyuan
Chen, Zhentai
Jiang, Jingyan
Li, Lingjie
Tang, Xing
He, Xiuqiang
Liu, Xue
author_facet Lyu, Fuyuan
Chen, Zhentai
Jiang, Jingyan
Li, Lingjie
Tang, Xing
He, Xiuqiang
Liu, Xue
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2512_07650
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Exploring Test-time Scaling via Prediction Merging on Large-Scale Recommendation
Lyu, Fuyuan
Chen, Zhentai
Jiang, Jingyan
Li, Lingjie
Tang, Xing
He, Xiuqiang
Liu, Xue
Information Retrieval
Machine Learning
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.
title Exploring Test-time Scaling via Prediction Merging on Large-Scale Recommendation
topic Information Retrieval
Machine Learning
url https://arxiv.org/abs/2512.07650