ATLAS: Adaptive Topology-based Learning at Scale for Homophilic and Heterophilic Graphs

• URL: http://arxiv.org/abs/2512.14908v1
• Date: Tue, 16 Dec 2025 20:43:49 GMT
• Title: ATLAS: Adaptive Topology-based Learning at Scale for Homophilic and Heterophilic Graphs
• Authors: Turja Kundu, Sanjukta Bhowmick,
• Abstract summary: ATLAS (Adaptive Topology-based Learning at Scale for Homophilic and Heterophilic Graphs)<n>We present a novel graph learning algorithm that addresses two important challenges in graph neural networks (GNNs)<n>The accuracy of GNNs degrades when the graph is heterophilic.<n>We show how multi-resolution community features systematically modulate performance in both homophilic and heterophilic settings.
• Score: 0.5156484100374058
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present ATLAS (Adaptive Topology-based Learning at Scale for Homophilic and Heterophilic Graphs), a novel graph learning algorithm that addresses two important challenges in graph neural networks (GNNs). First, the accuracy of GNNs degrades when the graph is heterophilic. Second, iterative feature aggregation limits the scalability of GNNs to large graphs. We address these challenges by extracting topological information about graph communities at multiple levels of refinement, concatenating community assignments to the feature vector, and applying multilayer perceptrons (MLPs) to the resulting representation. This provides topological context about nodes and their neighborhoods without invoking aggregation. Because MLPs are typically more scalable than GNNs, our approach applies to large graphs without the need for sampling. Across a wide set of graphs, ATLAS achieves comparable accuracy to baseline methods, with gains as high as 20 percentage points over GCN for heterophilic graphs with negative structural bias and 11 percentage points over MLP for homophilic graphs. Furthermore, we show how multi-resolution community features systematically modulate performance in both homophilic and heterophilic settings, opening a principled path toward explainable graph learning.

Related papers

• 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)
• Graph Homophily Booster: Rethinking the Role of Discrete Features on Heterophilic Graphs [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  (2025-09-16T00:10:20Z)
• It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph [19.222317334613162]
  Graph Neural Networks (GNNs) excel at analyzing graph-structured data but struggle on heterophilic graphs, where connected nodes often belong to different classes.<n>We provide theoretical foundations linking edge homophily, GNN embedding smoothness, and node classification performance.<n>We introduce a rewiring framework that increases graph homophily using a reference graph, with theoretical guarantees on the homophily of the rewired graph.
  arXiv  Detail & Related papers  (2025-05-18T13:28:56Z)
• GRAIN: Multi-Granular and Implicit Information Aggregation Graph Neural Network for Heterophilous Graphs [11.458759345322832]
  Granular and Implicit Graph Network (GRAIN) is a novel GNN model specifically designed for heterophilous graphs.<n>GRAIN enhances node embeddings by aggregating multi-view information at various levels and incorporating implicit data from distant, non-neighboring nodes.<n>We also introduce an adaptive graph information aggregator that efficiently combines multi-granularity and implicit data, significantly improving node representation quality.
  arXiv  Detail & Related papers  (2025-04-09T07:36:44Z)
• 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)
• Quantifying the Optimization and Generalization Advantages of Graph Neural Networks Over Multilayer Perceptrons [50.33260238739837]
  Graph networks (GNNs) have demonstrated remarkable capabilities in learning from graph-structured data.<n>There remains a lack of analysis comparing GNNs and generalizations from an optimization and generalization perspective.
  arXiv  Detail & Related papers  (2023-06-24T10:21:11Z)
• Beyond Homophily: Reconstructing Structure for Graph-agnostic Clustering [15.764819403555512]
  It is impossible to first identify a graph as homophilic or heterophilic before a suitable GNN model can be found. We propose a novel graph clustering method, which contains three key components: graph reconstruction, a mixed filter, and dual graph clustering network. Our method dominates others on heterophilic graphs.
  arXiv  Detail & Related papers  (2023-05-03T01:49:01Z)
• Relation Embedding based Graph Neural Networks for Handling Heterogeneous Graph [58.99478502486377]
  We propose a simple yet efficient framework to make the homogeneous GNNs have adequate ability to handle heterogeneous graphs. Specifically, we propose Relation Embedding based Graph Neural Networks (RE-GNNs), which employ only one parameter per relation to embed the importance of edge type relations and self-loop connections.
  arXiv  Detail & Related papers  (2022-09-23T05:24:18Z)
• Graph Neural Networks for Graphs with Heterophily: A Survey [98.45621222357397]
  We provide a comprehensive review of graph neural networks (GNNs) for heterophilic graphs. Specifically, we propose a systematic taxonomy that essentially governs existing heterophilic GNN models. We discuss the correlation between graph heterophily and various graph research domains, aiming to facilitate the development of more effective GNNs.
  arXiv  Detail & Related papers  (2022-02-14T23:07:47Z)
• Beyond Low-Pass Filters: Adaptive Feature Propagation on Graphs [6.018995094882323]
  Graph neural networks (GNNs) have been extensively studied for prediction tasks on graphs. Most GNNs assume local homophily, i.e., strong similarities in localneighborhoods. We propose a flexible GNN model, which is capable of handling any graphs without beingrestricted by their underlying homophily.
  arXiv  Detail & Related papers  (2021-03-26T00:35:36Z)

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.