- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces Event State Prediction (ESP) for sequential recommendation. Specifically, the method adds two event-level objectives to standard next-token prediction. One focuses on learning representations within an event, while the other predicts the next event from the current event state. Both use contrastive learning with an EMA encoder. Experiments are conducted on four datasets using the HSTU backbone, with comparisons against recent methods.
Critical strengths
- The proposed objectives introduce event-level supervision without changing the backbone or increasing inference-time model complexity.
- The experimental design is relatively sufficient.
Critical weaknesses
- As noted in Section 4.2, later causal teacher states can access this token even after leave-one-out pooling. It seems that the intra-event target may still contain information from the source token.
- ESP takes 1.37× longer to train than NTP on MerRec, but no comparison under the same computational budget is provided. The additional training cost may need further consideration.
- The performance gains of ESP on KuaiRec are relatively small. However, Appendix D.3 indicates that the TDL component of NONTP is disabled on this dataset. It is unclear how this modification affects the comparison, which may need further clarification.
Questions for authors
- Could the authors clarify how much information from the source token remains in the intra-event target after leave-one-out pooling?
- Could the authors compare ESP with NTP under the same computational budget?
- Could the authors explain why the TDL component of NONTP is disabled on KuaiRec?
3 comments
I appreciate the authors' careful responses and the additional analyses in the revised manuscript. The source-exclusion study and strict source-deletion ablation provide useful evidence that the residual source-token dependence in the intra-event targets does not materially affect the reported gains. The compute-matched comparison with longer-trained NTP baselines also strengthens the experimental evaluation. Moreover, the explanation for using a TCL-only NONTP variant on KuaiRec is reasonable given the absence of suitable action-domain labels. Overall, I find that the authors have adequately addressed my main concerns, and the revision has improved the clarity and credibility of the work. I am therefore inclined to increase my rating from 3 to 4.
Thank you! We are happy that our rebuttal addressed your concerns, and we thank you again for your constructive suggestions.
Source-Token Information in Intra-Event Targets (W1, Q1)
We thank the reviewer for highlighting this subtle point. Leave-one-out pooling excludes the source position's teacher state, but subsequent causal teacher states may still contain information from the source token. Importantly, this does not introduce future information into the causal online query.
To quantify this residual dependence, we measure target sensitivity using fixed-slot source exclusion: we zero the source input embedding and its keys and values at each attention layer while keeping sequence positions, timestamps, and event membership fixed. Across MerRec, RetailRocket, and KuaiRec, target cosine similarities for First/Middle/Last positions are 0.9976/0.9995/1.0000, 0.9839/0.9938/1.0000, and 0.9923/0.9981/1.0000, respectively. This confirms measurable but decreasing sensitivity toward event boundaries.
To assess the impact of this residual information, we conduct additional target-construction ablations, including strict source deletion, which removes the source token from the teacher input and recomputes the event target (NDCG@10/HR@10).
While target similarity does not directly measure mutual information, these results indicate that ESP's gains do not critically depend on residual source-token information in the intra-event targets.
Training Efficiency and Compute-Matched Comparison (W2, Q2)
To assess whether ESP's gains simply arise from additional training computation, we extend NTP training to 14 epochs, providing comparable or larger estimated training-time budgets than ESP across the three datasets (NDCG@10/HR@10).
ESP consistently outperforms the longer-trained NTP baseline, indicating that its gains cannot be explained merely by additional training time. Furthermore, Appendix F.4 (Figure 14) shows that ESP achieves a lower late-stage NTP training loss. Importantly, ESP introduces no additional inference cost, as all auxiliary components are discarded after training.
NONTP Configuration and KuaiRec Performance (W3, Q3)
We thank the reviewer for requesting this clarification. As described in Appendix D.3, NONTP's TDL requires behavioral domain labels, using historical states from domains different from that of the next prediction target. For MerRec, RetailRocket, and AppRec, we use action types as domain mappings and retain the full NONTP objective (TCL + TDL). In contrast, KuaiRec consists of video interactions without a corresponding action-domain label. We therefore retain TCL while disabling the inapplicable TDL component, rather than introducing arbitrary domain assignments.
This is a dataset-specific adaptation, not a selective modification of the baseline.
We have revised the manuscript, and highlight the main changes in green. The full setup for above experiments are provided in Appendix E.2.3 and F.5.2. We hope these additions address your concerns, and we appreciate your valuable feedback.