This work presents a constrained two-view learning framework for robust graph learning, which aligns structure-aware GNN embeddings with a structure-free feature prior and designs a channel-split adaptive gated layer within DSAL to effectively integrate this prior.
Abstract
Conventional Graph Neural Networks (GNNs) couple feature transformation and neighborhood aggregation, which often renders them vulnerable to topological noise and heterophilous connections. To decouple this dependency, we present a constrained two-view learning framework for robust graph learning, which aligns structure-aware GNN embeddings with a structure-free feature prior. Specifically, the proposed Decoupled Structure-Feature Alternating Learning (DSAL) framework trains an independent anchor network using a self-supervised reconstruction objective to capture the intrinsic semantic information contained in node attributes. Within DSAL, to effectively integrate this prior, we design a channel-split adaptive gated (CSAG) layer. This architecture employs a gating mechanism to balance global spectral smoothing and local spatial representation dynamically. Furthermore, the model is optimized via a cyclic alternating procedure, which mitigates representation drift caused by mutual interference in standard joint optimization schemes. Experiments on diverse homophilous and heterophilous datasets suggest that our proposed approach provides improved node classification accuracy while maintaining robustness to structural perturbations compared to standard message-passing architectures.
D2GSL constructs a semantic similarity channel and a spectral feature channel to model node relationships from both local semantic and global spectral views and introduces a hyperadjacency matrix that explicitly models inter-layer node correspondences and enables joint structural reconstruction across channels.
Jun-Chen Zhang, Xuhao Wei, Xiaolei Gu et al.· Computer Modeling in Enginee...· 0 citations
Experiments show that incorporating NC-LID-based regularization consistently improves reconstruction performance over the baseline without structural regularization and the method using hub-aware regularization, which highlights NC-LID as a useful structural signal for enhancing distance-based graph autoencoders in dyn...
Aleksandar Tomčić, Milos Savic, Milos Radovanovic· 0 citations
This work shows that informative embeddings can be derived without complicated model design and gradient-based training, and suggests that informative graph embeddings can arise from carefully chosen topological transformations before any learning operation is applied.
Meng Qin, Jin-Qiang Cui, Hong-Wei Zheng et al.· 0 citations
The Dual-tOpology learning with adapTive Anchors (DOTA) is proposed, which not only learns the sample-anchor relationship but also preserves the topology structure among anchors, significantly enhancing the discriminability of learned representation while preserving the underlying data manifold.
Cheng-Long Zhang, Chao Zhang, Jun-Hao Zhang et al.· Proceedings of the Thirty-Fi...· 0 citations
Graph Neural Networks (GNNs) have achieved strong performance in node classification, yet their performance often drops when facing graph distribution shifts between training and testing nodes. Existing methods have been explored to improve generalization under such shifts. However, many of them either rely on environm...
Jia-Xing Li, Jia-Shuo Liu, Wei-Huang Zheng et al.· IEEE Transactions on Pattern...· 0 citations
An adaptive geometric hypergraph encoder that projects entities into a product manifold and design a topology-aware gating mechanism to dynamically select optimal geometric spaces for each entity, and a role-aware Transformer equipped with role-specific projections and micro-structural bias injection to refine embeddin...
Ke-Jia Chen, Yu-Zhe Hu, Yu Ni et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.