Graph Convolutional Reinforcement Learning improves cooperation in dynamic multi-agent environments.
problem Learning cooperation in dynamic multi-agent environments is challenging.
method Graph Convolutional Reinforcement Learning adapts to dynamic graphs and captures interplay between agents.
result Our method substantially outperforms existing methods in cooperative scenarios.
DeepPocket uses graph convolutional reinforcement learning for better financial portfolio management.
problem Maximizing return on investment while managing risk in correlated financial assets.
method Graph convolutional reinforcement learning framework with feature extraction, local information collection, and actor-critic reinforcement learning.
result DeepPocket outperformed market indexes on five real-life datasets over three investment periods, including during the Covid-19 crisis.
Graph ConvNet learns to solve Tree Decomposition problems efficiently.
problem Tree Decomposition problem in graph theory and its applications.
method Graph Convolutional Neural Network (GCN) combined with Reinforcement Learning (Actor-Critic method).
result The model efficiently generalizes from small to large real-world instances of the TD problem.
Proposes Deep Scenes for interaction-aware scene understanding in reinforcement learning for autonomous driving.
problem Leveraging deep reinforcement learning for high-level decision making in autonomous driving requires handling variable-length sequences of different object types and interactions.
method Introduces Deep Scenes architecture, an extension of Deep Sets or Graph Convolutional Networks, to learn complex interaction-aware scene representations.
result Graph-Q and DeepScene-Q algorithms outperform state-of-the-art methods in evaluations with SUMO.
Proposes active learning for meta-learning in graph node response prediction.
problem Difficulty in improving performance with meta-learning due to unbalanced observations.
method Combines graph convolutional neural networks and reinforcement learning for both prediction and node selection.
result Can predict responses and select nodes even for unseen response variables.
GNN-CL model improves financial fraud detection using graph neural networks and reinforcement learning.
problem Complex financial fraud detection with high false positive rates.
method Combines GNN, CNN, LSTM, and MLPS to analyze transaction patterns and uses reinforcement learning to filter out noise.
result GNN-CL outperforms existing methods in financial fraud detection, reducing false positives.
AI learns to design chemical processes efficiently.
problem Designing efficient chemical processes.
method Hierarchical reinforcement learning and graph neural networks.
result Quick learning in various decision spaces.
A new method for semi-supervised classification using graph walks and reinforcement learning.
problem Efficiently classifying nodes in attributed networks with limited labeled data.
method Proposes a reinforcement learning approach to find optimal paths in the graph for classification.
result The method outperforms existing approaches on multiple datasets.
Survey of deep learning methods on graphs.
problem Applying deep learning to graph data is challenging.
method Divided into five categories: graph recurrent neural networks, graph convolutional networks, graph autoencoders, graph reinforcement learning, and graph adversarial methods.
result Comprehensive review of deep learning methods on graphs.
Rewiring edges subtly improves graph neural networks' robustness.
problem Vulnerability of graph neural networks to subtle structural perturbations.
method Proposes a graph rewiring operation and uses reinforcement learning to learn attack strategies.
result Demonstrates the effectiveness of the proposed framework on real-world graphs.
Generating novel graph structures that optimize given objectives while obeying some given underlying rules is fundamental for chemistry, biology and social science research. This is especially important in the task of molecular graph generation, whose goal is to discover novel molecules with desired properties such as …
Proposes a method to improve urban spatiotemporal forecasting using multi-modal graph interaction.
problem Improving spatiotemporal forecasting in urban areas using graph convolution networks.
method Develops modality interaction mechanisms for multi-graph convolution networks to reduce generalization error.
result Proposed techniques improve prediction accuracy and model robustness compared to state-of-the-art baselines.
GCOMB learns heuristics for large graphs efficiently.
problem Scalability and practical constraints in graph problem solving.
method GCOMB uses a Graph Convolutional Network (GCN) with Q-learning for efficient heuristic discovery.
result GCOMB is 100 times faster and marginally better than state-of-the-art algorithms.
AGNN automates GNN architecture search, achieving best performance.
problem Finding optimal GNN architectures is laborious and requires human expertise.
method AGNN uses reinforcement learning to search for optimal GNN architectures within a predefined space, with a novel parameter sharing strategy.
result AGNN identifies optimal GNN architectures achieving best performance.
New optimization algorithms on orthogonal group for machine learning.
problem Efficient optimization on the orthogonal group for machine learning tasks.
method Stochastic geometric algorithms on Lie groups.
result Strong performance on diverse machine learning tasks.
IG-RL learns adaptive traffic signals for any network, outperforming existing methods.
problem Adaptive traffic signal control for large networks with combinatorial state and action spaces.
method Graph-Convolutional Networks for decentralized, flexible control.
result IG-RL generalizes to new networks and traffic conditions without additional training.
Tail-GNNs improve protein function prediction using relational reinforcement.
problem Predicting hierarchical protein functions from sequence data.
method Combining Tail-GNNs with dilated convolutional networks for multi-task learning.
result Significant improvement in F_1 score for protein function prediction.
Simplified NAS for GNN architectures improves efficiency and expressiveness.
problem Efficient and effective discovery of optimal GNN architectures.
method SNAG framework with a novel search space and reinforcement learning.
result SNAG framework outperforms human-designed and existing NAS methods.
Graph-based state representation improves deep RL performance.
problem High sample-complexity and starting with a good input representation in deep RL.
method Exploiting the graph structure of MDPs for effective state representation learning.
result Graph-based node representation methods outperform matrix-based methods in grid-world navigation tasks.
Graph convolutional Gaussian processes learn functions on graphs.
problem Learning translation-invariant relationships on non-Euclidean domains.
method Bayesian nonparametric method using graph convolutional neural networks.
result Graph convolutional Gaussian processes outperform existing methods on images and triangular meshes.
Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with graph-dependent linear operations. However, these graph-dependent linear operations are d…
Develops BASGCN for graph classification with improved feature learning.
problem Graph classification with information loss and imprecise representation.
method Transforms graphs into grid structures and defines a new spatial graph convolution operation.
result Reduces information loss and improves feature representation compared to existing models.
Traffic forecasting is a particularly challenging application of spatiotemporal forecasting, due to the time-varying traffic patterns and the complicated spatial dependencies on road networks. To address this challenge, we learn the traffic network as a graph and propose a novel deep learning framework, Traffic Graph C…
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…
Paper improves graph convolutional networks by adjusting filter size.
problem Improving predictive performance of graph convolutional networks.
method Introducing a hyper-parameter to influence filter size in graph convolutions.
result Improves predictive performance of Deep Graph Convolutional Networks.
Graph convolutional networks fail to use eigenvectors beyond the first, unlike spectral embedding.
problem Understanding when graph convolutional networks fail compared to spectral embedding.
method Presented a simple generative model to illustrate failure.
result Graph convolutional networks fail to use eigenvectors beyond the first in certain graphs.
New model learns graph features for classification.
problem Graph classification with structural information loss.
method Transform graphs into vertex grids, apply vertex convolution.
result Model preserves structural information on local vertices.
DSGC improves graph representation learning by modeling object links and attribute relations.
problem Limited modeling capability of existing GCN variants on noisy and sparse real-world networks.
method Dimensionwise separable 2-D graph convolution (DSGC) that filters node features.
result DSGC achieves significant performance gain over state-of-the-art methods for node classification and clustering.
Improves reinforcement learning extrapolation in Gridworlds.
problem Generalizing to unseen states in reinforcement learning.
method Avoiding deterministic action choice, using ego-centric representation, incorporating symmetry, and adding an entropy term.
result Significant improvement in extrapolation performance in Gridworld environments.
CTGCN learns dynamic graph embeddings preserving both local and global graph structure.
problem Learning node representations for evolving graphs while preserving both local and global graph structure.
method CTGCN uses k-core based temporal graph convolutional network to learn dynamic graph embeddings.
result CTGCN outperforms existing methods in link prediction and structural role classification.
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.…
Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-d…
Graph CNN method improves classification of irregular spatial data like building patterns.
problem Challenges in analyzing irregular spatial data with machine learning.
method Graph Fourier transform and convolution theorem to convert irregular spatial data into a learnable format.
result Significantly improved classification of building patterns compared to other methods.
Graph convolutional kernel networks generalize CNNs to graph data.
problem Representing graph-structured data for machine learning.
method Convolutional kernel networks applied to graph data.
result Competitive performance on graph classification benchmarks.
Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous node and edge attributes. Analogous to image-based convolutional networks that op…
RCRC model extracts features quickly and efficiently for reinforcement learning tasks.
problem High computational costs in training reinforcement learning models.
method Convolutional Reservoir Computing (RCRC) model using random fixed-weight CNN and reservoir computing.
result RCRC model achieves state-of-the-art scores in reinforcement learning tasks.
Graph diffusion convolution improves graph learning by leveraging generalized graph diffusion.
problem Noisy and arbitrarily defined edges in real graphs.
method Graph diffusion convolution (GDC) using generalized graph diffusion like heat kernel and personalized PageRank.
result Replacing message passing with graph diffusion convolution leads to significant performance improvements.
Interactive RL and DT feedback improve feature selection efficiency.
problem Balancing feature selection effectiveness and efficiency.
method Interactive Reinforcement Learning (IRL) and Decision Tree Feedback (DTF) architecture.
result Improved feature selection performance on real-world datasets.
Proposes GIC for graph convolution, improving graph classification.
problem Graphs lack local convolution kernels like images.
method GIC framework using edge-induced and vertex-induced Gaussian mixtures.
result GIC achieves state-of-the-art results on graph classification.
DeepMap learns deep graph representations via CNNs, improving graph classification performance.
problem Quantifying graph similarities for tasks like classification.
method Proposes DeepMap framework extending CNNs to arbitrary graphs, learning dense low-dimensional vectors.
result DeepMap achieves state-of-the-art performance on graph classification benchmarks.
Introduces data augmentation for graph convolutional networks, proposing Monte Carlo Graph Learning.
problem Lack of transparency in graph convolutional networks.
method Data augmentation through graph structure, training traditional classifiers on expanded training set.
result MCGL shows better tolerance to graph structure noise than GCN on noisy graphs.
LanczosNet uses Lanczos algorithm for efficient graph convolution.
problem Efficiently capturing multi-scale information in graph data.
method Lanczos algorithm for low-rank graph Laplacian approximation, learnable spectral filters.
result LanczosNet achieves state-of-the-art performance on citation networks and QM8.
Proposes dynamic graph and node feature learning in GCNNs for better adaptability.
problem Fixed graphs for all GCNN layers limit adaptability to node feature structures.
method Dynamic graph and node feature learning using Mahalanobis distance metric.
result Superior performance in point clouds and citation networks.
DEMO-Net improves graph neural networks by focusing on node degree.
problem Limited analysis of graph convolution properties and lack of degree-specific graph structure.
method Proposes DEMO-Net, a degree-specific graph neural network that recursively identifies 1-hop neighborhood structures and uses multi-task learning for node representation learning.
result Demonstrates effectiveness and efficiency of DEMO-Net on node and graph classification benchmarks.
The paper analyzes stability and generalization of GCNNs on graphs.
problem Theoretical understanding of GCNN models' generalization properties.
method Analysis of stability and derivation of generalization guarantees for semi-supervised graph learning.
result The stability of GCNN models depends on the largest absolute eigenvalue of the graph convolution filter.
Paper proposes M3S training for GCNs on graphs with few labels.
problem Learning graph embeddings with few labeled nodes is challenging.
method Multi-Stage Self-Supervised (M3S) Training Algorithm combining self-supervised learning.
result M3S Training Algorithm improves GCNs' generalization on graphs with few labeled nodes.
Improved GCNs for non-sparse graphs with low-rank filters.
problem Training and evaluation of GCNs on large non-sparse graphs is computationally expensive.
method Introduced low-rank filters and a reduced-order GCN architecture.
result Significant runtime acceleration and improved accuracy achieved.
Convolutional neural networks (CNNs) can be applied to graph similarity matching, in which case they are called graph CNNs. Graph CNNs are attracting increasing attention due to their effectiveness and efficiency. However, the existing convolution approaches focus only on regular data forms and require the transfer of …