MATT-CTR: Unleashing a Model-Agnostic Test-Time Paradigm for CTR Prediction with Confidence-Guided Inference Paths
Not on the map. Why?
Abstract (arXiv)
Recently, a growing body of research has focused on either optimizing CTR model architectures to better model feature interactions or refining training objectives to aid parameter learning, thereby achieving better predictive performance. However, previous efforts have primarily focused on the training phase, largely neglecting opportunities for optimization during the inference phase. Infrequently occurring feature combinations, in particular, can degrade prediction performance, leading to unreliable or low-confidence outputs. To unlock the predictive potential of trained CTR models, we propose a Model-Agnostic Test-Time paradigm (MATT), which leverages the confidence scores of feature combinations to guide the generation of multiple inference paths, thereby mitigating the influence of low-confidence features on the final prediction. Specifically, to quantify the confidence of feature combinations, we introduce a hierarchical probabilistic hashing method to estimate the occurrence frequencies of feature combinations at various orders, which serve as their corresponding confidence scores. Then, using the confidence scores as sampling probabilities, we generate multiple instance-specific inference paths through iterative sampling and subsequently aggregate the prediction scores from multiple paths to conduct robust predictions. Finally, extensive offline experiments and online A/B tests strongly validate the compatibility and effectiveness of MATT across existing CTR models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 42 of its 66 references that are in the map. First posted on arXiv 10 Oct 2025.
Builds on
42 of 66 references.
References · 42
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,359
- 2016Wide & Deep Learning for Recommender Systemscited by 745
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
- 2022Recommendation as Language Processing (RLP): A Unified Pretrain, Personalized Prompt & Predict Paradigm (P5)cited by 396
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
- 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 326
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
- 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
- 2023Recommender Systems with Generative Retrievalcited by 191
- 2020Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Predictioncited by 176
30 more
- 2023Adapting Large Language Models by Integrating Collaborative Semantics for Recommendationcited by 171
- 2025OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignmentcited by 167
- 2024AlphaMath Almost Zero: Process Supervision without Processcited by 160
- 2024Toward Self-Improvement of LLMs via Imagination, Searching, and Criticizingcited by 123
- 2021Contrastive Learning for Representation Degeneration Problem in Sequential Recommendationcited by 121
- 2020Empowering Things with Intelligence: A Survey of the Progress, Challenges, and Opportunities in Artificial Intelligence of Thingscited by 110
- 2024Learnable Item Tokenization for Generative Recommendationcited by 106
- 2023How to Index Item IDs for Recommendation Foundation Modelscited by 102
- 2017Adversarial Multi-task Learning for Text Classificationcited by 91
- 2019FiBiNET: Combining Feature Importance and Bilinear feature Interaction for Click-Through Rate Predictioncited by 83
- 2023PEPNet: Parameter and Embedding Personalized Network for Infusing with Personalized Prior Informationcited by 60
- 2018Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertisingcited by 59
- 2024IDGenRec: LLM-RecSys Alignment with Textual ID Learningcited by 50
- 2021MaskNet: Introducing Feature-Wise Multiplication to CTR Ranking Models by Instance-Guided Maskcited by 48
- 2025MTGR: Industrial-Scale Generative Recommendation Framework in Meituancited by 47
- 2025RankMixer: Scaling Up Ranking Models in Industrial Recommenderscited by 41
- 2016Learning Hidden Unit Contributions for Unsupervised Acoustic Model Adaptationcited by 38
- 2020Towards Automated Neural Interaction Discovery for Click-Through Rate Predictioncited by 37
- 2021Deep Learning for Click-Through Rate Estimationcited by 33
- 2023On the Embedding Collapse when Scaling up Recommendation Modelscited by 29
- 2024CALRec: Contrastive Alignment of Generative LLMs for Sequential Recommendationcited by 23
- 2024Enhancing Taobao Display Advertising with Multimodal Representations: Challenges, Approaches and Insightscited by 23
- 2021Hierarchically Modeling Micro and Macro Behaviors via Multi-Task Learning for Conversion Rate Predictioncited by 21
- 2023Towards Deeper, Lighter and Interpretable Cross Network for CTR Predictioncited by 20
- 2022Re4: Learning to Re-contrast, Re-attend, Re-construct for Multi-interest Recommendationcited by 19
- 2022Enhancing CTR Prediction with Context-Aware Feature Representation Learningcited by 17
- 2022Alleviating Cold-start Problem in CTR Prediction with A Variational Embedding Learning Frameworkcited by 13
- 2025Data Augmentation as Free Lunch: Exploring the Test-Time Augmentation for Sequential Recommendationcited by 9
- 2024Fusion Matters: Learning Fusion in Deep Click-through Rate Prediction Modelscited by 3
- 2025DGenCTR: Towards a Universal Generative Paradigm for Click-Through Rate Prediction via Discrete Diffusioncited by 2
Built on by
Not cited yet.