Graph neural networks benefit from node features but struggle with featureless graphs.
problem Graph neural networks struggle with featureless graphs.
method Analyzed node features' impact, proposed new feature initialization methods.
result Artificial features are highly competitive with real features.
Survey on graph neural networks for non-Euclidean data.
problem Challenges in processing graph data.
method Taxonomy of graph neural networks.
result Comprehensive overview and taxonomy of GNNs.
Finslerian graph neural networks recover nonlinear diffusion geometry
problem Graph neural networks on point clouds
method Estimates of the Finsler Laplacian
result Recovery of Finsler geometry
Improved graph neural network bounds using graph diffusion matrix.
problem Empirical performance of graph neural networks on real-world graphs.
method Unified model of graph neural networks, focusing on feature diffusion matrix stability.
result Generalization bounds scale with largest singular value of feature diffusion matrix, smaller than prior bounds.
FGNN generalizes graph neural networks to capture higher-order dependencies.
problem Capturing higher-order dependencies in graph-structured data.
method Introducing a factor graph neural network (FGNN) that can represent Max-Product Belief Propagation.
result FGNN effectively represents Max-Product Belief Propagation and performs well on both synthetic and real datasets.
Graph neural networks tackle representation learning for small and giant graphs.
problem Learning representations from small and giant graphs.
method Various graph neural network models tailored for small and giant graphs.
result Graph neural networks achieve state-of-the-art performance on node and graph classification tasks.
Graph neural networks are found to be primarily low-pass filters, not manifold learners.
problem Improving performance and scalability of graph neural networks for graph-structured data.
method Developed a theoretical framework based on graph signal processing.
result Graph neural networks only perform low-pass filtering on feature vectors and do not have non-linear manifold learning property.
Study bounds graph neural networks' over-parameterized error.
problem Understanding graph neural networks' performance in over-parameterized regimes.
method Developed mean-field regime bounds for graph convolutional and message passing neural networks.
result Established upper bounds with a convergence rate of O(1/n) for generalization error. Paper presents RGNN for better graph node representation learning.
problem Node representation learning with graph neural networks.
method Recurrent Graph Neural Network (RGNN) with recurrent units.
result RGNN achieves state-of-the-art results on three benchmarks.
New model learns graph neural networks equivariant to various transformations.
problem Learning equivariant graph neural networks for complex transformations.
method E(n)-Equivariant Graph Neural Networks (EGNNs) that are computationally efficient and scalable.
result Achieves competitive or better performance without higher-order representations.
Graph neural networks struggle with structural noise.
problem Robustness of graph neural networks to structural noise.
method Controlled experiments with a representative GNN model.
result Graph neural networks are not robust to structural noise.
Explains differences between WL and folklore-WL formulations in graph neural networks.
problem Understanding the differences between WL and folklore-WL formulations in graph neural networks.
method Visual explanation of differences between WL and folklore-WL formulations.
result Clarifies the differences between WL and folklore-WL formulations.
Graph neural network predicts JavaScript types with high accuracy.
problem Automatic code repair for JavaScript programs.
method Graph Neural Network model for token type prediction.
result Achieved above 90% accuracy in token type predictions.
Study compares atom representations in graph neural networks for molecular properties.
problem Incorrect attribution of results in molecular property prediction due to varying atom features.
method Evaluated multiple atom representations on free energy, solubility, and metabolic stability predictions.
result Different atom representations can lead to varying predictive performance in graph neural networks.
Graph neural networks over-smooth when layers increase, reducing discriminative power.
problem Over-smoothing in graph neural networks reduces model performance as the number of layers increases.
method Analyzed over-smoothing in general graph neural network architecture using Dirichlet energy.
result The Dirichlet energy of embeddings converges to zero, leading to loss of discriminative power.
New method improves graph neural networks by considering different types of relations in sampling.
problem Current graph neural networks ignore relation types in biomedical graphs, leading to suboptimal performance.
method Proposes relation-dependent sampling for multi-relational graphs to balance relation frequency and importance.
result State-of-the-art graph neural networks achieve better accuracy and efficiency with relation-dependent sampling.
New method speeds up sparse graph neural networks training on dense hardware.
problem Training sparse graph neural networks is slow on custom hardware.
method Inspired by sparse matrix optimization, developed techniques for dense hardware.
result Sparse graph neural networks trained in 13 minutes on 512-core TPUv2 Pod.
Graph neural network using Beltrami flow for feature and topology evolution.
problem Efficient feature learning and topology evolution on graphs.
method Discretized Beltrami flow applied to graph neural networks with positional encodings.
result Achieves state-of-the-art results on various benchmarks.
Proposes continuous graph neural networks to capture long-range dependencies.
problem Capturing long-range dependencies in graph data.
method Defines continuous dynamics for graph neural networks using diffusion-based methods.
result Proposed continuous graph neural networks are effective and deeper networks can capture long-range dependencies.
Improved GNN handles long-range dependencies in multi-relational graphs.
problem Vanishing gradients in GNNs for multi-relational graphs.
method Proposes a Gated Graph Neural Network with improved long-range dependency handling.
result Outperforms popular GNN models in synthetic tasks.
New graph learning model can approximate any function and handle edge values.
problem Graph learning models' limitations in approximating functions and handling edge values.
method Proposes a Graph Neural Network that can approximate any function and handle arbitrary edge values.
result Proves the model is strictly more expressive than existing models.
Customized-GNN generates model-specific for each graph.
problem Graphs in the same dataset have distinct structures.
method Proposes Customized-GNN framework to generate model-specific for each graph.
result Demonstrates effectiveness on various graph classification benchmarks.
DIFNET tackles the suspended animation problem in deep graph neural networks.
problem Deep graph neural networks suffer from the suspended animation problem.
method DIFNET uses neural gates and graph residual learning for node hidden state modeling, and includes an attention mechanism for node neighborhood information diffusion.
result DIFNET effectively addresses the suspended animation problem and improves learning performance.
ARMA filters improve graph neural networks' flexibility and robustness.
problem Improving graph neural networks' performance and robustness.
method Proposes an ARMA-based graph convolutional layer for graph neural networks.
result ARMA filters outperform polynomial filters in various graph tasks.
Graph Neural Network improves causal inference in dynamic systems.
problem Identifying causal relations among multi-variate time series.
method Graph Neural Network approach with score-based method.
result Graph Neural Network significantly outperformed other methods in dynamic Bayesian network inference.
This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.
problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.
Graph matching with feature vectors is solved using a two-layer graph neural network.
problem Graph matching in the presence of sparse binary features.
method Two-layer graph neural network with graph structure.
result Graph neural network can recover correct mapping with high probability under certain conditions.
Graph neural networks perform better with more features and training data.
problem Comparing graph neural networks to simple models in semi-supervised node classification.
method Empirical evaluation of graph neural network architectures in various settings.
result More complex graph networks outperform simple models in settings with fewer features and more training data.
Graph neural networks are explained through energy gradient flow and framelet decomposition.
problem Understanding and improving graph neural networks.
method Viewing framelet-based models as gradient flows of energy, proposing a generalized energy via framelet decomposition.
result The proposed model leads to more flexible dynamics, enhancing graph neural networks.
BiGraphNet generalizes graph neural networks for more efficient operations.
problem Fragmented graph neural network architectures hinder optimization.
method Explicitly separates input and output nodes, enabling new efficient operations.
result BiGraphNet accelerates and scales computations in hierarchical networks.
A new graph neural network (NBA-GNN) avoids revisiting nodes to improve accuracy.
problem Redundancy in graph neural network updates causes over-squashing and inaccurate recognition.
method Proposes non-backtracking graph neural networks (NBA-GNN) that update messages without revisiting nodes.
result The NBA-GNN alleviates over-squashing and improves performance on graph benchmarks.
Optimizes graph neural networks using natural gradient descent.
problem Improving efficiency and performance of graph neural networks.
method Employing natural gradient descent to optimize graph neural networks.
result Natural gradient optimization leads to superior performance compared to existing methods.
TGNN combines GNN and SMM for better trading network predictions.
problem Predicting asset prices in trading networks with structural impact factors.
method Combines GNN and SMM for asset price prediction.
result TGNN outperforms existing methods in prediction accuracy.
Graph neural networks speed up nonnegative matrix factorization.
problem Efficiently factorize nonnegative matrices for various applications.
method Developed a graph neural network that combines bipartite self-attention with ADMM updates.
result Significant acceleration achieved in nonnegative matrix factorization.
Simple proof shows graph neural networks are versatile.
problem Proving the universality of graph neural networks.
method Introduced a Graph Homomorphism Model to prove universality.
result Simple proofs of graph neural network universality.
Spektral simplifies graph neural networks with TensorFlow and Keras.
problem Building graph neural networks efficiently.
method Open-source library implementing various graph neural network methods.
result Performance of implemented methods in node, graph, and graph regression tasks.
Training-free GNNs use labels as features to improve node classification.
problem Improving graph neural networks for transductive node classification.
method Advocates labels as features, designs training-free GNNs based on this.
result Training-free GNNs outperform traditional GNNs in node classification.
DNA improves graph neural networks by selectively aggregating node embeddings.
problem Static neighborhood aggregation limits graph neural networks' performance.
method Dynamic neighborhood aggregation guided by attention and controlled channel connections.
result DNA outperforms current methods in transductive node classification.
New approach to deeper graph neural networks to avoid performance degradation.
problem Performance degradation of graph neural networks when going deeper.
method Decoupling representation transformation and propagation in graph convolution operations.
result Deeper graph neural networks can be used to learn graph node representations from larger receptive fields.
Graph Neural Networks improve machine learning on relational databases.
problem Training machine learning models on relational databases requires costly data extraction and feature engineering.
method Uses Graph Neural Networks to extract features from relational databases.
result Outperforms state-of-the-art automatic feature engineering methods.
GMNN combines conditional random fields and graph neural networks for relational data.
problem Semi-supervised object classification in relational data.
method Combines conditional random fields and graph neural networks. Uses variational EM algorithm for training.
result GMNN achieves state-of-the-art results on object classification, link classification, and unsupervised node representation learning.
Graph neural networks are vulnerable to adversarial attacks that manipulate graph structure.
problem Vulnerability of graph neural networks to adversarial attacks.
method Meta-learning approach to solve bilevel optimization problem of training-time attacks.
result Small graph perturbations can significantly degrade graph neural network performance.
Survey on GNNs' power and limitations.
problem Theoretical limitations of GNNs.
method Comprehensive overview of GNNs and their variants.
result Provably powerful variants of GNNs.
Graph neural networks with random features can approximate any function on directed graphs.
problem Approximating functions on directed graphs with graph neural networks.
method Random node features combined with partially random node features in permutation-equivariant neural networks (PENNs).
result Graph neural networks with random features can approximate any measurable permutation-invariant or permutation-equivariant function on directed graphs of fixed size.
Graph neural networks improve cold start for new items in recommender systems.
problem Cold start problem for new items in recommender systems.
method Item hierarchy graphs and bespoke graph neural network architecture.
result Our method achieves better forecasting quality than state-of-the-art with comparable computational time.
Wiki-CS dataset benchmarks Graph Neural Networks using Wikipedia articles.
problem Benchmarking Graph Neural Networks on a new domain with structural differences.
method Derived from Wikipedia, nodes represent Computer Science articles, edges from hyperlinks, 10 classes for different branches, evaluated semi-supervised node classification and link prediction.
result Graph Neural Networks perform well on Wiki-CS, showing structural differences from earlier benchmarks.
GraphMix improves GNNs for semi-supervised learning.
problem Improving GNNs for semi-supervised classification.
method Parameter sharing and interpolation-based regularization.
result GraphMix improves generalization bounds and state-of-the-art performance.
New hypergraph operators improve graph neural networks for higher-order relationships.
problem Learning deep embeddings on high-order graph-structured data.
method Introducing hypergraph convolution and hypergraph attention operators.
result Extensive experimental results show the effectiveness of hypergraph operators.