- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
AgenticGNN uses graph-feature perception, spectral context, and input/output spectral feedback to guide evolutionary generation of GNN propagation operators by an LLM. A knowledge base stores graph features, design rationales, and evaluation experience for cross-task reuse. With the surrounding backbone and training procedure fixed, the framework searches propagation operators and evaluates them on multiple node-classification datasets, with component and knowledge-base ablations.
Critical strengths
1.Graph features and spectral-change feedback provide targeted guidance for operator search, with initial support from the ablation experiments. 2.The method is competitive across the evaluated datasets. Knowledge-base experiments include a single-task control and exclude prior experience from the target dataset.
Critical weaknesses
1.Appendix F.4 does not construct the claimed cubic graph propagation, while F.9’s Fourier band-pass branch alone is a feature-channel linear map. These mismatches weaken the spectral-mechanism and interpretability claims. 2.The paper indicates validation feedback, but the candidate-ranking, early-stopping, and final-selection procedures still need clarification. Label masking for class-conditioned path statistics and whether repetitions include independent searches also remain unclear, limiting assessment and reproducibility.
Questions for authors
1.Are Appendices F.4 and F.9 the implementations used for the main results? Please provide the corresponding runnable versions and explain how repeatedly propagating the same input yields cubic graph filtering, and how the node-wise linear map implements Fourier band-pass filtering. If these are documentation errors, do corrections change the mechanism analysis or results? 2.Which labels are visible to every graph descriptor, especially class-conditioned path lengths and adjusted homophily? How are absent classes and unreachable or empty class pairs handled with very few training labels? Please specify the splits used for candidate fitness, early stopping, and final selection, and the exact level at which repetitions are independent. 3.At matched candidate-evaluation budgets and across independent searches, does genuine spectral feedback reliably outperform shuffled spectral feedback and performance-only feedback on test results selected through validation? Does cross-task memory still help under the main sparse split and full search budget? The existing knowledge-base experiment uses a different split and a shorter search budget, so it does not directly establish this.