- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a graph-learning framework that represents statistics, topology, and attributes separately, using a shared dictionary to learn explicit structural features. The framework achieves competitive predictive performance while enabling analysis of each feature block’s contribution and tracing learned structural components to their original subgraphs.
Critical strengths
-
The framework keeps graph statistics, topology, and attributes separately accessible, enabling controlled analysis of their standalone and complementary predictive contributions.
-
The learned structural representation supports tracing dictionary activations to concrete subgraphs, providing useful tools for hypothesis generation and diagnosing model behavior.
Critical weaknesses
-
The methodological novelty and the benefits of the proposed shared-dictionary representation require clearer justification. Combining structural and attribute information is well established in this domain, as are explicit subgraph representations and graph dictionary learning. Although the paper combines these ideas with occurrence-level tracing, the experiments do not sufficiently isolate what the proposed dictionary construction adds beyond existing approaches.
-
The effectiveness of topology–attribute integration and the added value of the learned topology representation require further clarification. Although the framework considers concatenation and explicit binding features, it remains unclear whether these mechanisms adequately capture interactions that could benefit from joint, task-adaptive learning. For example, on ENZYMES in Table 3, adding topology reduces performance, suggesting that the necessity of more controlled fusion. Furthermore, comparisons with alternative structural representations under the same downstream predictor—such as graphlet counts, rooted-subgraph descriptors, and persistent-homology features with clearly specified filtrations—would better establish the benefits of the learned dictionary.
-
The paper claims competitive performance against GNNs and graph transformers, but the TU benchmark comparison in Table 2(a) includes a limited selection of recent baselines. Comparisons with additional graph transformers applicable to graph classification, such as GraphGPS, SGFormer etc, would provide stronger evidence for this claim and better contextualize the proposed framework’s performance.
minor issues
-
The term “atom” in Figure 1 may be confused with a molecular atom. Labeling it “dictionary atom” or “structural dictionary component” would improve clarity and emphasize the framework’s applicability to general graphs.
-
The authors state that the implementation code will be made available during the review process, but no anonymous repository link is provided in the paper.
Questions for authors
Please refer to the weakness.
7 comments
Additional GraphGPS Comparisons on TU Benchmarks
4. Broader Graph Transformer coverage
Following the reviewer's suggestion, we have completed additional GraphGPS evaluations on five TU datasets, covering both attributed and topology-only graphs. Our reproduction uses PyG GPSConv with local GIN/GINE layers, global attention, and random-walk structural encodings.
We follow the manuscript's nested ten-fold splitting and validation/refit procedure with split seed 0. Within each outer fold, eight configurations cover hidden dimensions {64, 128}, depths {3, 5}, and learning rates {0.001, 0.003}. Each candidate is trained for 100 epochs. Configuration and training duration are selected using inner validation, followed by refitting on the outer training partition.
For reference, we include our manuscript's reported mean accuracies alongside the additional GraphGPS results.
| Dataset | GraphGPS, our reproduction (%) | Ours, manuscript (%) |
|---|---|---|
| MUTAG | 83.54 ± 7.19 | 89.20 |
| NCI1 | 78.59 ± 0.96 | 83.09 |
| PROTEINS | 74.58 ± 3.68 | 77.85 |
| IMDB-BINARY | 66.20 ± 5.65 | 73.87 |
| IMDB-MULTI | 44.87 ± 4.43 | 50.97 |
GraphGPS values are means and population standard deviations across ten outer folds for split seed 0. Our manuscript values average ten seed-level ten-fold means, except MUTAG, which uses seed 0 with ten folds. The columns therefore differ in the number of split repetitions; our manuscript means are included to contextualize the new baseline results.
These completed experiments broaden the Graph Transformer comparison across both benchmark groups. We will complete the comparison on the remaining TU datasets used in the manuscript—D&D, ENZYMES, COLLAB, and REDDIT-BINARY—and include the complete results and reproduction configurations in the revised manuscript.
5. Terminology and anonymous implementation
We will replace "atom" in Figure 1 with "dictionary atom" to distinguish learned dictionary components from molecular atoms and clarify their applicability to general graphs.
We are organizing the code and supplementary experiments and will release an anonymized repository within the next few days.
Follow-up on Topology–Attribute Fusion and GraphGPS
Thank you again for your suggestions on fusion and the TU comparisons. Our response on fusion clarifies what the ENZYMES audit shows under our protocol and where the current fusion mechanism could be extended. We also posted completed GraphGPS comparisons on five TU datasets, alongside our manuscript results. If there is a specific concern about the fusion mechanism or the benchmark comparison that remains open, we would be happy to clarify it.
Topology–Attribute Fusion and New Explicit-Feature Comparisons
We thank the reviewer for recognizing the information-source audits and structural tracing. We clarify the fusion mechanisms and report new controls.
1. Contribution of the shared-dictionary framework
Our contribution develops sparse network decomposition into a general-purpose, explicit graph representation framework. Rooted observations are encoded in shared, learnable coordinates, aggregated through invariant readouts, and integrated with attributes. Links to activating patch occurrences enable information-source auditing, structural tracing, and targeted interventions.
Building on existing sparse decomposition, the dictionary provides a finite, data-dependent vocabulary for expressing local observations through combinations of shared components. K-SVD implements dictionary learning; the controls below assess the construction's predictive utility.
2. Topology–attribute fusion and the ENZYMES results
Separate accessibility is compatible with topology–attribute interactions. Our framework supports both concatenation and explicit binding. Concatenation supplies independently constructed blocks to a nonlinear downstream predictor. Binding additionally associates dictionary activations with attributes of their corresponding roots, structural shells, or local contexts, preserving information about which semantic features accompany a structural component.
In the manuscript's NCI1 audit, adding binding to STA improves accuracy by 4.13 percentage points.
ENZYMES exhibits a different regime. Under our audit protocol, A, SA, and STA achieve 68.07%, 69.73%, and 64.12%, respectively. Attributes are strongly predictive, while the evaluated topology block provides limited complementary utility once statistics and attributes are available. This is consistent with Errica et al. [1], who found that none of their evaluated GNNs exceeded a structure-agnostic baseline on ENZYMES, PROTEINS, or D&D, whereas NCI1 benefited from graph-aware models. Our independent blocks further quantify standalone and conditional utility within a common representation protocol.
We also agree that task-adaptive integration deserves further investigation. Our current implementation uses concatenation and predefined binding operators while learning the dictionary independently of the downstream objective. This leaves room for richer interactions between topology and semantics. Jointly learning structural coordinates and their attribute-conditioned interactions is an important future direction, while preserving the separate accessibility and occurrence-level traceability that enable the audits.
The present experiments do not determine how much additional structural utility such joint optimization could recover on ENZYMES. We will clarify this boundary alongside the observed attribute-dominated regime.
3. Added graphlet, persistent-homology, and direct-patch controls
We evaluated graphlet counts, persistent-homology features, and direct rooted-patch descriptors that bypass dictionary reconstruction on NCI1, MolHIV, and Peptides-func.
The graphlet baseline contains exact counts and within-order frequencies of all connected induced unlabeled graphlets with three to five vertices. The persistent-homology baseline uses lower- and upper-star filtrations of node degree and local clustering coefficient on the graph as a one-dimensional simplicial complex, with triangles unfilled. We vectorize finite H0 birth–death pairs and essential H0/H1 births using fixed histograms.
All rows below append the same dataset-specific statistics and attribute summaries and use the same splits and downstream XGBoost evaluation protocol.
NCI1 uses split seed 0 with ten outer folds and equal eight-candidate validation searches. MolHIV uses the official scaffold split and classifier seeds 0–9. Peptides-func uses the official split and classifier seed 0. The latter two use shared fixed predictor settings.
The direct and reconstructed patch controls additionally share identical patch inputs, descriptor rules, pooling operations, and dimensions. Reconstruction improves test performance by 1.19, 2.91, and 0.66 percentage points, respectively. The graphlet and persistent-homology comparisons establish advantages over these specified alternative representations under the evaluated protocols. These comparisons use the descriptor-matched configuration, distinct from the full configurations with additional binding features.
[1] Errica et al., ICLR 2020. https://arxiv.org/abs/1912.09893