- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Inspired by the concepts in Graph Learning and Computational Argumentation, this paper proposes an explainable graph learning model, QBAF, which treats the Node Classification task as an Agreement Classification task. The interpretability comes from transforming the implicit node communication in traditional methods into an explicit process of debate. It starts with node features generating arguments with evidence on each class. These arguments interact within nodes and across edges through learned support, neutral, and attack roles, collectively contributing to the update of the class scores. The paper evaluates predictive performance on small scales Node Classification datasets, shows how recorded computations reconstruct predictions, and provides theoretical analysis of the proposed framework.
Critical strengths
1.The idea bridging the two fields is good though I am not familiar with Computational Argumentation. 2.Theoretical Analysis of the proposed framework is thorough. The scores reconstruction, role intervention examination, and bound analysis seems solid. 3.The empirical results look promising. Best in 6 out of 9 datasets competing with 16 recent baselines.
Critical weaknesses
1.It seems that many baseline results were reused from existing/original papers, for example the Specformer. Reusing published baseline results is acceptable only if their sources are clear and comparability is fair. So it is justifiable to ask: Which results were rerun and which were reused? What are the sources of the resued numbers? Are data splits, preprocessing, and tuning procedures comparable? What each reported uncertainty measure represents? 2.QBAF can be quite expensive to scale. Although Appendix A.6 provides complexity analysis and Section 5.4 reports some timings, the overhead on larger graphs remains unclear. For example, one of the largest citation network ogbn-papers100M has 111,059,956 nodes and 172 classes. Assuming 64 arguments per class and FP32 precision, it results in 4.89TB memory for one full state tensor. It is inappropriate for me to demand such large-scale datasets, perhaps a small-scale dataset like ogbn-arxiv is a more reasonable request. How expensive is QBAF in practice? Could you measure peak memory and training/inference time alongside accuracy? 3.The “Support, Neutral, and Attack” framing sounds intuitive. My concern is: an interaction with (0.45S, 0.10N, 0.45A) gives quite different role assignments compared to (0.05S, 0.9N, 0.05A), yet both contribute zero according to Eq.5. Indeed, the roles are mathematically well-defined, but it seems that understanding their effect still requires us to look at the signed message and the later updates. Could you extend the existing cases to show what the role probabilities reveal beyond the net signed coefficient and payload? 4.It seems that the classes share features and some parameters and are trained together but they do not directly use each other’s evolving arguments/scores during reasoning. I understand that this can make interventions much easier but wouldn’t it limit how the model uses relationships between competing classes during reasoning? If this is a design trade-off then its impact needs to be tested.
Questions for authors
An interesting idea still needs developed motivation. How QBAF lets us understand or do beyond existing signed propagation and intrinsic explanation methods?
Source-Tracked Baselines, Measured Scalability, Role-Sensitive Edits, and Cross-Class Reasoning
1. Reproducible baselines and matched comparisons (Critical Weakness 1). Tables 9–10 trace all 144 published-baseline cells and their uncertainty conventions, including Specformer from GrokFormer (ten-run SD) and PolyFormer (Questions: 95% interval). Table 1 separately identifies our ten QBAF fits. We additionally reran QBAF and Specformer on all nine graphs with matched features, node order, adjacency and splits, retaining model-specific normalization. Validation-only tuning searched 24 configurations on Photo/Actor and six elsewhere. Seven paired intervals favor QBAF in Table 11, including Photo +1.361 accuracy points [1.125, 1.598] and Questions +3.720 ROC-AUC points [2.675, 4.765]. Five designated-comparator gains survive ten-split sign-flip tests and Holm correction (Table 12).
2. White-box scalability and measured cost (Critical Weakness 2). We extended QBAF to ogbn-arxiv's official temporal split (169,343 nodes; 40 classes). Ten-layer QBAF achieves 71.53±0.31 test accuracy across five initializations, exceeding GPR-GNN's 68.80% by 2.73 accuracy points (Tables 4, 32). White-box computation tracks 64 class-specific argument slots, support/neutral/attack roles and layerwise score revisions, enabling trace replay and targeted edits. This explicit computation adds per-pass cost: on RTX 5090 D, a full-graph update takes 2.150 s, inference 0.608 s, and peak allocated training memory is 23.840 GiB (Table 33). Class blocking, sparse propagation and activation recomputation preserve reference predictions at all five checkpoints, establishing the large-graph accuracy and cost of traceable argumentation.
3. Information beyond the net signed message (Critical Weakness 3). The reviewer's two triples (.45,.10,.45) and (.05,.90,.05) both give ν=2(pS−pA)=0. Equal and opposite support/attack-logit changes give sensitivity κ=2[pS+pA−(pS−pA)2], equal to 1.8 and 0.2 for the two triples. On Photo edge 1160→13 (layer 2, head 0, class 1), both replacements yield the same starting raw margin 7.487156; a +0.1 tilt changes the fully recomputed margin by +0.022266 versus +0.002510 (Figure 1; Table 28). Four controlled cases confirm larger high-sensitivity responses in both directions (Table 27). Channel selection also uses downstream influence Je=∂M/∂νe. On 100 Photo targets, ranking up to three channels by ∣Jeκe∣ yields larger recomputed margin changes than ranking by ∣Je∣ or ∣Jeνe∣ for both edit directions at both checkpoints (Table 26). Thus, roles predict intervention responses beyond the signed message.
4. Why class-separable updates matter (Critical Weakness 4). We compared the original class-separable model with a same-class capacity control, per-layer cross-class mixing and final-layer mixing (Tables 29–31). Per-layer mixing reads competing arguments and claims. On Actor, the original model attains 28.75 macro-F1 and exceeds per-layer mixing by 1.372 points [0.278, 2.465]; the extension increases update time by 16.11% and inference time by 46.30%. On WikiCS, per-layer mixing improves macro-F1 over final-layer mixing by 0.253 points [0.058, 0.447]. The class-separable program preserves other classes' raw scores under a single-class edit, while the shared softmax still connects their output probabilities. A controlled edit produces a maximum competing raw-score shift of 1.49×10−8 in the base versus 1.69×10−4 under per-layer mixing. This quantifies the predictive and intervention effects of class coupling.
5. What QBAF enables beyond signed propagation (Question for Authors). QBAF exposes feature-grounded arguments, role assignments and class-score revisions for exact replay and targeted edits, distinguishing equal-message relations by their intervention effects. In a matched direct-signed control holding arguments, local composition, claim feedback, readout and weighting fixed, three roles improve Cora accuracy by +1.478 points [0.879, 2.077] under EM and Actor macro-F1 by +1.959 points [0.726, 3.192] under unit weights (Table 16). The explanation study covers 600 targets, with 575 permitting non-self edits. On 100 Actor targets and the same fixed QBAF predictor, native evidence selection improves deletion and masking gap AUC over GNNExplainer by +0.005152 and +0.005647, and retention gap by -0.006265 [-0.009749, -0.003277] (Tables 19–20). Across complete Actor predictors, all 12 pointwise deletion/masking intervals favor QBAF over direct-signed, FAGCN and SES at two checkpoints (Table 21). These results establish white-box prediction, executable edits and measured explanation utility in one model.