# Hierarchical Bipartite Graph Convolution Networks

arXiv: https://arxiv.org/abs/1812.03813 · HTML: https://mlsanity.com/paper/1812.03813/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Nov 2018.

## Built on by (most cited first, 4 of 4)

- [The Neural Process Family: Survey, Applications and Perspectives](https://mlsanity.com/paper/2209.00517/) (2022)
- [HighAir: A Hierarchical Graph Neural Network-Based Air Quality Forecasting Method](https://mlsanity.com/paper/2101.04264/) (2021)
- [Integration of Graph Neural Network and Neural-ODEs for Tumor Dynamic Prediction](https://mlsanity.com/paper/2310.00926/) (2023)
- [Optimal Solutions for Joint Beamforming and Antenna Selection: From Branch and Bound to Graph Neural Imitation Learning](https://mlsanity.com/paper/2206.05576/) (2022)

## Abstract (arXiv)

Recently, graph neural networks have been adopted in a wide variety of applications ranging from relational representations to modeling irregular data domains such as point clouds and social graphs. However, the space of graph neural network architectures remains highly fragmented impeding the development of optimized implementations similar to what is available for convolutional neural networks. In this work, we present BiGraphNet, a graph neural network architecture that generalizes many popular graph neural network models and enables new efficient operations similar to those supported by ConvNets. By explicitly separating the input and output nodes, BiGraphNet: (i) generalizes the graph convolution to support new efficient operations such as coarsened graph convolutions (similar to strided convolution in convnets), multiple input graphs convolution and graph expansions (unpooling) which can be used to implement various graph architectures such as graph autoencoders, and graph residual nets; and (ii) accelerates and scales the computations and memory requirements in hierarchical networks by performing computations only at specified output nodes.