- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper addresses item cold-start in graph-based recommender systems. The proposed method, SSB, follows a locate-and-borrow scheme: for each cold item it retrieves the top- warm items that are nearest in the dense feature space of an external, fine-tuning-free LLM item encoder, and lets the cold item borrow the structural information of these warm semantic neighbors. In effect, this injects one-way soft edges from the cold item to its warm neighbors, each weighted by a learned soft attention. The model is built on LightGCN. The final representation of a cold item is a convex combination of the projected LLM content embedding and, for each LightGCN propagation layer, the attention-weighted aggregate of the neighbors' layer-wise structural embeddings. Combining the pseudo-cold mask method, the soft readout of structure, and the learned layer weights, the method outperforms existing cold-start baselines on Sports and Toys and is comparable to CGRC on Beauty.
Critical strengths
S1. The hierarchical structure aggregation is an original component. The default model (Eq. 6) reads a neighbor's representation separately for each propagation layer , keeps the semantic prior as layer zero, and learns the layer weights . Decoupling how much to borrow from each neighbor () from which order of structural signal to read () is a well-motivated design, and I am not aware of prior work that borrows layer-wise representations in this way.
S2. Effect sizes are reported with variance. SSB and CGRC are run over five seeds with mean ± std (Table 2). The improvement over CGRC on cold items is convincing on Sports (Recall@20 8.28 ± 0.11 vs. 6.81 ± 0.23, +21.6%) and Toys (15.54 ± 0.16 vs. 14.78 ± 0.10), and the paper explicitly reports that SSB is comparable to CGRC on Beauty overall and below CGRC on the rarest bucket.
Critical weaknesses
W1. The formulation is not compared, analytically or empirically, with closely related existing methods, and the novelty is limited once the formulation is made explicit.
Eq. (5) (MLP fusion with a scalar gate) is presented as part of the method but is not used in the default model; the default model is Eq. (6), a normalized convex combination of the projected semantic embedding and attention-weighted neighbor embeddings. Since in LightGCN
borrowing is exactly what LightGCN would compute for the cold item if it were attached, one-way, to the users of its neighbors through soft edges of weight . The method is therefore a representation-level, one-way edge augmentation of the user–item graph driven by a content kNN, with learned edge weights.
This construction coincides with that of GraphDA (Fan et al., SIGIR 2023). GraphDA augments the adjacency matrix with an item–item block whose non-zeros are the top- neighbors under embedding similarity (their Eq. 5, binary and symmetric) and re-trains a LightGCN on the augmented graph. Compared term by term, SSB differs from GraphDA in: the similarity source (frozen text embeddings instead of pre-trained collaborative embeddings, which is what makes the construction applicable to cold items), one-way instead of symmetric edges, softmax attention instead of degree-normalized binary weights, layer-wise reading with learned instead of uniform layer averaging, and end-to-end instead of two-stage training. These differences are substantive, but the paper neither cites GraphDA nor isolates any of them experimentally, so it cannot be determined which of them, if any, accounts for the reported gains. Content-kNN item–item graphs in multimodal GNN recommenders (e.g., LATTICE, Zhang et al., MM 2021) and virtual-neighbor approaches for isolated nodes (e.g., Cold Brew, Zheng et al., ICLR 2022) may also be relevant; I have not examined them in detail and mention them only as pointers.
W2. The ablations are not controlled, and natural baselines are missing.
- wo_hierarchical (Fig. 2) changes three factors simultaneously — layer-wise reading vs. reading the mixed structural embedding , inclusion of in the borrowed value, and linear convex combination vs. MLP with a gate — so its −13.9 / −10.2 / −4.9% cannot be attributed to the layer weights.
- There is no ablation of the soft attention: neither uniform nor cosine-softmax weights over the same top- set. With (Beauty) and (Toys) the learned weights have little room to differ from fixed weights, so this ablation is inexpensive and informative.
- There is no fixed-weight kNN fold-in baseline — a frozen LightGCN with the cold item set to the similarity-weighted mean of its top- neighbors' embeddings (layer-wise or mixed). This is the parameter-free counterpart of the proposed method and the natural reference point for every learned component. Likewise there is no kNN edge-augmentation baseline (GraphDA-style) built from the same LLM similarity.
- All ablations use a single seed (§4.4), and the -axes in Fig. 2 are truncated.
Without items 2–3, the gains in Table 2 cannot be attributed to any of the proposed components.
Questions for authors
- Could you report (a) a fixed-weight baseline in which a frozen LightGCN is used and the cold item is set to the cosine-weighted (or uniform) mean of its top- warm neighbors' embeddings, and (b) SSB with the learned attention replaced by a softmax over the LLM cosine similarities on the same top- set? These would show how much of the gain in Table 2 is due to the learned components.
- The borrowing step can be read as a one-way soft edge augmentation of the user–item graph driven by a content NN, which is the construction of GraphDA (Fan et al., SIGIR 2023) with a different similarity source. Could you discuss how SSB relates to this line of work and, if possible, compare against a GraphDA-style item–item augmentation built from the same LLM similarity?
- Please report the learned layer weights for all layers on each dataset (currently only is given for Beauty and Sports), ideally together with the norms so that the effective contribution of each layer can be assessed.
- To confirm my reading of §3.5: in the default model (Eq. 6), the MLP and gate of Eq. (5) are not used, and the neighbors' layer-zero embeddings enter only through the attention keys, not through the borrowed values. Is this correct?
Response by Authors
We thank the reviewer for the GraphDA comparison and the scrutiny of our ablations. We have narrowed the novelty claim and added the missing controls.
W1. Relation to existing formulations
We agree that content-kNN item-item augmentation is not a new primitive. At the first structural layer, the borrowing read can be expressed as a one-way content-kNN edge augmentation. GraphDA obtains neighbors from pretrained collaborative embeddings, adds a symmetric top-K item-item block, and retrains LightGCN. LATTICE builds modality-specific item graphs from multimodal features. Cold Brew performs latent neighborhood discovery for isolated nodes in a teacher-student framework.
SSB targets the zero-interaction setting. Its neighbors come from frozen item text, the warm graph is not modified, and the cold item performs a conditional one-way read with separate neighbor and layer weights. We do not attribute every gain to these differences. The novelty is the formulation and operationalization of text-only locate-and-borrow, not the invention of content-kNN augmentation.
W2. Controlled ablations
The original wo_hierarchical variant is a compound intervention. It changes layer-wise reading to a mixed structural embedding, changes whether the neighbors' layer-zero state enters the borrowed value, and replaces the linear fusion in Equation (6) with the MLP and gate in Equation (5). Its drop cannot be attributed solely to hierarchy. We now label this component ablation as a single-seed diagnostic.
Under the same encoder, neighbors, warm graph, pseudo-cold mask, fusion form, and training budget, the Beauty results over five seeds are:
Uniform and LLM-cosine weighting outperform learned attention. The one-layer and two-layer learned variants are nearly tied. Learned attention and hierarchy are therefore not universal sources of gain.
Q1. Fixed-weight and learned-readout comparisons
For the frozen-LightGCN diagnostic, a cold item is the uniform or LLM-cosine mean of its top-K warm neighbors without learned borrowing or pseudo-cold training. On Beauty with seed 42, these variants obtain 11.59/6.32 and 11.59/6.52 Recall@20/NDCG@20. This diagnostic uses one seed.
Within SSB training, fixed LLM-cosine obtains 16.23/8.66 over five seeds, compared with 15.38/7.98 for learned attention. The gain is therefore not attributable to learned attention.
Q2. GraphDA-style comparison
A true cold item has no collaborative embedding, so we adapt GraphDA with the same frozen LLM similarities, retain its item-item augmentation and retraining procedure, and select the item-item weight on validation data. The selected value is 0.5 on all datasets.
GraphDA-style is stronger on Beauty and Toys. On Sports, SSB has higher Recall@20 while GraphDA-style has higher NDCG@20. We report this dataset-dependent tradeoff and do not claim uniform superiority.
Q3. Learned layer weights
All structural states are L2-normalized, so each layer norm is 1.0 and the effective contribution equals βl.
Layer 1 has the largest effective weight on all datasets. This replaces the earlier incorrect statement that Beauty assigns its largest weight to the semantic layer.
Q4. Default model and layer-zero values
The reviewer's reading is correct. The default model uses Equation (6), while Equation (5) and its MLP plus scalar gate are only a single-layer fallback. Neighbor Ej is used as the attention key, neighbor Ej(0) does not enter the borrowed value, values start at l=1, and c(0) is the cold item's semantic prior.
Manuscript changes
We added GraphDA, LATTICE, and Cold Brew to Related Work, narrowed the novelty claim, added the GraphDA-style and fixed-readout comparisons, repaired the hierarchy interpretation, reported all five-seed layer weights, and clarified Equations (5) and (6). The original component ablation and frozen-LightGCN diagnostic remain single-seed.