- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Warmth Propagation, a post-hoc method for item cold-start recommendation that transfers collaborative information from warm items to cold items through content-based relationships. The method first learns an item reconstruction matrix from content embeddings using an EASE-style objective, then transfers these reconstruction relationships to collaborative embeddings through a regularized least-squares formulation. By exploiting the low-rank structure of the content matrix and the Woodbury identity, the authors derive an exact closed-form solution that avoids constructing item-by-item matrices and scales linearly with catalog size for fixed embedding dimensions. Experiments on three datasets with SASRec and BERT4Rec report improvements in cold-item recommendation while largely preserving overall performance.
Critical strengths
S1. The post-hoc formulation addresses a practically relevant constraint. The method can improve cold-item representations without modifying the recommendation backbone or retraining it with a specialized cold-start objective, provided that suitable content-initialized embeddings are available. This makes the approach potentially useful for adapting existing recommendation systems.
S2. The scalable closed-form solution is a useful technical contribution. The authors exploit the structure of the content reconstruction problem to avoid explicit item-by-item matrices, reducing the main computational dependence to matrices whose dimensions are determined by the content embedding size. This offers an attractive alternative to directly solving large-scale embedding propagation problems.
Critical weaknesses
W1. The methodological novelty over existing embedding reconstruction and propagation techniques is limited. The two optimization stages build directly on EASE, LLE, graph regularization, and ImplicitSLIM, all of which are acknowledged. The main additional contribution appears to be their combination with content embeddings and an efficient algebraic solution. Furthermore, closely related work on content-based collaborative information transfer is missing from the discussion, particularly Content-based Graph Reconstruction for Cold-start Item Recommendation (Kim et al., SIGIR 2024) and Proxy-based Item Representation for Attribute and Context-aware Recommendation (Seol et al., WSDM 2024). The authors should clarify the distinctions from these methods and more precisely identify the methodological contribution beyond existing reconstruction formulations.
Kim, J., Kim, E., Yeo, K., Jeon, Y., Kim, C., Lee, S., and Lee, J. Content-based Graph Reconstruction for Cold-start Item Recommendation. SIGIR 2024.
Seol, J., Gang, M., Lee, S.-G., and Park, J. Proxy-based Item Representation for Attribute and Context-aware Recommendation. WSDM 2024.
W2. The experiments do not sufficiently establish the claimed scalability advantage or the significance of the performance gains. On Beauty, exact kernel regression achieves 0.057 cold NDCG@10 compared with 0.058 for Warmth Propagation, suggesting that computational efficiency may be the primary advantage over this strong baseline. However, no systematic wall-clock time, peak memory, or catalog-size scaling results are reported to substantiate the claimed negligible overhead. The results also lack variability across training seeds or data splits. Moreover, the method uses a cold-item-focused validation objective, and it is unclear whether the competing methods receive comparable hyperparameter optimization. These issues make the practical advantage difficult to assess conclusively.
Questions for authors
See weaknesses.
We thank the reviewer for their careful reading of our paper, thoughtful comments, and constructive feedback. We address the raised points below.
W1: The objectives of the proposed approach are indeed similar to those of ImplicitSLIM. However, in the considered setting, we employ content similarity rather than collaborative similarity, which allows us to make the Step 2 objective of ImplicitSLIM simpler and more natural. Moreover, the analytical solution of WP is completely novel (except for the part where both ImplicitSLIM and WP build upon the analytical solution of EASE) and involves no approximations, unlike ImplicitSLIM. We consider the proposed analytical solution to be one of the most important contributions of the paper.
Q1: We performed this experiment with all baseline mappers (linear regression, MLP, and approximate kernel regression) but did not report the results because they were very close to those obtained when updating only cold-item embeddings. Thus, unfortunately, interpolation between predicted and original warm-item embeddings does not resolve the problem discussed in Section 5.3.
Q2: Yes, both warm-item and cold-item embeddings are updated here. As we reported in Section 4.3, updating only cold-item embeddings leads to near-zero performance on cold items.