COMBA: Cross Batch Aggregation for Learning Large Graphs with Context Gating State Space Models
Not on the map. Why?
Abstract (arXiv)
State space models (SSMs) have recently emerged for modeling long-range dependency in sequence data, with much simplified computational costs than modern alternatives, such as transformers. Advancing SMMs to graph structured data, especially for large graphs, is a significant challenge because SSMs are sequence models and the shear graph volumes make it very expensive to convert graphs as sequences for effective learning. In this paper, we propose COMBA to tackle large graph learning using state space models, with two key innovations: graph context gating and cross batch aggregation. Graph context refers to different hops of neighborhood for each node, and graph context gating allows COMBA to use such context to learn best control of neighbor aggregation. For each graph context, COMBA samples nodes as batches, and train a graph neural network (GNN), with information being aggregated cross batches, allowing COMBA to scale to large graphs. Our theoretical study asserts that cross-batch aggregation guarantees lower error than training GNN without aggregation. Experiments on benchmark networks demonstrate significant performance gains compared to baseline approaches. Code and benchmark datasets will be released for public access.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 23 references that are in the map. First posted on arXiv 19 Feb 2026.
Builds on
22 of 23 references.
References · 22
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2019Graph Neural Networks for Social Recommendationcited by 711
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
10 more
- 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 540
- 2019Graph Transformer Networkscited by 520
- 2017Residual Gated Graph ConvNetscited by 341
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
- 2021Do Transformers Really Perform Bad for Graph Representation?cited by 318
- 2022Long Range Graph Benchmarkcited by 258
- 2022Pure Transformers are Powerful Graph Learnerscited by 188
- 2022NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphscited by 137
- 2024Graph Mamba: Towards Learning on Graphs with State Space Modelscited by 84
- 2025Efficient GNN Training Through Structure-Aware Randomized Mini-Batchingcited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024What Can We Learn from State Space Models for Machine Learning on Graphs?
- 2025Message-Passing State-Space Models: Improving Graph Learning with Modern Sequence Modeling
- 2025GRAMA: Adaptive Graph Autoregressive Moving Average Models
- 2024Graph-Mamba: Towards Long-Range Graph Sequence Modeling with Selective State Spaces
- 2026FaST: Efficient and Effective Long-Horizon Forecasting for Large-Scale Spatial-Temporal Graphs via Mixture-of-Experts
- 2024State Space Models on Temporal Graphs: A First-Principles Study
- 2025State Space Models over Directed Graphs
- 2024GraphEdit: Large Language Models for Graph Structure Learning