Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

127254381508 · Jun 202019922001200920172026
48 results for graph convolutional layers

GCNs improve multi-layer network classification by expanding the distance between means.

problem Improving multi-layer network classification with graphical information.
method Theoretical and empirical study of graph convolutions in multi-layer networks.
result Graph convolutions expand the classification regime by a factor of 1/Emdeg41/\sqrt[4]{\mathbb{E}{ m deg}}.

This paper proposes a new Quantum Spatial Graph Convolutional Neural Network (QSGCNN) model that can directly learn a classification function for graphs of arbitrary sizes. Unlike state-of-the-art Graph Convolutional Neural Network (GCNN) models, the proposed QSGCNN model incorporates the process of identifying transit…

2018-09-04abs ↗pdf ↗

Popular graph neural networks implement convolution operations on graphs based on polynomial spectral filters. In this paper, we propose a novel graph convolutional layer inspired by the auto-regressive moving average (ARMA) filter that, compared to polynomial ones, provides a more flexible frequency response, is more …

2019-01-05abs ↗pdf ↗

Automates graph convolutional network design for semi-supervised node classification.

problem Designing optimal graph convolutional network architectures for semi-supervised node classification.
method An automatic process to define a problem-specific architecture based on graph structure.
result The proposed method outperforms existing methods in classification performance and network compactness.

AEGCN uses autoencoder constraints to improve graph node classification.

problem Node classification on graph domains with reduced information loss.
method Autoencoder-constrained graph convolutional network (AEGCN).
result Adding autoencoder constraints significantly improves graph convolutional network performance.

GCN and GPCA are mathematically connected, leading to improved node classification performance.

problem Improving node classification performance in semi-supervised settings.
method Established a mathematical connection between GCN and GPCA, demonstrating their equivalence and using this to design an effective initialization strategy.
result GPCA paired with a simple MLP achieves similar or better performance than GCN on semi-supervised node classification tasks.

A new linear GCN model improves recommendation performance for large graphs.

problem Training difficulties and over-smoothing in GCN-based CF models.
method Proposes a linear residual graph convolutional network (LRGCCF) to address training difficulties and over-smoothing issues.
result The proposed model yields better efficiency and effectiveness on real datasets.

The study estimates the expressiveness of GCNs with bounds on the number of linear regions.

problem Characterizing the expressiveness of graph convolutional networks (GCNs).
method Estimates the number of linear regions for one-layer and multi-layer GCNs.
result GCNs with multiple layers have exponentially more expressivity per parameter than one-layer GCNs.

Graph transformers outperform graph convolutions by preserving community information.

problem Understanding why graph transformers perform well in node-level prediction tasks.
method Analyzing the Gaussian process limits of graph transformers with infinite width and infinite heads.
result Graph transformers maintain discriminative node representations even in deep layers, preventing oversmoothing.

The design of deep graph models still remains to be investigated and the crucial part is how to explore and exploit the knowledge from different hops of neighbors in an efficient way. In this paper, we propose a novel RNN-like deep graph neural network architecture by incorporating AdaBoost into the computation of netw…

2019-08-14abs ↗pdf ↗

We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional architecture via a localized first-order approximation of spectral graph convolutions.…

2016-09-09abs ↗pdf ↗

Paper analyzes GCNN sensitivity to probabilistic graph perturbations.

problem Investigating how GCNNs handle probabilistic graph errors.
method Establishes error bounds and linear relationships between GSO perturbations and GCNN outputs.
result GCNNs maintain stability under graph edge perturbations if GSO errors are bounded.

While convolutional neural networks (CNNs) have recently made great strides in supervised classification of data structured on a grid (e.g. images composed of pixel grids), in several interesting datasets, the relations between features can be better represented as a general graph instead of a regular grid. Although re…

2018-10-31abs ↗pdf ↗

The paper bounds the complexity of GCNs using Rademacher complexity.

problem Understanding the sample complexity of GCNs.
method Derived tight upper and lower bounds of Rademacher complexity for GCN models.
result The derived bounds depend on the largest eigenvalue of the graph filter and the degree distribution.

Graph Neural Network (GNN) research has concentrated on improving convolutional layers, with little attention paid to developing graph pooling layers. Yet pooling layers can enable GNNs to reason over abstracted groups of nodes instead of single nodes. To close this gap, we propose a graph pooling layer relying on the …

2019-05-27abs ↗pdf ↗

The paper introduces a new loss function to prevent overfitting in semi-supervised graph networks.

problem Overfitting in semi-supervised graph networks trained with cross-entropy loss.
method Proposes an unsupervised manifold smoothness loss to regularize the graph convolutional networks.
result Adding the proposed loss consistently improves performance of graph networks.

GACAN combines multi-granularity time series for traffic forecasting.

problem High dynamics and complex spatial-temporal dependency of road networks in traffic forecasting.
method Graph Attention-Convolution-Attention Networks (GACAN) with Att-Conv-Att (ACA) block.
result GACAN outperforms state-of-the-art baselines in traffic forecasting.

