- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces Prototype Anchored Neural Diffusion for Adaptive Hypergraphs (PANDA) for hypergraph node classification. PANDA learns a soft incidence between nodes and trainable feature space prototypes. Each layer combines two filtered representations: shallow diffusion and an observed view filter. PANDA achieves the best node classification performance in the majority of evaluation datasets.
Critical strengths
(1) The proposed method is evaluated in extensive hypergraph datasets and demonstrates the effectiveness in hypergraph node classification datasets.
(2) The mathematical formulation of each module is easy to follow.
Critical weaknesses
(1) Since the prototype is calculated on the whole node set, the proposed method is transductive. For unseen nodes, the method cannot be applied directly.
(2) The paper is evaluated on 12 datasets, while the largest dataset has 32,000 nodes. But the capability and cost (memory and inference speed) of the proposed method need to be further evaluated on huge dataset, such as OGB.
(3) The "diffusion" word looks like the spectral message passing mechanism in the previous hypegraph neural network works, instead of the image diffusion generation methods. It may be confusing to follow the core mechanism of the paper.
(4) PANDA achieves 100.0 macro-F1 on mushroom and 100.0 accuracy on zoo. And I do not find any analysis related to these results. Is it convincing?
Questions for authors
See weaknesses.
3 comments
Thank the authors for their response. Their response has addressed my concern to some extent. While the innovations in this paper are not particularly compelling to me, so I will maintain my original score.
Thank you for your guidance. The comments you and the other reviewers provided have greatly improved my paper. I will design and propose more innovative algorithms in the future.
We evaluated PANDA on unseen nodes and larger graphs, clarified diffusion, and corrected the zoo result.
Q1
Thank you for raising the unseen node setting. PANDA has no node specific trainable parameters. A new node receives prototype memberships from its features, and its observed memberships enter the hypergraph operator available at inference. We tested this by removing all test nodes and their incidences during training. Prototypes were initialized using training graph features only. The trained weights were frozen before test nodes and their memberships were introduced.
These are test accuracies over five fresh training runs. The transductive column is a paired rerun using the same implementation. Across all 12 datasets, PANDA leads the four evaluated models on seven and ranks second on four. Its inductive accuracy is within two points of its transductive accuracy on ten datasets. Inference uses the features and available observed memberships of new nodes, with no new labels. The feature branch remains defined if a new node has no observed memberships.
Q2
Thank you for requesting a larger scale evaluation. The largest benchmark in the paper is dblp_ca with 41,302 nodes. The 32,000 node figure describes the controlled CPU scaling experiment. We additionally measured a graph propagation adaptation on ogbn arxiv with 169,343 nodes, and PANDA on synthetic hypergraphs with up to one million nodes.
The arxiv experiment uses the official split and a graph adaptation. The synthetic experiments use the hypergraph operator and were timed on an otherwise idle GPU. Memory reports peak allocated tensor memory. Full batch PANDA exceeded the 11.5 GB process cap at two million nodes. Arxiv timings were collected on a shared GPU and are indicative.
Q3
Thank you for noting the possible ambiguity. Diffusion in this paper means repeated propagation by a normalized hypergraph operator, following the terminology of personalized PageRank propagation and hypergraph diffusion. It does not denote a denoising generative model. We will define the term at its first use in Section 3.2.
Q4
Thank you for asking us to examine the near perfect results. Mushroom has 2,031 test nodes. Its PANDA accuracy is 99.9%. The previously displayed 100.0% Macro F1 is a rounded value of 99.9606%. A decision tree and a nearest neighbor classifier trained only on node features also classify every mushroom test node correctly. This dataset is highly separable under the evaluated split.
The zoo dataset only has 26 test nodes. The previous run that achieved 100.0% accuracy was due to using an earlier version. The updated results are as follows.