Robust Learning on Heterogeneous Graphs with Heterophily: A Graph Structure Learning Approach

• URL: http://arxiv.org/abs/2604.27387v1
• Date: Thu, 30 Apr 2026 03:55:54 GMT
• Title: Robust Learning on Heterogeneous Graphs with Heterophily: A Graph Structure Learning Approach
• Abstract summary: Heterogeneous graphs with heterophily have emerged as a powerful abstraction for modeling complex real-world systems.<n>We propose a unified framework, Heterogeneous Graph Unified Learning (HGUL), which jointly handles heterophily and noisy graph structures.<n>Extensive experiments on multiple datasets demonstrate that HGUL consistently outperforms existing methods on clean graphs and maintains strong robustness under varying levels of structural noise.
• Score: 10.65673380743972
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Heterogeneous graphs with heterophily have emerged as a powerful abstraction for modeling complex real-world systems, where nodes of different types and labels interact in diverse and often non-homophilous ways. Despite recent advances, robust representation learning for such graphs remains largely unexplored, particularly in the presence of noisy or misleading connectivity. In this work, we investigate this problem and identify structural noise as a critical challenge that significantly degrades model performance. To address this issue, we propose a unified framework, Heterogeneous Graph Unified Learning (HGUL), which jointly handles heterophily and noisy graph structures. The framework consists of three complementary modules: a kNN-based graph construction module that recovers reliable local neighborhoods, a graph structure learning module that adaptively refines the adjacency by filtering noisy edges, and a heterogeneous affinity learning module that captures class-level relationships via an extended affinity matrix derived from a polynomial graph kernel. Extensive experiments on multiple datasets demonstrate that HGUL consistently outperforms existing methods on clean graphs and maintains strong robustness under varying levels of structural noise. The results further underscore the importance of jointly modeling heterophily and noise in heterogeneous graph learning.

Related papers

• Bridge the Gaps: Heterogeneous Attributed Graph Clustering via Quaternion Representation Learning [14.02813695997424]
  Attributed graph clustering partitions nodes by jointly exploiting node attributes and graph topology.<n>End-to-end framework, Any-type attributed Graph REpresentation lEarning (AGREE) is proposed.<n>It unifies attributed graphs and any-type attributed data through multi-level alignment and similarity-based graph construction.
  arXiv  Detail & Related papers  (2026-06-22T11:46:07Z)
• Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learning [50.99881402425112]
  Graph neural networks (GNNs) have emerged as a powerful tool for modeling graph-structured data.<n>Existing GNNs often struggle with heterophilic graphs, where connected nodes tend to have dissimilar features or labels.<n>We present a new and unexplored paradigm: directly increasing the graph homophily via a carefully designed graph transformation.
  arXiv  Detail & Related papers  (2026-02-06T23:14:10Z)
• Task-driven Heterophilic Graph Structure Learning [30.767828037086844]
  Graph neural networks (GNNs) often struggle to learn discriminative node representations for heterophilic graphs.<n>We propose frequency-guided graph structure learning (FgGSL), an end-to-end graph inference framework.
  arXiv  Detail & Related papers  (2025-12-29T11:59:16Z)
• The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges [101.83124435649358]
  Homophily principle, ie nodes with the same labels or similar attributes are more likely to be connected. Recent work has identified a non-trivial set of datasets where GNN's performance compared to the NN's is not satisfactory.
  arXiv  Detail & Related papers  (2024-07-12T18:04:32Z)
• HiGPT: Heterogeneous Graph Language Model [27.390123898556805]
  Heterogeneous graph learning aims to capture complex relationships and diverse semantics among entities in a heterogeneous graph. Existing frameworks for heterogeneous graph learning have limitations in generalizing across diverse heterogeneous graph datasets. We propose HiGPT, a general large graph model with Heterogeneous graph instruction-tuning paradigm.
  arXiv  Detail & Related papers  (2024-02-25T08:07:22Z)
• GraphEdit: Large Language Models for Graph Structure Learning [14.16155596597421]
  Graph Structure Learning (GSL) focuses on capturing intrinsic dependencies and interactions among nodes in graph-structured data.<n>Existing GSL methods heavily depend on explicit graph structural information as supervision signals.<n>We propose GraphEdit, an approach that leverages large language models (LLMs) to learn complex node relationships in graph-structured data.
  arXiv  Detail & Related papers  (2024-02-23T08:29:42Z)
• Towards Robust Graph Structural Learning Beyond Homophily via Preserving Neighbor Similarity [26.990618075974485]
  We explore the vulnerability of graph-based learning systems regardless of the homophily degree.<n>We propose a novel graph structural learning strategy that serves as a useful graph mining module.
  arXiv  Detail & Related papers  (2024-01-18T06:57:29Z)
• Geometry Contrastive Learning on Heterogeneous Graphs [50.58523799455101]
  This paper proposes a novel self-supervised learning method, termed as Geometry Contrastive Learning (GCL) GCL views a heterogeneous graph from Euclidean and hyperbolic perspective simultaneously, aiming to make a strong merger of the ability of modeling rich semantics and complex structures. Extensive experiments on four benchmarks data sets show that the proposed approach outperforms the strong baselines.
  arXiv  Detail & Related papers  (2022-06-25T03:54:53Z)
• Heterogeneous Graph Neural Networks using Self-supervised Reciprocally Contrastive Learning [102.9138736545956]
  Heterogeneous graph neural network (HGNN) is a very popular technique for the modeling and analysis of heterogeneous graphs. We develop for the first time a novel and robust heterogeneous graph contrastive learning approach, namely HGCL, which introduces two views on respective guidance of node attributes and graph topologies. In this new approach, we adopt distinct but most suitable attribute and topology fusion mechanisms in the two views, which are conducive to mining relevant information in attributes and topologies separately.
  arXiv  Detail & Related papers  (2022-04-30T12:57:02Z)
• Structural Landmarking and Interaction Modelling: on Resolution Dilemmas in Graph Classification [50.83222170524406]
  We study the intrinsic difficulty in graph classification under the unified concept of resolution dilemmas'' We propose SLIM'', an inductive neural network model for Structural Landmarking and Interaction Modelling.
  arXiv  Detail & Related papers  (2020-06-29T01:01:42Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.