MathNet: Haar-Like Wavelet Multiresolution-Analysis for Graph Representation and Learning
Abstract
Graph Neural Networks (GNNs) have recently caught great attention and achieved significant progress in graph-level applications. In this paper, we propose a framework for graph neural networks with multiresolution Haar-like wavelets, or MathNet, with interrelated convolution and pooling strategies. The underlying method takes graphs in different structures as input and assembles consistent graph representations for readout layers, which then accomplishes label prediction. To achieve this, the multiresolution graph representations are first constructed and fed into graph convolutional layers for processing. The hierarchical graph pooling layers are then involved to downsample graph resolution while simultaneously remove redundancy within graph signals. The whole workflow could be formed with a multi-level graph analysis, which not only helps embed the intrinsic topological information of each graph into the GNN, but also supports fast computation of forward and adjoint graph transforms. We show by extensive experiments that the proposed framework obtains notable accuracy gains on graph classification and regression tasks with performance stability. The proposed MathNet outperforms various existing GNN models, especially on big data sets.
Benchmark Results
Tested on 3 datasets 3 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
TU Dortmund
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9910
±0.0030 | |
| 2 | ID-GNN+BEC | 0.9830
±0.0360 | |
| 3 | SupCosine | 0.9830
±0.0250 | |
| 39 | GIN | 0.9330
±0.0290 best reported | best at pub: Provably Powerful Graph Networks (NeurIPS 2019) best today: ProtGNN: Towards Self-Explaining Graph Neural Networks (AAAI 2021) Difference within reported uncertainty; not counted as underperformance. |
| 54 | PatchySan | 0.9260
±0.0420 best reported | best at pub: How Powerful are Graph Neural Networks? (ICLR 2018) best today: Simplifying Graph Convolutional Networks with Redundancy-Free Neighbors (2025) Difference within reported uncertainty; not counted as underperformance. |
| 63 | GCN | 0.9220
±0.0440 | |
| 159 | WL | 0.9040
±0.0570 best reported | best at pub: Understanding Isomorphism Bias in Graph Data Sets (2019) best today: How Powerful are $K$-hop Message Passing Graph Neural Networks (NeurIPS 2022) |
| 225 | MathNet | 0.8960
±0.0249 | This paper |
| 403 | MLP | 0.8660
±0.0495 | |
| 425 | DGCNN | 0.8583 | This paper |
| 426 | SP | 0.8580
±0.0020 best reported | best at pub: Propagation Kernels (2014) Difference within reported uncertainty; not counted as underperformance. |
| 501 | RW | 0.8370
±0.0150 best reported | best at pub: Learning Convolutional Neural Networks for Graphs (ICML 2016) best today: Learning Graph Representation by Aggregating Subgraphs via Mutual Information Maximization (2021) Difference within reported uncertainty; not counted as underperformance. |
| 550 | Graphlet | 0.8244
±0.0129 best reported | best at pub: The Multiscale Laplacian Graph Kernel (NeurIPS 2016) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GMN | 0.7866 | |
| 2 | MemGNN | 0.7550 | |
| 3 | TFGW SP | 0.7510
±0.0500 | |
| 17 | GatedGCN | 0.7000
±0.0494 | |
| 18 | WL | 0.6950
±0.0320 best reported | best at pub: Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs (2017) best today: Template based Graph Neural Network with Optimal Transport Distances (NeurIPS 2022) |
| 26 | GraphSAGE | 0.6817
±0.0545 | |
| 49 | EigenPool | 0.6500 | This paper |
| 70 | DiffPool | 0.6253 | prev best: Memory-Based Graph Networks (ICLR 2020) |
| 71 | MathNet | 0.6250
±0.0385 | This paper |
| 119 | DGCNN | 0.5712 | prev best: Graph Convolutional Networks with EigenPooling (KDD 2019) |
| 124 | MLP | 0.5583
±0.0352 | |
| 128 | Graphlet | 0.5530
±0.0378 best reported | best at pub: Memory-Based Graph Networks (ICLR 2020) best today: Contrastive Graph Few-Shot Learning (2022) |
| 179 | SP | 0.4260
±0.0160 best reported | best at pub: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GC-GNN (GCN) | 0.9210
±0.0810 | |
| 2 | SUGAR | 0.8403
±0.0133 | |
| 3 | Ortho-g-U-Nets | 0.8387 | |
| 4 | g-U-Nets | 0.8300 best reported | best at pub: Graph U-Nets (2019) best today: Orthogonal Graph Neural Networks (AAAI 2021) |
| 6 | MathNet | 0.8250
±0.0359 | This paper |
| 15 | SAGE | 0.8088
±0.0233 | |
| 18 | DiffPool | 0.8064 | This paper |
| 25 | WL | 0.7978
±0.0036 best reported | best at pub: Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs (2017) best today: Graph Learning with Distributional Edge Layouts (2024) |
| 37 | DGCNN | 0.7937 | This paper |
| 56 | SAGPool | 0.7870
±0.0229 best reported | best today: Contrastive Self-supervised Learning for Graph Classification (AAAI 2020) Difference within reported uncertainty; not counted as underperformance. |
| 57 | EigenPool | 0.7863
±0.0136 best reported | best today: Contrastive Self-supervised Learning for Graph Classification (AAAI 2020) Difference within reported uncertainty; not counted as underperformance. |
| 62 | Graphlet | 0.7845 | This paper |
| 114 | PatchySan | 0.7627 | This paper |
