Graph scattering transforms are stable to metric perturbations of network topology.
problem Stability of graph data representations under metric perturbations.
method Extending scattering transforms to network data using multiresolution graph wavelets and graph convolutions.
result Graph scattering transforms are stable to metric perturbations of the underlying network topology.
We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained …
Unified graph scattering transforms improve theoretical properties of graph neural networks.
problem Improving theoretical guarantees for graph neural networks.
method Introducing windowed and non-windowed geometric scattering transforms for graphs.
result Unified family of graph scattering transforms with provable stability and invariance.
This thesis explores GNNs, categorizing them into local and global approaches.
problem Understanding the convergence of global GNNs and connecting local and global approaches.
method Categorization of GNNs into local and global, study of Invariant Graph Networks, connecting local and global approaches, and using local MPNN for graph coarsening.
result Established a connection between local and global GNN approaches.
Line graph transformation aids graph isomorphism tests by excluding challenging graph properties.
problem Limited theoretical understanding of line graph transformation's impact on GNN models.
method Examined CFI and strongly regular graphs, showing line graph transformation helps WL tests distinguish these graphs.
result Line graph transformation aids WL tests in distinguishing challenging graph properties.
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.
UGformer uses transformers to learn graph representations.
problem Graph representation learning for various tasks.
method UGformer is a transformer-based GNN model that samples or considers all neighbors for each node.
result UGformer achieves state-of-the-art accuracy on graph classification and text classification tasks.
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.
PAGTN improves molecular property prediction by leveraging longer-range graph dependencies.
problem Local aggregation in GCNs misses higher-order graph properties.
method PAGTN uses path features and global attention layers to capture longer-range dependencies.
result PAGTN outperforms GCNs on various molecular property prediction datasets.
HaarPooling compresses graphs by Haar transforms, improving graph classification and regression.
problem Handling graphs of varying size and structure in GNNs.
method HaarPooling, a cascade of clusterings and compressive Haar transforms.
result HaarPooling synthesizes graph features into uniform size, achieving state-of-the-art performance.
PatchGT uses non-trainable graph patches to improve graph representation learning.
problem Learning high-level information in graph tasks with direct Transformer models.
method PatchGT segments graphs into non-trainable patches, uses GNN for patch-level learning, and Transformer for graph-level learning.
result PatchGT achieves higher expressiveness and competitive performance on benchmark datasets.
Numerous pattern recognition applications can be formed as learning from graph-structured data, including social network, protein-interaction network, the world wide web data, knowledge graph, etc. While convolutional neural network (CNN) facilitates great advances in gridded image/video understanding tasks, very limit…
IsoGCNs learn invariant and equivariant graph features for efficient simulations.
problem Learning isometric transformation invariant and equivariant features in graphs for simulations.
method Transformation invariant and equivariant Graph Convolutional Networks (IsoGCNs).
result IsoGCNs outperform state-of-the-art methods on geometrical and physical simulation tasks.
GTNs learn new graph structures and improve node representation learning.
problem Learning node representations on misspecified or heterogeneous graphs.
method Graph Transformer Networks (GTNs) that generate new graph structures and learn effective node representations.
result GTNs achieve state-of-the-art performance in node classification tasks without predefined meta-paths.
CT improves neural network performance on cell complex data.
problem Improving predictive performance of neural networks on complex data.
method Introducing the Cellular Transformer (CT) that generalizes graph-based transformers to cell complexes.
result CT achieves state-of-the-art performance on cell complex datasets without complex enhancements.
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.
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.
Unified view of GNNs as graph signal denoising.
problem Understanding and improving GNNs for graph data.
method Established GNNs as graph denoising problems with smoothness assumptions.
result Unified framework UGNN for adaptive smoothness graphs.
Paper forecasts stock correlations using a hybrid model combining graph neural networks and transformers.
problem Improving stock correlation forecasts for better portfolio management.
method Hybrid model combining Transformer and graph attention networks for forecasting residual deviations from historical data.
result The hybrid model reduces correlation forecasting error compared to rolling-window estimates.
IGT learns graph representations without supervision.
problem Building deep unsupervised graph representations.
method Generic complex-valued spectral graph architecture from Fourier transform generalization, greedy concave objective for discriminative and invariant features.
result IGT learns both discriminative and invariant features from graph topology.
A new method detects financial fraud using graph transformers.
problem Detecting fraudulent transactions in financial data.
method Spatial-Temporal-Aware Graph Transformer (STA-GT) integrating GNNs and transformers.
result STA-GT outperforms general GNN models on financial fraud detection.
CaTs use DAGs with transformers to enforce causal constraints, improving neural network robustness.
problem Neural networks lack inherent causal structure respect, leading to reliability issues.
method Introducing Causal Transformers (CaTs) that operate under predefined causal constraints specified by DAGs.
result CaTs improve robustness and interpretability of neural networks under causal constraints.
This paper introduces Haar convolution for GNNs to reduce computational cost.
problem High computational cost in GNNs for large graph sizes.
method Introduces Haar basis for graph convolution and Fast Haar Transforms.
result State-of-the-art results on graph-based regression and node classification tasks.
Graph transformation framework improves graph neural network performance.
problem Data quality issues in graph neural networks.
method Test-time graph transformation framework (GTrans).
result Significant performance improvements (up to 3.8%) across various datasets.
TransGCN combines GCNs with transformation assumptions for better link prediction in KGs.
problem Link prediction in knowledge graphs for understanding graph structure.
method Unified GCN framework with simultaneous learning of entity and relation embeddings, using transformation assumptions.
result TransGCN outperforms state-of-the-art models on FB15K-237 and WN18RR.
The study finds conditions for compressing the hidden dimension of Graph Transformers for transductive learning.
problem The challenge of efficiently analyzing and training Graph Transformers for transductive learning.
method Theoretical bounds on hidden dimension compression for Graph Transformers, considering both sparse and dense variants.
result Theoretical findings on how and under what conditions the hidden dimension of Graph Transformers can be compressed.
Characterizes Bayesian networks up to unconditional equivalence.
problem Characterizing Bayesian networks up to unconditional equivalence.
method Transformational characterization via undirected graphs and specified moves.
result Two DAGs are in the same UEC if and only if one can be transformed into the other via a finite sequence of moves.
A new GNN module learns geometric scattering features for better graph classification and feature exploration.
problem Learning long-range graph relations and extracting meaningful features from graphs.
method Proposes a learnable geometric scattering (LEGS) module in graph neural networks (GNNs), incorporating wavelet filters.
result LEGS-based GNNs outperform existing methods in graph classification and feature extraction tasks.
Spectral embedding improves with edge weight transformations.
problem Improving spectral embedding for weighted networks.
method Analyzed edge weight transformations for spectral embedding quality.
result Transformations like tempering or thresholding can significantly enhance spectral embedding.
Transformer adapts to graphs with adaptive attention and auto-regressive decoding.
problem Transformers struggle with graph data due to non-sequential nature.
method Proposes GRAT, a Transformer variant with adaptive attention and auto-regressive decoding.
result GRAT achieves state-of-the-art performance on molecule property predictions and generation tasks.
Neural networks' feature geometry evolves like discrete Ricci flow.
problem Understanding neural feature representations and their geometric transformations.
method Approximating input manifold with geometric graphs and analyzing their evolution during training.
result Neural feature geometry evolves like discrete Ricci flow, with nonlinear activations playing a crucial role.
HGT models heterogeneous graphs with dedicated node and edge representations.
problem Infeasibility of existing GNNs for heterogeneous graphs.
method Node- and edge-type dependent parameters, relative temporal encoding, heterogeneous mini-batch graph sampling.
result HGT outperforms state-of-the-art GNNs by 9%--21% on various downstream tasks.
This study applies EMD to MSCI World index and converts IMFs into graphs for GNN modeling.
problem Modeling financial time series with GNNs.
method EMD, CEEMDAN, graph transformations (natural visibility, horizontal visibility, recurrence, transition graphs), topological analysis.
result High-frequency IMFs yield dense, highly connected small-world graphs; low-frequency IMFs produce sparser networks.
Quantum computing improves graph neural network aggregation.
problem Limitations of classical GNNs in processing global graph features.
method Quantum computer-generated aggregation weights for graph neural networks.
result Quantum-enhanced GNN performs similarly to classical models on standard datasets.
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…
Proposes a THGNN for dynamic financial time series prediction.
problem Challenges in predicting stock market price movements.
method Temporal and heterogeneous graph neural network (THGNN) approach.
result Significantly improved prediction performance compared to state-of-the-art methods.
New method improves graph representations against adversarial attacks.
problem Adversarial robustness in graph contrastive learning.
method Adversarial and edge insertion transformations.
result Promising results in preliminary experiments.
IGNN improves GNNs by maximizing edge-state transform mutual information.
problem Optimizing GNNs for better relational information.
method Variational information maximization to learn optimal transform parameters.
result IGNN achieves state-of-the-art performance on molecular graph tasks.
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.
RR-GCN uses random transformations instead of learned weights for node embeddings.
problem Learning node embeddings in KGs.
method Random Relational Graph Convolutional Network (RR-GCN) with untrained parameters.
result RR-GCN can compete with fully trained R-GCNs in node classification and link prediction.
Model learns molecular structures from graphs without explicit rules.
problem Learning molecular structures from graphs without explicit rules.
method Adapted Transformer model for undirected molecular graphs.
result Transformer model can learn complex molecular structures.
MetaTNE tackles few-shot novel labels in graphs, improving node classification.
problem Node classification on graphs with novel labels and limited training data.
method MetaTNE framework with structural, meta-learning, and optimization modules.
result MetaTNE significantly improves node classification over state-of-the-art methods.
We explore the generalization of scattering transforms from traditional (e.g., image or audio) signals to graph data, analogous to the generalization of ConvNets in geometric deep learning, and the utility of extracted graph features in graph data analysis. In particular, we focus on the capacity of these features to r…
TK-GCN forecasts spatiotemporal dynamics using Koopman-enhanced graph convolutional networks.
problem Forecasting complex spatiotemporal dynamics over irregular domains.
method Two-stage framework: Koopman-enhanced Graph Convolutional Network (K-GCN) for spatial encoding and Transformer for temporal modeling.
result TK-GCN outperforms state-of-the-art methods in spatiotemporal cardiac dynamics forecasting.
Framework predicts Navier-Stokes solutions on 2D domains using graph neural networks.
problem Predicting stationary Navier-Stokes solutions in non-parametrized 2D geometries.
method Graph-based multi-fidelity learning framework combining reduced-order models, Transformers, and Mamba architectures.
result Mamba architecture reduces computational cost while maintaining performance.
Unified geometric scattering model for measure spaces.
problem Improving CNNs for non-Euclidean data.
method Unified geometric scattering model for measure spaces.
result Unified model includes previous work and applies to more general settings.
ZSL-KG learns class representations from common sense knowledge graphs.
problem Predicting classes without labeled examples using semantic class representations.
method TrGCN, a novel transformer graph convolutional network, embeds nodes from common sense knowledge graphs in a vector space.
result ZSL-KG improves over existing methods on five out of six zero-shot benchmark datasets.
ConfFlow uses transformer networks to generate molecular conformations efficiently.
problem Efficient generation of valid conformations for large molecules.
method Flow-based model using transformer networks that directly samples in coordinate space.
result ConfFlow improves accuracy by up to 40% for large molecule conformations.