A novel hyperbolic graph attention network for non-Euclidean graph data.
problem Non-Euclidean graph data requires specialized models to capture its unique properties.
method Employed gyrovector spaces to transform features and hyperbolic proximity attention mechanism for aggregation. Novel acceleration strategy using logarithmic and exponential mappings.
result Demonstrated superior performance on real-world datasets compared to state-of-the-art methods.
This work improves KG embeddings by integrating hyperbolic and attention mechanisms.
problem Preserving hierarchical and logical patterns in KGs with low-dimensional embeddings.
method Combines hyperbolic reflections/rotations with attention mechanisms to capture complex relational patterns.
result Improves MRR by up to 6.1% on standard benchmarks and new state-of-the-art results in high dimensions.
AMES framework selects optimal embedding space for latent graph inference.
problem No principled method for choosing the best embedding space for latent graph inference.
method Differentiable AMES framework using backpropagation to select optimal embedding space.
result Consistently achieves comparable or superior results across multiple datasets.
Hyperbolic embeddings have recently gained attention in machine learning due to their ability to represent hierarchical data more accurately and succinctly than their Euclidean analogues. However, multi-relational knowledge graphs often exhibit multiple simultaneous hierarchies, which current hyperbolic models do not c…
Obtaining continuous representations of structural data such as directed acyclic graphs (DAGs) has gained attention in machine learning and artificial intelligence. However, embedding complex DAGs in which both ancestors and descendants of nodes are exponentially increasing is difficult. Tackling in this problem, we de…
Improved graph attention model for noisy graphs.
problem Understanding and improving graph attention in noisy graphs.
method Proposes SuperGAT, a self-supervised graph attention network.
result SuperGAT learns more expressive attention by encoding edges.
SpGAT learns graph representations using spectral attention for efficiency.
problem Efficiently capturing global graph patterns with minimal parameters.
method Introduces Spectral Graph Attention Network (SpGAT) using spectral domain attention mechanisms and a fast Chebychev approximation.
result SpGAT achieves better global pattern recognition with fewer parameters compared to GAT.
Graph attention networks improve performance on heterogeneous graphs.
problem Complex performance of GNNs on heterogeneous graphs.
method Integrating positional encodings into graph attention networks.
result Graph attention networks excel in node classification and link prediction.
SGATs learn sparse attention coefficients to improve graph learning tasks on large, noisy graphs.
problem Overfitting and noisy edges in GNNs on large, noisy graphs.
method Sparse Graph Attention Networks (SGATs) learn sparse attention coefficients under L0-norm regularization. result SGATs can remove 50%-80% edges from large graphs while maintaining similar classification accuracies.
CoulGAT interprets GAT models by analyzing node interactions.
problem Understanding and interpreting the complex interactions within graph attention networks.
method Developed a CoulGAT framework to analyze and interpret GAT model layers and datasets.
result Extracted node-node and node-feature interactions to define a standard model for graph structure.
Graph attention improves node classification by distinguishing important edges.
problem Node classification in graph-based learning models.
method Theoretical analysis of graph attention networks for node classification.
result Graph attention can perfectly classify nodes in an 'easy' regime but fails in a 'hard' regime.
Attention operators have been widely applied in various fields, including computer vision, natural language processing, and network embedding learning. Attention operators on graph data enables learnable weights when aggregating information from neighboring nodes. However, graph attention operators (GAOs) consume exces…
This paper explains GNNs using graph signal denoising.
problem Understanding how GNNs work for node representation learning.
method Spectral graph convolutional networks and graph attention networks are analyzed from the perspective of graph signal denoising.
result GNNs implicitly solve graph signal denoising problems.
CLEAR learns causal graphs from attention in recommender systems to explain user behavior.
problem Understanding why specific recommendations are made in recommender systems.
method CLEAR learns session-specific causal graphs from attention in pre-trained neural recommenders, addressing latent confounders.
result CLEAR provides counterfactual explanations that are shorter and more effective than naive methods.
PiNet improves graph classification efficiency and accuracy.
problem Graph level classification challenges.
method Attention-based pooling mechanism for graph convolution operations.
result Superior performance and high sample efficiency.
Dual-attention GCN improves text classification by adapting to textual complexity.
problem Challenges in learning discriminative features from texts due to graph variants.
method Proposes a dual-attention GCN with connection-attention and hop-attention mechanisms.
result Achieves state-of-the-art performance on text classification tasks.
HopGAT improves node classification in sparsely labeled graphs by learning from distant neighbors.
problem Classifying nodes in sparsely labeled graphs with limited labeled data.
method Hop-aware supervision mechanism and simulated annealing learning strategy.
result The model achieves high accuracy even with 40% labeled data, reducing performance loss to 3.9%.
Graph attention is not always beneficial; conditions for perfect node classification are identified.
problem Understanding when graph attention mechanisms improve node classification performance.
method Theoretical analysis using Contextual Stochastic Block Models (CSBMs).
result Graph attention mechanisms are more effective when structure noise exceeds feature noise, and simpler graph convolution operations are better when feature noise predominates.
Enhanced GNN with expanded attention window and partially random embeddings.
problem Limited expressivity of traditional GNNs in distinguishing non-isomorphic graphs.
method Graph attention network with expanding attention window and partially random initial embeddings. Head dropout for regularization.
result Improved ability to differentiate between non-isomorphic graphs.
We aim to better understand attention over nodes in graph neural networks (GNNs) and identify factors influencing its effectiveness. We particularly focus on the ability of attention GNNs to generalize to larger, more complex or noisy graphs. Motivated by insights from the work on Graph Isomorphism Networks, we design …
We investigate Relational Graph Attention Networks, a class of models that extends non-relational graph attention mechanisms to incorporate relational information, opening up these methods to a wider variety of problems. A thorough evaluation of these models is performed, and comparisons are made against established be…
Improves GATs by adding margin-based constraints to prevent over-fitting and over-smoothing.
problem Over-fitting and over-smoothing in GATs.
method Margin-based constraints on attention weights and graph structure.
result Significant improvements over previous GATs on various datasets.
Graph Attention Networks improve image classification with superpixels.
problem Classifying images with irregular shapes and edges.
method Transform images into superpixel graphs, then apply GATs.
result GATs outperform other GNN models in image classification.
Study compares deep learning models for traffic forecasting, highlighting graph elements' impact.
problem Challenges in forecasting spatial-temporal traffic patterns.
method In-depth comparative study of four deep neural network models with different basic elements.
result Graph attention improves long-term predictions in traffic forecasting models.
Attention-based GNNs can't prevent oversmoothing, leading to homogeneous node representations.
problem The issue of oversmoothing in attention-based GNNs.
method Viewed attention-based GNNs as nonlinear time-varying dynamical systems and used tools from the theory of products of inhomogeneous matrices and the joint spectral radius.
result Graph attention mechanism cannot prevent oversmoothing and loses expressive power exponentially.
FastGAT reduces GNN computation time by 10x using graph sparsification.
problem High computational burden in attention-based GNNs.
method Spectral sparsification to generate optimal graph pruning.
result Per-epoch time is almost linear in graph nodes, reducing computational time by up to 10x.
We show that a relatively hyperbolic graph with uniformly hyperbolic peripheral subgraphs is hyperbolic. As an application, we show that the disc graph and the electrified disc graph of a handlebody H of genus g>1 are hyperbolic, and we determine their Gromov boundaries.
MAGNA improves graph neural networks by incorporating multi-hop context information.
problem Limited context in current graph neural networks.
method Diffuses attention scores across the network, accounting for all paths between nodes.
result State-of-the-art performance on node classification and knowledge graph completion benchmarks.
Spectro-Riemannian Graph Neural Networks integrate spectral and curvature signals for better graph representation learning.
problem Enhance graph representation learning by leveraging spectral and curvature signals.
method Proposes Spectro-Riemannian Graph Neural Networks (CUSP) that combines spectral and curvature insights.
result Empirical evaluation shows CUSP outperforms state-of-the-art models by up to 5.3%.
Proposes a novel node embedding framework for graphs using Fisher Information.
problem Lack of theoretical understanding of attention-based GNNs.
method Uses hierarchical kernels and Fisher Information to learn node embeddings.
result Proposed method outperforms existing GNNs on node classification benchmarks.
Graphs of multicurves are hyperbolic, relatively hyperbolic, or thick.
problem Characterizing graphs of multicurves based on their geometric properties.
method Proving graphs of multicurves are hyperbolic, relatively hyperbolic, or thick based on subsurface intersections.
result Geometric characterization of graphs of multicurves.
A new method reduces memory requirements for Graph Transformers by sparsely training a network.
problem Quadratic memory complexity in Graph Transformers limits their scalability to large graphs.
method Spexphormer: trains a narrow network on augmented graph, then uses only active connections in a wider network.
result Spexphormer achieves good performance with drastically reduced memory requirements.
RoGAT enhances GAT robustness against adversarial attacks.
problem Vulnerability of GAT to adversarial attacks.
method Dynamic adjustment of edge weights and features, with an extra attention score.
result RoGAT outperforms other defensive methods in robustness tests.
Non-relatively hyperbolic separating curve graph for surfaces.
problem Classifying hyperbolicity of separating curve graphs.
method Proof of non-relatively hyperbolic property.
result Separating curve graph is not relatively hyperbolic for surfaces with genus ≥ 3 and one boundary component.
Algorithm morphs graphs on hyperbolic surfaces.
problem Morphing graphs on hyperbolic surfaces.
method Generalization of Tutte's spring embedding theorem.
result First algorithm for morphing graphs on hyperbolic surfaces.
EggNet reconstructs particle tracks from hits using evolving graph attention networks.
problem Particle track reconstruction is computationally expensive and combinatorial.
method EggNet uses a one-shot object condensation approach with evolving graph attention networks.
result EggNet outperforms methods requiring fixed input graphs on TrackML dataset.
HLoOP detects outliers in hyperbolic 2-space.
problem Detecting local outliers in hyperbolic 2-space.
method Combines nearest neighbor finding and probabilistic scoring in hyperbolic space.
result Promising results on WordNet dataset.
New interpretation of attention in Transformers and Graph Attention Networks.
problem Understanding and improving attention mechanisms in deep learning models.
method Decomposed attention into a kernel and a normalization term; generalized the kernel function and norm.
result Generalized attention leads to better performance on various tasks.
Graph Attention Networks predict disease state from single-cell data.
problem Predicting disease state from single-cell data.
method Graph Attention Networks (GAT) for learning from both features and graph structures.
result Achieved 92% accuracy in predicting MS from single-cell data.
Lipschitz normalization boosts deep attention models, especially for graph neural networks.
problem Gradient explosion in deep graph attention networks leads to poor performance.
method Enforcing Lipschitz continuity by normalizing attention scores.
result Deep GAT models with LipschitzNorm achieve state-of-the-art results for tasks with long-range dependencies.
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. …
Graph attention network improves MLTC by capturing label dependencies.
problem Ignoring label dependencies in MLTC tasks.
method Graph attention network model that captures label dependencies.
result The model achieves similar or better performance than state-of-the-art models.
Graph convolutional network (GCN) is generalization of convolutional neural network (CNN) to work with arbitrarily structured graphs. A binary adjacency matrix is commonly used in training a GCN. Recently, the attention mechanism allows the network to learn a dynamic and adaptive aggregation of the neighborhood. We pro…
Transformer learns graph structure better with subgraph info.
problem Transformer struggles with structural similarity in graph learning.
method Structure-Aware Transformer with subgraph attention.
result Improves graph prediction benchmarks significantly.
Can neural networks learn to compare graphs without feature engineering? In this paper, we show that it is possible to learn representations for graph similarity with neither domain knowledge nor supervision (i.e.\ feature engineering or labeled graphs). We propose Deep Divergence Graph Kernels, an unsupervised method …
GAT-AGNN learns stock trends using graph and attention mechanisms.
problem Predicting dynamic stock trends in a complex market.
method Sequential graph structure with attention mechanisms.
result GAT-AGNN outperforms state-of-the-art methods in stock trend prediction.
Hensel-Przytycki-Webb proved that all curve graphs of orientable surfaces are 17-hyperbolic. In this paper, we show that curve graphs of non-orientable surfaces are 17-hyperbolic by applying Hensel-Przytycki-Webb's argument. We also show that arc graphs of non-orientable surfaces are 7-hyperbolic, and arc-curve graphs …
Proposes a model for multi-agent reinforcement learning with hierarchical graph attention network.
problem Limited transferability of trained policies to new multi-agent tasks.
method Uses hierarchical graph attention network for representation learning and multi-agent actor-critic for policy learning.
result Demonstrates superior performance in mixed cooperative and competitive tasks compared to existing methods.