- Rating
- 2
- Confidence
- 2(−1)
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The authors claimed that in previous contrastive learning methods for recommender system, the data augmentation will destroy the topology of the interaction graph. PRGCL introduces learnable auxiliary prototype nodes and establishes new connections based on their associations with users and items, providing additional channels for information propagation. It constructs two augmented graph views and jointly optimizes a recommendation ranking loss, a contrastive learning loss, and auxiliary regularization terms to learn more effective user and item representations. The authors report state-of-the-art performance on all three evaluated datasets: Douban-book, Tmall, and Alibaba-iFashion.
Critical strengths
- The motivation of this paper is pretty interesting. It is an interesting idea to find an augmentation methods that will not destroy the topology.
- The authors give some theoretical proofs for this paper, which makes the paper more convincing.
Critical weaknesses
The main weakness of this paper lies in its experimental evaluation. I would be willingly to reconsider my score if the revised version provides a more comprehensive and convincing experimental assessment.
- The evaluation is limited to three datasets and omits Amazon-Book, an established benchmark also used by MixRec. Could the authors justify their dataset selection and consider including Amazon-Book to broaden the evaluation? Furthermore, the MixRec results on the two shared datasets differ from those reported in its original paper: Recall@20 is 0.1668 versus 0.1778 on Douban-Book, and 0.0875 versus 0.0900 on Tmall. Could the authors explain these discrepancies, including any differences in preprocessing, data splits, evaluation protocols, or hyperparameter tuning, and disclose any difficulties reproducing the original results? If it is because some of the methods cannot be reproduced (It is pretty common in the field of recommender system), I can fully understand and we can discuss a way to make the results more convincing.
- The current ablation study mainly evaluates individual components within PRGCL. Controlled comparisons with related methods such as SimGCL would be informative—for example, swapping view-construction strategies while keeping the backbone, contrastive objective, and training settings fixed. Such experiments would help isolate which design choices account for the improvements over existing approaches.
- Although the appendix includes a case visualization, a more detailed analysis of specific propagation paths would make the mechanism clearer. Could the authors trace representative user–item pairs and illustrate how reconstructed connections change their propagation paths and recommendation rankings compared with SimGCL? This would provide a more concrete connection between the proposed mechanisms and the observed gains.
- (Not weakness but a question...I just want to put them together) Can this methods be applied on more general graph tasks?Or it is specially designed for recommender system?
Questions for authors
See weaknesses
3 comments
W4
To further examine the applicability of PRGCL beyond recommendation, we extended it to the Link Prediction task and compared it with GAE[4] and AICoG[5]. When = 8 and = 8, PRGCL achieves the best performance:
| Dataset | Model | AUC | AP |
|---|---|---|---|
| Enzyme | GAE | 0.9558 | 0.9613 |
| AICoG | 0.9796 | 0.9696 | |
| PRGCL | 0.9881 | 0.9919 | |
| IonChannel | GAE | 0.9322 | 0.9191 |
| AICoG | 0.9747 | 0.9735 | |
| PRGCL | 0.9739 | 0.9810 |
PRGCL achieves the best performance on Enzyme and remains competitive with AICoG on IonChannel, outperforming GAE on both datasets. These results suggest that the proposed coupled reconstruction principle can also benefit general graph learning tasks.
Reference
[1] Wang W, et al. Denoising implicit feedback for recommendation. [C]// WSDM 2021.
[2] Wang X, et al. Neural graph collaborative filtering[C]// SIGIR 2019.
[3] He X, et al. Lightgcn: Simplifying and powering graph convolution network for recommendation[C]// SIGIR 2020.
[4] Kipf, T. N., & Welling, M. (2016). Variational graph auto-encoders. arXiv preprint arXiv:1611.07308.
[5] N. Nakis et al. Aitchison Embeddings for Learning Compositional Graph Representations. [C]// ICML 2026.
Thanks for responses. After reading all the responses and other reviewers' comments, I plan to maintain the score.
We thank reviewer ucgq and provide our responses below.
W1
Dataset Selection. We selected Douban-book, Alibaba-iFashion, and Tmall to evaluate the generality of the coupling reconstruction principle across user-item graphs with different domains, scales, and sparsity levels. Amazon-book and Douban-book both belong to the book recommendation domain, while Alibaba-iFashion provides a different recommendation scenario with 300,000 users and an interaction density of 0.01%. Moreover, previous studies have identified false-positive interactions in Amazon-book[1], which may affect the performance of methods designed to data augmentation. We therefore prioritized Alibaba-iFashion to broaden the evaluation settings and will include Amazon-book in the revision. We will include Amazon-book dataset in the revised version.
MixRec Reproduction. We evaluated all baselines under a unified experimental framework to ensure a fair comparison and minimize the influence of other factors. Following the SimGCL implementation, we filter duplicate negative samples within each batch when computing the InfoNCE loss, while MixRec does not apply this filtering. This difference may explain the performance variations on Douban-book. Furthermore, MixRec removed some interactions during preprocessing, leaving 2,357,450 interactions in its Tmall dataset, approximately 90% of the 2,619,389 in our dataset, which may explain the performance differences. We appreciate the reviewer's constructive feedback and will further clarify the final results in a subsequent update.
Experimental Settings. To ensure a fair comparison, we evaluated all baselines under a unified PyTorch framework with a fixed random seed of 2026. Following previous classical studies [2, 3], we randomly split the datasets into training and test sets at a ratio of 8:2. For data preprocessing, we used the existing integer user and item IDs to construct a user-item bipartite graph from the training interactions and applied symmetric degree normalization. We adopted full-ranking evaluation with observed interactions masked and reported Recall@K and NDCG@K (K = 10, 20). All GCN-based models use 64-dimensional embeddings, 3 layers, and Xavier initialization. We used Adam with a learning rate of 0.001, an L2 coefficient of 0.0001, a batch size of 4096, and early stopping with a patience of 20. Experiments were conducted on an RTX 4090 GPU, except for DimCL on Alibaba-iFashion due to memory requirements. Some details are provided in Section 4.1, 4.4, and Appendix A.7.1, A.7.6.
W2
We conducted an experiment by replacing PRGCL's reconstructed views with SimGCL's reconstructioned views(+SimGCL_views), while keeping the GCN backbone, contrastive objective, and training settings unchanged :
+SimGCL_views does not perform as well as PRGCL. These results further support the contribution of learned path reconstruction to recommendation performance.
W3
Appendix A.7.2(Table 5) examines the survival and recovery of three-hop propagation paths, showing that affinity shortcuts can restore disrupted connections. The shortest-path view ablation further demonstrates the contribution of learned reconstructed views to recommendation performance. In addition, Appendix A.7.3(Figure 4) compares the local graph structures and Top-K predictions of PRGCL and SimGCL.
To further clarify the mechanism, we traced three user–item pairs from Douban-book, Tmall, and Alibaba-iFashion. The results show that PRGCL introduces additional three-hop propagation paths through learned affinity shortcuts in both reconstructed views. For the Douban-book pair (u10689, i5), the replacement view introduces the path u10689 → Q202 → u12079 → i5, while the addition view introduces u10689 → i725 → P509 → i5. The target item ranks 1st in PRGCL and 22,319th in SimGCL. Similar reconstructed paths are observed on Tmall and Alibaba-iFashion, where the corresponding rankings are 7th versus 39,788th and 10th versus 105th, respectively. These cases illustrate the changes in propagation paths and their association with improved recommendation rankings. We will include the detailed results in Appendix A.7.3.