← ICLR 2024 leaderboard

RayE-Sub: Countering Subgraph Degradation via Perfect Reconstruction

Kuo Yang, Zhengyang Zhou, Xu Wang, Pengkun Wang, Limin Li, Yang Wang

general MLGraph Nerual NetworkSubgraph LearningReconstruction abilityExpressive power
58.90100
Fused
band ≈ ±15 pct pts (from σ = 0.30)
59.10100
Mimo
band ≈ ±21 pct pts (from σ = 0.42)
64.90100
DeepSeek
band ≈ ±21 pct pts (from σ = 0.41)

OpenReview ground truth

Rejected

Abstract

Subgraph learning has dominated most practices of improving the expressive power of Message passing neural networks (MPNNs). Existing subgraph discovery policies can be classified into node-based and partition-based, which both achieve impressive performance in most scenarios. Unfortunately, we observe that there exists a subgraph degradation trap in these two mainstream solutions. This means extracted subgraphs fail to achieve better expression. In this work, we start with an intuitive observation and theoretical analysis to explore subgraph degeneration. We then summarize the limitations of these two subgraph strategies from the perspective of reconstruction ability. To this end, we propose perfect reconstruction principle to realize high-quality subgraph extraction. To achieve this, two affiliated questions should be well-addressed. \emph{(i) how to ensure the subgraphs possessing with 'perfect' information? (ii) how to guarantee the 'reconstruction' power of obtained subgraphs?} Firstly, we propose a subgraph partition strategy \emph{Rayleigh-resistance} to extract non-overlap subgraphs by leveraging the graph spectral theory. Secondly, we put forward the Query mechanism to achieve subgraph-level equivariant learning, which guarantees subgraph reconstruction ability. These two parts, \emph{perfect subgraph partition} and \emph{equivariant subgraph learning} are seamlessly unified as a novel \emph{\underline{Ray}leigh-resistance \underline{E}quivariant \underline{Sub}graph learning} architecture (\emph{\textbf{RayE-Sub}}). A series of experiments on both synthetic and real datasets demonstrate that our approach can consistently outperform previous MPNNs architectures.

Author context

Most prolific author: 7 submissions (credibility 1.00).

No mass-submission penalty for this paper (authors within normal submission volume).

Aggregate statistics only — no individual author rankings.

Ranking trajectory

Percentile by tournament round — convergence indicates rating stability.

Judge assessments

Mean overall score 0.0 ± 0.0 (n = 32)