- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes DeltaRec, a candidate-focal history compression framework for long-sequence recommendation. Motivated by the redundancy in long user histories and candidate-dependent historical relevance, DeltaRec uses Counterfactual Write Influence (CWI) to identify important interactions and groups candidates with similar historical utility patterns to share recurrent states. Experiments demonstrate improved recommendation accuracy and computational efficiency across multiple datasets and backbones.
Critical strengths
- The paper addresses a meaningful problem in long-sequence recommendation, with convincing empirical observations highlighting historical redundancy and candidate-dependent relevance.
- The proposed Quality–Write–State framework provides theoretical insights into candidate-specific history selection and utility-preserving state sharing.
- DeltaRec integrates CWI-guided history selection with utility-based candidate grouping, offering a coherent approach to balancing recommendation quality and computational efficiency.
Critical weaknesses
- The core idea of selecting candidate-relevant historical interactions has been extensively explored in prior studies, such as SIM [1] and TWIN [2]. Although the proposed CWI-based selection and state-sharing mechanisms offer additional contributions, the paper could better clarify its methodological novelty over existing target-aware history selection approaches.
- The theoretical analysis relies on first-order approximations around the full-history trajectory, while the proposed method performs substantial history compression. Moreover, the error bound in Theorem 2 may become loose under aggressive compression. This raises concerns about how effectively the theoretical results explain the empirical performance of DeltaRec.
- Although DeltaRec achieves substantial speedups over per-candidate state construction, the efficiency gains over the original backbones are less convincing. As shown in Table 2, DeltaRec introduces higher overall latency than the original FuXi-Linear backbone, while the improvement over HSTU is relatively modest. This somewhat weakens the practical efficiency claims.
References:
[1] Pi, Qi, et al. "Search-based user interest modeling with lifelong sequential behavior data for click-through rate prediction." Proceedings of the 29th ACM International Conference on Information & Knowledge Management. 2020.
[2] Chang, Jianxin, et al. "TWIN: TWo-stage interest network for lifelong user behavior modeling in CTR prediction at kuaishou." Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2023.
Questions for authors
In Table 1, DeltaRec achieves substantial improvements over the original backbones. However, Section 5 indicates that DeltaRec replaces the original attention mechanisms with GDR, making it difficult to attribute these gains solely to the proposed history compression strategy. Although Table 3 includes a full-length GDR variant, it only reports limited settings and metrics. Could the authors provide more comprehensive controlled comparisons across all backbones to isolate the contributions of GDR, CWI-based history selection, and state sharing?
Rebuttal to Reviewer #C1ux
We sincerely thank the reviewer for recognizing our 'meaningful problem', 'convincing observations', 'theoretical insights', and 'coherent approach'. We will answer the questions in the following.
Re: We thank you for the valuable suggestions. To address your concern, we separate GDR and the candidate-focused CWI compression strategy. In rTable 8, we keep all settings the same, including loaded checkpoints, and only change the history selection strategy. rTable 9 uses the various selection strategies on dense self-attention. The two results show the effectiveness of the proposed selection strategy.
rTable 8. Varies selection strategy on freezed GDR.
rTable 9. Varies selection strategy on native dense self-attention HSTU.
We also show the cumulative components ablations, which demonstrate the effectiveness of both DeltaRec with GDR as a unified framework and DeltaRec selection strategy.
rTable 10. Cumulative components ablations
Re: Thanks for the valuable suggestion and acknowledgements of our contributions. We clarify that candidate-aware methods were mainly explored via two-stage traditional recommendation, e.g., history modeling and candidate cross-attention, and the user model itself is indeed not target-aware. However, our perspective pushes the target-aware principle forward to unified scalable generative models where target-aware is usually cost-unacceptable, via the state-write tradeoff mechanism. We highlight the quality-efficiency frontier in a unified model instead of target-aware alone.
We will add a more detailed discussion to the Related Work to clarify this distinction. "Existing target-aware methods, such as SIM and TWIN, demonstrate the importance of candidate awareness, but they model the candidate information outside the model itself. Our work addresses the quality–computation trade-off in unified generative recommendation, where candidate-specific histories can require repeated construction. We use the same candidate-focal write utility to jointly determine which historical updates to retain and which candidates can share the resulting recurrent states."
Re: We clarify that neither theorem claims that compression necessarily improves performance. Theorem 1 explains candidate-dependent write importance, while Theorem 2 characterizes the quality–efficiency trade-off of state sharing at a fixed retention budget. We agree that aggressive compression can indeed loosen the finite-deletion bound; while tightly predicting compression error is not their objective. Moreover, we empirically examine the effect of retention on ranking quality in Figure 4(c ), including degradation when too little history is retained.
Re: Thanks for the detailed review. We clarify that the overall latency shown in Table 2 simply averages prefill and serving latency, while the 100% cache hit rate implies prefill only needs to run once in cache construction time, and serving latency dominates the real serving cost, which shows significant gains over the backbone: looking into the serving latency in rTable 11, DeltaRec achieves significant gains with 37% and 89% less serving latency. We will revise the related claims in the final version.
rTable 11. Latency and cache hits across all 11,010 eligible KuaiRand-1K histories.