Selective Test-Time Compute Scaling for Click-Through Rate Prediction via Uncertainty-Triggered Feature Path Exploration
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Scaling test-time compute has proven highly effective for language models, yet this opportunity remains largely unexplored for industrial Click-Through Rate (CTR) prediction. CTR models suffer from a fundamental asymmetry: feature combinations well-represented in training yield confident predictions, while sparsely observed ones produce unreliable outputs. Existing training-phase solutions such as adaptive gating learn a fixed selection function subject to the same sparsity, offering no per-instance recourse at deployment.We propose UTTSI (Uncertainty-Triggered Test-Time Selective Inference), a training-free model-agnostic framework that scales inference depth proportionally to per-instance uncertainty. A dual-signal estimator combining model logit confidence with a data-level frequency prior distinguishes epistemic uncertainty from aleatoric ambiguity. Every instance undergoes adaptive feature filtering to remove unreliable embeddings; uncertain instances additionally receive stochastic feature-path explorations whose predictions are aggregated via consistency-weighted ensembling. Confident instances bypass exploration entirely, keeping average overhead at approximately 2.8× base model cost with worst-case latency unchanged.Experiments on four datasets with three backbone architectures demonstrate consistent, statistically significant gains over all training-phase baselines. A seven-day online A/B test further confirms a 5.3% relative CTR gain (p < 0.01), establishing selective test-time compute allocation as a practical complement to training-phase advances for CTR prediction.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 6 of its 58 references that are in the map. First posted on arXiv 24 May 2026.
Builds on
6 of 58 references.
References · 6
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2023Scaling Relationship on Learning Mathematical Reasoning with Large Language Modelscited by 417
- 2025OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignmentcited by 167
- 2025RankMixer: Scaling Up Ranking Models in Industrial Recommenderscited by 41
- 2024MindStar: Enhancing Math Reasoning in Pre-trained LLMs at Inference Timecited by 40
- 2025DGenCTR: Towards a Universal Generative Paradigm for Click-Through Rate Prediction via Discrete Diffusioncited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026LoopCTR: Unlocking the Loop Scaling Power for Click-Through Rate Prediction
- 2025From Scaling to Structured Expressivity: Rethinking Transformers for CTR Prediction
- 2024RAT: Retrieval-Augmented Transformer for Click-Through Rate Prediction
- 2026Self-Balancing Gradient Allocation for Heterogeneity-Aware Feature Generation in Click-Through Rate Prediction
- 2026Rethinking Expressivity and Efficiency in Test-Time Training
- 2026FLOP-Efficient Training: Early Stopping Based on Test-Time Compute Awareness
- 2026Compute Aligned Training: Optimizing for Test Time Inference
- 2026SCATR: Simple Calibrated Test-Time Ranking