Convolutional layers in graph neural networks are a fundamental type of layer which output a representation or embedding of each graph vertex. The representation typically encodes information about the vertex in question and its neighbourhood. If one wishes to perform a graph centric task, such as graph classification,…

2019-05-15abs ↗pdf ↗

New linear flows using exponential of linear transformations improve generative models.

problem Improving generative models in machine learning.
method Developed convolution exponentials and generalized Sylvester Flows using the exponential of linear transformations.
result Convolution exponentials and Convolutional Sylvester Flows outperform other models in log-likelihood.

We present our ongoing work on understanding the limitations of graph convolutional networks (GCNs) as well as our work on generalizations of graph convolutions for representing more complex node attribute dependencies. Based on an analysis of GCNs with the help of the corresponding computation graphs, we propose a gen…

2018-05-04abs ↗pdf ↗

Proposes SimPool for graph pooling using structural similarity features.

problem Challenges in graph pooling due to lack of spatial locality.
method Integrates structural similarity features with a revised pooling layer to propose SimPool.
result SimPool produces node cluster assignments resembling CNN's locality preserving pooling.

Graph convolutional networks (GCNs) have recently become one of the most powerful tools for graph analytics tasks in numerous applications, ranging from social networks and natural language processing to bioinformatics and chemoinformatics, thanks to their ability to capture the complex relationships between concepts. …

2019-04-04abs ↗pdf ↗

DeeperGCN tackles deep GCNs by overcoming vanishing gradient and over-smoothing issues.

problem Vanishing gradient, over-smoothing, and over-fitting issues in deep GCNs.
method DeeperGCN uses differentiable generalized aggregation functions and a novel normalization layer (MsgNorm) to train deep GCNs.
result DeeperGCN significantly boosts performance on large-scale graph learning tasks.

Graph convolutional neural networks (GCNNs) have been attracting increasing research attention due to its great potential in inference over graph structures. However, insufficient effort has been devoted to the aggregation methods between different convolution graph layers. In this paper, we introduce a graph attribute…

2019-05-14abs ↗pdf ↗

Learning representation on graph plays a crucial role in numerous tasks of pattern recognition. Different from grid-shaped images/videos, on which local convolution kernels can be lattices, however, graphs are fully coordinate-free on vertices and edges. In this work, we propose a Gaussian-induced convolution (GIC) fra…

2018-11-11abs ↗pdf ↗

InteractionNet models noncovalent protein-ligand interactions with GNNs and explains predictions.

problem Modeling noncovalent protein-ligand interactions with graph neural networks.
method InteractionNet uses a GNN architecture with separated covalent and noncovalent convolution layers and layer-wise relevance propagation for explainability.
result InteractionNet successfully predicts noncovalent protein-ligand interactions with chemical relevance.

GCNs improve regression tasks by aggregating neighbor signals.

problem GCNs' statistical properties in regression tasks are poorly understood.
method Examined two GCN convolutions and their impact on learning error.
result GCNs have a bias-variance trade-off that depends on neighborhood size and topology.

The spatial convolution layer which is widely used in the Graph Neural Networks (GNNs) aggregates the feature vector of each node with the feature vectors of its neighboring nodes. The GNN is not aware of the locations of the nodes in the global structure of the graph and when the local structures corresponding to diff…

2019-10-03abs ↗pdf ↗

Learning to cooperate is crucially important in multi-agent environments. The key is to understand the mutual interplay between agents. However, multi-agent environments are highly dynamic, where agents keep moving and their neighbors change quickly. This makes it hard to learn abstract representations of mutual interp…

2018-10-22abs ↗pdf ↗

Graph neural networks, which generalize deep neural network models to graph structured data, have attracted increasing attention in recent years. They usually learn node representations by transforming, propagating and aggregating node features and have been proven to improve the performance of many graph related tasks…

2019-04-30abs ↗pdf ↗

VQ-GNN scales GNNs to large graphs using vector quantization.

problem Scaling GNNs to large graphs with stable performance and speed.
method VQ-GNN uses vector quantization to preserve all messages passed to a mini-batch of nodes, avoiding the 'neighbor explosion' problem.
result VQ-GNN achieves competitive performance on large-graph node classification and link prediction benchmarks.

Deep Graph Neural Networks (GNNs) are useful models for graph classification and graph-based regression tasks. In these tasks, graph pooling is a critical ingredient by which GNNs adapt to input graphs of varying size and structure. We propose a new graph pooling operation based on compressive Haar transforms -- HaarPo…

2019-09-25abs ↗pdf ↗

Single-layer GCN model improves recommendation performance with less complexity.

problem Severe computational burden and excessive model parameters in existing GCN models.
method Proposes a single-layer GCN architecture with a simplified aggregation step using DA similarity.
result Significantly outperforms existing GCN models and achieves up to a few orders of magnitude speedup.