- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces LoopCTR for click-through rate prediction
The main idea is to increase training-time computation by repeatedly applying the same Transformer block, instead of stacking more layers with separate parameters. The model uses an Entry–Loop–Exit structure together with Hyper-Connected Residuals, Mixture-of-Experts, and supervision at every loop depth. This allows the authors to train with multiple loops but skip the Loop Block entirely at inference time
it evaluates the method on three public datasets and one industrial dataset Inhouse, reporting strong AUC and NE results, including at zero-loop inference. The paper also includes loop-depth experiments, ablations, comparisons with a stacked-layer variant, efficiency measurements, and an oracle analysis of adaptive loop depth.
Critical strengths
-
The train-multi-loop, infer-zero-loop result is practically interesting. The model trained with 3 loops performs strongly even when the Loop Block is completely skipped at inference, and this pattern appears across all four datasets. If validated more rigorously, this could offer a useful way to spend additional computation during training without increasing serving latency
-
The empirical evaluation covers several useful angles. The paper evaluates three public datasets and one industrial dataset, and includes loop-depth sweeps, component ablations, efficiency measurements, and an iso-FLOPs comparison with a stacked-layer variant. This makes the main empirical phenomenon reasonably easy to identify, even though some important controls are still missing
Critical weaknesses
I am not convinced that the zero-loop improvement is caused by loop-based reasoning. At zero-loop inference, the Loop Block is not executed at all. The deeper losses can still update the shared Entry and Exit Blocks, so the improvement may instead come from auxiliary supervision, regularization, or additional training computation. The paper lacks the most important controls, such as a compute-matched L=0 model and zero-loop results with and without process supervision
Questions for authors
- How many runs or random seeds were used for Table 2, and what observations were paired in the reported paired t-test?
- Does the efficiency eval include long-sequence compression, MoE routing, and cache construction? Were the same preprocessing and caching opportunities provided to every baseline?
- The L=0 model is already quite strong, while loop training adds only a relatively small gain. Without a compute-matched L=0 baseline, it is unclear whether the improvement really comes from loop scaling rather than the strong entry–exit backbone, extra training compute, or deep supervision
- Could the authors report zero-loop performance with and without process supervision, together with an L=0 baseline matched for total training computation?
We sincerely appreciate your time and constructive comments. We address your concerns point by point below.
[W1 / Q3–Q4] Does the zero-loop gain come from recursive training, extra compute or supervision?
Response: The zero-loop gain is a training benefit: losses at depths 0–L update the shared Entry and Exit Blocks, which remain active when the Loop Block is skipped at inference. Section 3.5 describes the multi-depth objective and zero-loop inference.
(1) Supervision control (Added experiment). On Amazon, we compare zero-loop performance with and without process supervision under the same settings:
Multi-depth supervision improves zero-loop AUC by 0.0218.
(2) Weight-sharing control (Section 4.2 comparison). We extend the Section 4.2 StackCTR comparison to zero-loop inference under matched Amazon settings and the same depth supervision:
(3) Matched training FLOPs (Added experiment). For a fair comparison, we match the training compute at approximately 7.33×10¹⁵ forward/backward matrix FLOPs on Amazon.
FLOPs count forward/backward matrix multiplications and attention operations.
[Q1] How many runs were used, and what observations were paired in the t-test?
Response: For the significance analysis, we use three runs per model and perform two-sided paired t-tests between LoopCTR and best baseline methods.
[Q2] Does timing include compression, routing and cache construction for all methods?
Response: The cached-scoring timer includes the Loop and Exit blocks, their routing operations, and prediction. User encoding, including long-sequence compression and user-side Entry processing, is timed separately. Candidate embeddings and Entry outputs are prepared before scoring. Thus, cached-scoring latency excludes cache construction and candidate preparation.
The cached benchmark also provides user-side preprocessing reuse for OneTrans, HSTU and MTGR, with candidate preparation outside their scoring timers. The cached stages follow each model's architecture.
This consistent timing convention supports a fair comparison of cached scoring latency between LoopCTR and these baselines.
Changes in the revised manuscript
Page and line numbers refer to the revised PDF.
We hope these additional experiments and analyses address your concerns and provide a basis for reconsidering your score. Thank you again for your time and constructive feedback. We would be happy to clarify any remaining questions.