- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper introduce CoGraC, an end-to-end framework that turns local structure into reusable numerical program, and with the compiled program, it support new connections and queries without rerunning the encoder. Experiments show that CoGraC improves compositional link prediction and transfers across domains with a frozen compiler.
Critical strengths
The idea is interesting. CoGraC can turns the local structure into reusable module, which make learning on a updated graph much easier, and also CoGraC improves compositional link prediction and transfers across domains with a frozen compiler.
Critical weaknesses
- Generalization. The paper only report the result with custom encoder in Appendix A.1, and with GINE attribute frontend. The generalization to other SoTA graph model(MPNN and graph transformers) remains unclear.
- Efficiency. Section 2.1&2.2 raise a concern about the computational compleixty of CoGraC, and the authors lack a discusssion about this. According to Table 3&Table 18, it seems that GPR shows the comparable performance while much more efficient(~13x faster).
Questions for authors
- Can author further discuss the generalization to other SoTA graph models rather than the custom encoder in Appendix A.1? If the method can not be applied to other SoTA models, it will strictly limit the contribution of this paper.
- What is the computational compleixty of CoGraC compared with other methods?
3 comments
Follow-up regarding manuscript revision
Thank you once again for your constructive feedback and time. We have revised our manuscript to address your suggestions and uploaded the updated PDF.
Specifically, we added experiments with GCN and component-local Transformer encoders in Section 3.4 and Appendix B.7. Both encoders retain the benefits of composition training while using the same program representation and executor. We also added a computational complexity analysis in Appendix A.3 to explain the costs of local compilation and global execution, and which computations reuse avoids. Section 3.4 and Appendix E.1 now include a direct comparison with GPR64 on the same rewiring workload. CoGraC achieves higher AP and lower total runtime on these requests, including preparation costs.
We hope these revisions and our earlier responses address your concerns. If you have any remaining questions or further suggestions, we would be glad to discuss them.
I thank the authors for the response. While the experimental results are strong, the paper’s presentation, particularly the experimental section, leaves me leaning toward weak rejection. Moreover, the strong performance of the proposed method with GCNs and Transformers makes the choice of a custom encoder in the original submission even more confusing. Overall, I find the idea interesting, but I believe the paper requires substantial revisions to its writing and organization, as well as a more comprehensive evaluation of CoGraC with SoTA architectures.
Response to Reviewer K96u
Thank you for your thoughtful feedback and for recognizing the potential of reusable graph programs. We have followed up on your questions with additional encoder experiments and a direct comparison of computational cost.
Weakness 1 / Question 1: Encoder generalization
Thank you for pointing out the need to test CoGraC with other encoders. We wanted to check whether CoGraC's gains depend on the custom encoder, so we repeated the experiment with a GCN and a component-local Transformer. Both have two layers and width 32. They encode ports and internal nodes through the same interface. We kept the operator heads, program representation, and executor unchanged.
Both encoders retain the benefit of composition. On New-node, Full improves over Local by 1.70 AP points with GCN and 2.01 points with Transformer. We then held the execution interface fixed to check how much composition training contributes. We froze each compiler and fitted fresh readouts under the same global interface and training protocol. Full training still improves over Local training by 0.71 ± 0.50 points for GCN and 1.02 ± 0.30 for Transformer. The gains remain positive in all five seeds. Here, ± denotes the sample SD of paired differences. This shows that both encoder families can support reusable programs and benefit from training through composition.
Weakness 2 / Question 2: Computational complexity and efficiency
Thank you for highlighting the need for a clearer cost analysis. CoGraC first compiles each component and then executes the programs together. This distinction matters because it can reuse the first step when only the connections change.
Let rj and bj count the internal nodes and ports in component j. Beyond encoding, dense local elimination costs ∑jO(rj3+rj2bj+rjbj2). Dense global factorization and solves cost O(P3+P2h) for P global ports and h right-hand sides. New wiring requires another global computation, but unchanged components keep their compiled programs. Our Cora implementation uses full-coordinate sparse LU, so fill-in affects its cost. GPR remains faster in that setting.
To see whether reuse can offset these costs, we ran both methods on the same 96 rewiring requests under the same CPU/thread settings. CoGraC completed the workload in 0.564 s, compared with 0.744 s for GPR64. We included program preparation and wiring updates in these totals and timed model loading separately. CoGraC therefore reduces cumulative cost by 24.3% and runs faster in all five seeds.
The savings also come with better predictions. On the same requests, CoGraC improves Original/New-node AP over GPR64 by 5.50/6.13 points. Both the accuracy and speed advantages hold across all five seeds. Together, these results show the practical value of reuse when connections between components change.