- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
See three strengths stated at above. These strengthens are main contributions in addition to the comprehensive justifications via seven mathematical expressions.
Critical strengths
- A novel approach that Identifies relation-level transferability as an overlooked problem in graph-free distillation under heterophily graphs.
- A CoLIFT framework with compatibility-lifting mechanism estimates reliability-aware compatibility discovery weighted, prior-corrected class compatibility.
Critical weaknesses
Different datasets have been used to test classification results of Heterophilous Graphs and Homophilous Graphs (Table 1), comparison may not conclusive.
Questions for authors
Authors are required to conduct and report additional experiments using some same datasets for both types of graphs.
3 comments
I have no new additional comments as the authors have addressed most of my suggestions and planned to incorporate them in the revised manuscript.
Thank you for taking the time to read our responses. Your constructive suggestions will help us strengthen the manuscript in revision. If you feel that our responses have addressed your main concerns, we would be grateful if you would consider raising your score. We would be happy to discuss any remaining concerns.
Within-Dataset Evaluation Across Edge Homophily Levels
Thank you for recognizing the research problem and the compatibility-lifting mechanism, and for suggesting an evaluation at different edge homophily levels within the same dataset. We agree that differences in node features, graph size, class distributions, and data splits can affect comparisons across datasets. Table 1 evaluates CoLIFT on real-world homophilous and heterophilous benchmarks. To complement that evaluation, we conducted a within-dataset experiment on Cora and Actor.
For each dataset, we used degree-preserving edge swaps to vary edge homophily while keeping the nodes, node features, labels, train/validation/test splits, and individual node degrees fixed. We retained the original Cora graph and generated two variants with lower edge homophily. We retained the original Actor graph and generated two variants with higher edge homophily. We used the full labels to construct the semi-synthetic graphs and compute structural statistics. Given each graph, only training-node labels contributed directly to the supervised objective and compatibility estimation. We retrained GPR-GNN on each rewired graph. Within each matched run, HGMD (GPR) and CoLIFT shared the same frozen GPR-GNN teacher and student backbone initialization. Each method used a fixed configuration across homophily levels within each dataset.
We report mean test accuracy ± sample standard deviation over five runs per condition. The reported hedge is the mean observed edge homophily. The last column reports paired accuracy differences in percentage points (pp). Bold indicates the highest mean among the graph-free methods in each row.
CoLIFT achieved higher mean accuracy than HGMD (GPR) in all six conditions, with gains of 0.26–1.29 pp. The largest mean gain occurred at the intermediate homophily level on Cora and on the low-homophily original graph on Actor. On Cora at hedge=0.2099, both distilled students performed below the feature-only MLP.
These results show that CoLIFT's average gains over HGMD (GPR) persist across the tested homophily levels within each dataset. Since rewiring also changes class-pair connectivity and multi-hop neighborhoods, we interpret the results within the scope of the graph construction and training protocol used here.