Tensor-aware graph neural networks preserving spatial node feature layouts
Project description
TGraphX
๐ Preprint: TGraphX: Tensor-Aware Graph Neural Network for Multi-Dimensional Feature Learning ยท Sajjadi & Eramian, arXiv 2025
TGraphX is a PyTorch library for graph neural networks whose node features are multi-dimensional tensors โ such as [C, H, W] image-patch feature maps โ rather than flat vectors. Convolutional message passing operates directly on spatial feature maps at each node, so local structure is never destroyed by flattening.
The problem TGraphX solves
Standard GNN frameworks (PyG, DGL) expect flat vector node features. Flattening a [C, H, W] feature map into a [CยทHยทW] vector discards the spatial structure that makes CNNs effective. TGraphX keeps each node's representation as a tensor and applies 1ร1 convolutions during message passing, so every neighbourhood aggregation step acts like a miniature CNN across neighbouring feature maps.
What is currently implemented
All "tensor-aware" GNN layers in this list operate on spatial node feature
maps [N, C, H, W] and preserve the spatial layout through message
passing. They are adaptations of the canonical algorithms โ not
drop-in clones of PyTorch Geometric's vector-feature implementations.
| Component | Class | Input node shape | Notes |
|---|---|---|---|
| Graph data structure | Graph, GraphBatch |
any | Validated; .to(device) |
| Tensor-aware GCN-style message passing | ConvMessagePassing |
[N, C, H, W] |
aggr="sum" or "mean"; 1ร1 conv messages + deep CNN aggregator |
| Tensor-aware GAT (multi-head) | TensorGATLayer |
[N, C, H, W] |
True GAT: softmax over incoming edges per destination, per head; scalar attention per (edge, head) |
| Tensor-aware GraphSAGE | TensorGraphSAGELayer |
[N, C, H, W] |
Separate self / neighbour 1ร1 Conv2d; mean or max aggregation; optional L2 normalise |
| Tensor-aware GIN / GINEConv | TensorGINLayer |
[N, C, H, W] |
(1+ฮต)ยทh_j + ฮฃ h_i; default 1ร1 Conv MLP, learnable ฮต, optional GINEConv edge term |
| Spatial-gating message passing (legacy) | AttentionMessagePassing |
[N, C, H, W] or [N, D] |
Per-edge sigmoid gating โ not GAT. Kept for backward compatibility; use TensorGATLayer for true GAT. |
| Vector message passing | LinearMessagePassing |
[N, D] |
Base layer with linear projections |
| Custom layer base class | TensorMessagePassingLayer |
any | Override message / update; base handles aggregation |
| CNN patch encoder | CNNEncoder |
[N, C_in, pH, pW] |
Outputs spatial feature maps [N, C_out, H', W'] |
| Optional pre-encoder | PreEncoder |
[N, C_in, pH, pW] |
Custom or pretrained ResNet-18 |
| Unified CNN-GNN model | CNN_GNN_Model |
[N, C, pH, pW] |
Takes pre-split patches; user supplies edge_index |
| Graph classification | GraphClassifier |
[N, C, H, W] |
Mean / sum / max readout |
| Node classification | NodeClassifier |
[N, D] |
Vector features only |
| Dataset & loader | GraphDataset, GraphDataLoader |
โ | Wraps torch.utils.data |
| Utilities | load_config, get_device |
โ | YAML/JSON config; CUDAโMPSโCPU |
What is NOT yet implemented
- Graph Transformers (global attention with positional encodings).
- Per-channel and per-pixel attention for
TensorGATLayer. Currently only scalar attention per(edge, head)is supported (the default safer choice). - Spatial edge features in
TensorGATLayerare accepted as[E, edge_dim, H, W]and mean-pooled to a vector before the per-(edge, head)attention bias projection. This keeps GAT in the scalar-attention regime (no per-pixel attention).TensorGraphSAGELayerandTensorGINLayeruse the full spatial tensor directly (selected viaedge_features_kind="spatial"). - Per-voxel and per-pixel attention.
TensorGATLayerkeeps scalar attention per(edge, head)even in 3-D mode. Volumetric edge tensors[E, C_e, D, H, W]are mean-pooled over(D, H, W)before the bias projection โ there is no per-voxel attention. - Arbitrary-rank tensor support. TGraphX supports vector
[N, D], 2-D spatial[N, C, H, W], and 3-D volumetric[N, C, D, H, W]node features for the listed layers. It does not claim arbitrary-rank tensor support. - Heterogeneous and temporal graphs.
- MLflowLogger. Not implemented. Use the
mlflowclient directly.pip install mlflow. - GAT / SAGE / GIN chunked forward. Deferred (GAT's destination-wise
softmax requires all edge scores; SAGE/GIN chunking deferred for scope).
ConvMessagePassingsupportschunk_sizeforsum/meanaggregation. - Hardware-monitoring extras. CPU/RAM/GPU metrics in the dashboard
require optional packages:
pip install tgraphx[monitoring]. - torch.compile / AMP.
torch.compileis available in PyTorch โฅ 2.0 and may improve throughput for large graphs; compile overhead dominates for small ones. Some GNN ops (e.g.index_add_in GAT) require matching dtypes and do not work transparently under float16 autocast; bfloat16 or full-precision inference is recommended. - Profiling / logging. No profiling, hardware polling, or file writes are enabled by default. All are opt-in.
Performance
Environment and hardware report
from tgraphx.performance import env_report, estimate_message_memory, recommended_device
print(env_report()) # Python/PyTorch/CUDA/MPS info
print(env_report(include_hardware=True)) # + CPU/RAM/CUDA memory (needs psutil)
print(env_report(include_sensors=True)) # + GPU util/temp (needs pynvml)
dev = recommended_device() # CUDA > MPS > CPU
# Estimate peak message-buffer memory before running
m = estimate_message_memory(num_edges=1024, out_shape=(64, 8, 8))
print(f"~{m['total_mb']:.1f} MB ({m['note']})")
Benchmarks
# Layer throughput (CPU-safe, all flags optional)
python benchmarks/benchmark_layers.py --layer gat --nodes 64 --edges 256 \
--shape 8,4,4 --device cpu --iters 10
# CUDA + AMP + backward
python benchmarks/benchmark_layers.py --layer conv --nodes 256 --edges 2048 \
--shape 32,8,8 --device cuda --amp 1 --backward 1
# Save JSON result
python benchmarks/benchmark_layers.py --layer gin --shape 8,4,4 \
--output results/gin.json
# Graph builder timing
python benchmarks/benchmark_graph_builders.py --small # CI-safe
python benchmarks/benchmark_graph_builders.py # full
torch.compile and AMP
python examples/torch_compile_benchmark.py # eager vs compiled, correctness check
python examples/mixed_precision_inference.py # autocast forward demo
python examples/memory_report.py # env report + memory estimates
Optional chunked forward (ConvMessagePassing)
Reduce peak edge-buffer memory by processing edges in chunks:
from tgraphx.layers.conv_message import ConvMessagePassing
layer = ConvMessagePassing(in_shape=(32, 8, 8), out_shape=(32, 8, 8), aggr="sum")
# Same output as unchunked; lower peak memory for large E
out = layer(x, edge_index, chunk_size=512)
Supported aggregations: "sum" and "mean". "max" falls back to the
standard path with a warning. GAT, SAGE, and GIN chunking are deferred
(softmax and custom scatter make them more complex).
Hardware compatibility
| Platform | Forward | AMP | torch.compile | Notes |
|---|---|---|---|---|
| CPU | โ | โ ๏ธ bfloat16 only | โ | Compile overhead may dominate small graphs |
| CUDA | โ | โ ๏ธ float16 (op-dependent) | โ | index_add_ ops require dtype match |
| MPS (Apple Silicon) | โ | limited | โ ๏ธ | Some ops may not be compiled |
| Linux | โ | โ | โ | Fully supported |
| Windows | โ | โ | โ | Fully supported |
| macOS | โ | limited | โ ๏ธ | MPS support best-effort |
Training utilities
TGraphX includes lightweight training helpers โ not a full training framework. All logging and file writes are off by default.
Training loop helpers
from tgraphx.training import train_epoch, evaluate, fit
import torch.nn.functional as F
# One-line training loop
history = fit(
model, train_loader, val_loader=val_loader,
epochs=20,
optimizer=torch.optim.Adam(model.parameters(), lr=1e-3),
loss_fn=F.cross_entropy,
log_level=1, # print per-epoch summary
)
# โ [{"epoch":0, "train_loss":0.9, "val_loss":0.85}, ...]
Supported batch formats: GraphBatch (with graph_labels / node_labels)
and (Tensor, Tensor) tuples.
Standalone helpers
from tgraphx.training import (
set_seed, # seeds torch / numpy / random
count_parameters, # trainable parameter count
save_checkpoint, # torch.save wrapper
load_checkpoint, # returns saved epoch number
accuracy, # multi-class argmax accuracy
mean_absolute_error, mean_squared_error,
)
CSV logging (dashboard-compatible)
from tgraphx.tracking import CSVLogger
with CSVLogger("runs/my_run") as logger:
history = fit(model, train_loader, ..., logger=logger)
# writes runs/my_run/metrics.csv with UTC timestamps
TensorBoard logging (optional)
from tgraphx.tracking import TensorBoardLogger # lazy import
# pip install tensorboard or pip install "tgraphx[tracking]"
with TensorBoardLogger("runs/tb") as tb:
history = fit(model, train_loader, ..., logger=tb)
Nothing is written unless you explicitly pass a logger.
MLflowLogger is not implemented โ use the mlflow client directly.
Dashboard
TGraphX includes a local training dashboard โ off by default, zero external dependencies.
Quick start
# 1. Run a training script that writes metrics.csv and optionally run_metadata.json
python examples/training_with_dashboard.py
# 2. Launch the dashboard (localhost only)
tgraphx-dashboard --logdir runs/demo
# โ http://127.0.0.1:8765
# Python API โ non-blocking background thread (use during training)
from tgraphx.dashboard import launch_dashboard_background
server = launch_dashboard_background("runs/demo", port=8765)
# ... training loop ...
server.shutdown()
LAN / multi-device access
# Requires an explicit token โ refused without one
tgraphx-dashboard --logdir runs/demo \
--host 0.0.0.0 --port 8765 --token MY_SECRET_TOKEN
Each browser displays times in its own local timezone (UTC is stored, JS converts).
Dashboard features
| Section | Contents |
|---|---|
| Overview | Status chip, epoch progress, live loss, elapsed / ETA, device |
| Metrics | SVG line charts for every logged column; optional EMA smoothing |
| Graph | Graph summary, degree distribution, SVG preview for small graphs |
| Hardware | CPU/RAM/GPU/MPS stats (requires optional psutil / pynvml) |
| Logs | Last 50 metric rows as a table |
| Config | run_metadata.json as formatted JSON |
| TV mode | Full-screen large-font view for passive monitoring |
Logging format
Write metrics.csv with a header row; all columns are auto-detected:
epoch,step,train_loss,val_loss,accuracy,learning_rate,timestamp
1,50,0.82,0.91,0.56,0.001,2025-01-01T12:00:00Z
Timestamps in ISO-8601 UTC are displayed in the viewer's local timezone.
Optional run_metadata.json (free-form dict) and graph_metadata.json:
{
"num_nodes": 9, "num_edges": 33, "directed": false,
"builder": "build_grid_graph", "builder_params": {"rows": 3, "cols": 3},
"degree_stats": {"mean": 3.6, "min": 2, "max": 4},
"edge_index": [[...], [...]]
}
Graph visualization limits
- Full SVG preview: โค 200 nodes and โค 1 000 edges (send
edge_indexin JSON). - Larger graphs: summary + degree histogram only (edge_index stripped automatically).
- Grid graphs: 2-D grid layout rendered from
builder_params; noedge_indexneeded. - 3-D grids: rendered as depth-slice panels.
- Never writes large
edge_indexfiles silently โ opt-in by including it ingraph_metadata.json.
Security model
| Scenario | Token required? |
|---|---|
--host 127.0.0.1 (default) |
No |
--host 0.0.0.0 + connecting from localhost |
No |
--host 0.0.0.0 + connecting from another device |
Yes |
Starting LAN mode without --token |
Refused at startup |
The dashboard is read-only, serves no external assets, and restricts all file access to --logdir.
Hardware monitoring (optional)
pip install psutil # CPU %, RAM %, process memory
pip install pynvml # NVIDIA GPU util, temperature, VRAM
Missing packages are gracefully hidden โ no broken charts.
Privacy and local-first behavior
TGraphX is designed to be entirely local and private:
| Behavior | Default |
|---|---|
| Telemetry / analytics | None โ never |
| Remote calls at import | None |
| Dashboard | Off โ launch explicitly |
| CSV metric logging | Off โ create CSVLogger explicitly |
| TensorBoard logging | Off โ create TensorBoardLogger explicitly |
| Hardware monitoring | Off โ pass include_hardware=True to env_report |
| Checkpoints | Off โ call save_checkpoint explicitly |
| Graph serialization | Off โ include edge_index in JSON manually |
| Background threads | None (unless launch_dashboard_background is called) |
| File writes | Only to paths you explicitly provide |
| Reads | Dashboard reads only inside --logdir |
| External CDN / assets | None โ dashboard is fully self-contained |
No ~/.tgraphx directory or user-level config is created by default.
Installation
TGraphX is not yet published as a stable release on PyPI. Install from source:
git clone https://github.com/arashsajjadi/TGraphX.git
cd TGraphX
pip install -e .
Runtime dependencies are installed automatically:
torch>=1.13
torchvision>=0.14
pyyaml>=5.4
For a specific PyTorch build (e.g., CPU-only or a particular CUDA version), install PyTorch first and then install TGraphX:
# Example: CPU-only
pip install torch torchvision --index-url https://download.pytorch.org/whl/cpu
pip install -e .
See pytorch.org for GPU-specific install commands. A Conda environment file is provided in environment.yml.
Quickstart
import torch
from tgraphx import Graph
from tgraphx.layers import ConvMessagePassing
# 6 nodes, each a 16-channel 8ร8 feature map
N, C, H, W = 6, 16, 8, 8
node_features = torch.randn(N, C, H, W)
# Directed cycle: 0โ1โ2โ3โ4โ5โ0
src = torch.arange(N)
edge_index = torch.stack([src, (src + 1) % N]) # [2, N]
g = Graph(node_features, edge_index) # validates inputs
layer = ConvMessagePassing(
in_shape=(C, H, W), # per-node input shape
out_shape=(32, H, W), # H and W are preserved; channels expand to 32
)
out = layer(g.node_features, g.edge_index) # [6, 32, 8, 8]
print(out.shape)
out.sum().backward() # all learned stages are differentiable
Graph Builders
TGraphX ships pure-PyTorch graph builders that return edge_index
tensors ([2, E], dtype=torch.long) ready for any GNN layer or
Graph constructor. They create fixed, rule-based adjacency
structures โ they do not implement learned adjacency.
Builder API
| Function | Description | Key params |
|---|---|---|
build_grid_graph(rows, cols) |
2-D 4-connected grid | directed, self_loops |
build_grid_graph_3d(depth, rows, cols) |
3-D 6-connected grid | directed, self_loops |
build_fully_connected_graph(num_nodes) |
Complete graph | self_loops |
build_knn_graph(coords, k) |
k-nearest-neighbour | directed, self_loops |
build_radius_graph(coords, radius) |
All pairs within radius | directed, self_loops |
build_iou_graph(boxes, threshold) |
Bounding-box IoU โฅ threshold | directed, self_loops |
build_random_graph(num_nodes, num_edges) |
Uniform random sample | directed, self_loops, seed |
O(Nยฒ) warning:
build_knn_graphandbuild_radius_graphcalltorch.cdistinternally, which requires O(Nยฒ) time and memory. For large graphs (N > 10 000), use approximate-NN libraries instead.O(Nยฒ) warning:
build_fully_connected_graphemits Nยท(Nโ1) edges. Memory grows quadratically with node count.
Grid graph quickstart
import torch
from tgraphx import Graph, build_grid_graph
from tgraphx.layers.conv_message import ConvMessagePassing
# 3ร3 patch grid โ 9 nodes, each with a [4, 8, 8] spatial feature
node_features = torch.randn(9, 4, 8, 8)
edge_index = build_grid_graph(3, 3, directed=False, self_loops=True)
# edge_index: [2, 33] (24 neighbour + 9 self-loop edges)
g = Graph(node_features, edge_index)
layer = ConvMessagePassing(in_shape=(4, 8, 8), out_shape=(8, 8, 8))
out = layer(g.node_features, g.edge_index) # [9, 8, 8, 8]
2-D image patch graph
import torch
from tgraphx import build_grid_graph, image_to_patches
from tgraphx.layers.gat import TensorGATLayer
# Extract 4ร4 patches from a [B, C, H, W] image
images = torch.randn(2, 3, 8, 8)
patches = image_to_patches(images, patch_size=4) # [2, 4, 3, 4, 4]
# Build the patch grid graph
edge_index = build_grid_graph(2, 2, directed=False, self_loops=True)
# Run GAT on one image's patches
x = patches[0] # [4, 3, 4, 4]
gat = TensorGATLayer(in_channels=3, out_channels=8, num_heads=2, spatial_rank=2)
out = gat(x, edge_index) # [4, 8, 4, 4]
3-D volume patch graph
import torch
from tgraphx import build_grid_graph_3d, volume_to_patches
from tgraphx.layers.gat import TensorGATLayer
# Extract 4ร4ร4 patches from a [B, C, D, H, W] volume
volumes = torch.randn(1, 2, 8, 8, 8)
patches = volume_to_patches(volumes, patch_size=4) # [1, 8, 2, 4, 4, 4]
# Build the 3-D patch grid graph
edge_index = build_grid_graph_3d(2, 2, 2, directed=False, self_loops=True)
# Run GAT on one volume's patches
x = patches[0] # [8, 2, 4, 4, 4]
gat = TensorGATLayer(in_channels=2, out_channels=4, num_heads=2, spatial_rank=3)
out = gat(x, edge_index) # [8, 4, 4, 4, 4]
Patch helper API
| Function | Input | Output | Notes |
|---|---|---|---|
patch_grid_shape(H, W, patch_size, stride) |
โ | (n_h, n_w) |
Raises if not exactly covered |
image_to_patches(images, patch_size, stride) |
[B, C, H, W] |
[B, P, C, ph, pw] |
Row-major; matches grid node order |
volume_patch_grid_shape(D, H, W, patch_size, stride) |
โ | (n_d, n_h, n_w) |
Raises if not exactly covered |
volume_to_patches(volumes, patch_size, stride) |
[B, C, D, H, W] |
[B, P, C, pd, ph, pw] |
Depth-row-col order; matches 3-D grid |
Concept: tensor-aware node features
In a standard GNN a node carries a vector x_i โ โ^d. In TGraphX a node carries a tensor X_i โ โ^{CรHรW}. Every layer follows the standard message-passing template:
M_{iโj} = ฯ( X_i, X_j, E_{iโj} ) # per-edge messages
A_j = AGG_{i โ N(j)} M_{iโj} # permutation-invariant aggregation
X'_j = ฯ( X_j, A_j ) # update
Each layer instantiates this with its own (ฯ, AGG, ฯ):
| Layer | ฯ (message) |
AGG |
ฯ (update) |
|---|---|---|---|
ConvMessagePassing |
Conv1ร1(Concat(X_i, X_j[, E_ij])) |
sum / mean / max |
DeepCNNAggregator(A_j) (+ optional residual) |
TensorGATLayer |
ฮฑ_{ij}^k ยท W^k X_i with ฮฑ_{ij}^k = softmax_i(LeakyReLU(a_dstยทpool(W^k X_j) + a_srcยทpool(W^k X_i) + b^k(e_ij))) |
sum (weighted) | concat or mean over heads, optional residual |
TensorGraphSAGELayer |
W_neigh(X_i) (+ optional spatial cat or vector bias from e_ij) |
mean / max |
W_self(X_j) + AGG, optional L2 normalise |
TensorGINLayer |
X_i or ReLU(X_i + ฯ_e(e_ij)) (GINEConv) |
sum |
MLP((1+ฮต)ยทX_j + ฮฃ_i M_ij) |
LinearMessagePassing |
Linear(Concat(x_i, x_j[, e_ij])) |
sum / mean / max |
identity (override to customise) |
Spatial dimensions H and W are preserved through every learned transform. All aggregations are permutation-invariant over the order of incoming edges, and every layer is permutation-equivariant over node reindexing (verified by tests/test_math.py).
The graph structure โ which nodes are connected โ is not learned by the model. Users supply edge_index based on domain knowledge (e.g., spatial proximity of patches, IoU overlap of bounding boxes, kNN on patch centres).
Edge feature formats per layer
| Layer | Vector [E, D_e] |
Spatial [E, C_e, H, W] |
|---|---|---|
ConvMessagePassing |
โ | โ (concatenated along channels) |
TensorGATLayer |
โ (additive attention bias on logits) | โ |
TensorGraphSAGELayer |
โ (additive channel bias post-W_neigh) |
โ (concatenated to source) |
TensorGINLayer |
โ (broadcast bias before ReLU) | โ (1ร1 Conv2d projection) |
Factory API
make_layer โ create any layer by name
from tgraphx import make_layer
# 2-D spatial GAT with 2 attention heads
layer = make_layer("gat", in_shape=(8, 4, 4), out_shape=(16, 4, 4), heads=2, residual=True)
# Vector linear message passing
layer = make_layer("linear", in_shape=(32,), out_shape=(64,), aggr="mean")
| Name | Layer class | Shape support |
|---|---|---|
"conv" |
ConvMessagePassing |
2-D / 3-D spatial |
"gat" |
TensorGATLayer |
2-D / 3-D spatial |
"sage" |
TensorGraphSAGELayer |
2-D / 3-D spatial |
"gin" |
TensorGINLayer |
2-D / 3-D spatial |
"linear" |
LinearMessagePassing |
vector only |
"legacy_attention" |
AttentionMessagePassing |
vector / 2-D spatial |
build_model โ complete task model
from tgraphx import build_model
# Node classification on vector features
model = build_model(
task="node_classification",
layer="linear",
in_shape=(32,),
hidden_shape=(64,),
num_layers=3,
num_classes=5,
)
out = model(x, edge_index) # [N, 5]
# Graph classification on 2-D image patches
model = build_model(
task="graph_classification",
layer="gat",
in_shape=(3, 4, 4), # [C, ph, pw]
hidden_shape=(8, 4, 4),
num_layers=2,
num_classes=10,
heads=2,
pooling="mean",
)
out = model(x, edge_index, batch=batch) # [G, 10]
Task support matrix
| Task | Vector [N,D] |
2-D spatial [N,C,H,W] |
3-D volumetric [N,C,D,H,W] |
|---|---|---|---|
node_classification |
โ | โ | โ |
node_regression |
โ | โ | โ |
graph_classification |
โ | โ | โ |
graph_regression |
โ | โ | โ |
edge_prediction |
โ | โ (spatial pool) | โ (spatial pool) |
link_prediction |
deferred | deferred | deferred |
Spatial / volumetric tasks: after the GNN stack the factory applies global spatial average-pooling to flatten
[N, C, *spatial]โ[N, C]before the linear head. Spatial resolution is preserved inside every GNN layer and only collapsed at the final readout.
build_model_from_config โ config-driven construction
from tgraphx import build_model_from_config
# From a Python dict (no eval, no exec)
config = {
"model": {
"task": "graph_classification",
"layer": "gat",
"in_shape": [8, 4, 4],
"hidden_shape": [16, 4, 4],
"num_layers": 2,
"num_classes": 3,
"heads": 2,
"residual": True,
"dropout": 0.1,
}
}
model = build_model_from_config(config)
# From a JSON file
model = build_model_from_config("config.json")
# From a YAML file (requires PyYAML)
model = build_model_from_config("config.yaml")
Examples
# Tensor-aware GCN-style spatial message passing
python examples/minimal_spatial_message_passing.py
# Graph classification โ short training loop with synthetic data
python examples/minimal_graph_classifier.py
# Tensor-aware multi-head GAT (verifies that attention weights sum to 1
# per destination per head)
python examples/tensor_gat_minimal.py
# Tensor-aware GraphSAGE (mean / max / with-edge-features variants)
python examples/tensor_graphsage_minimal.py
# Custom user-defined message-passing layer subclass
python examples/custom_message_passing.py
# Trainability sanity: tiny overfit on a relational synthetic task with GAT
python examples/tiny_overfit_tensor_gat.py
# Edge-feature dependency: GAT/GIN/SAGE with vector edge features
python examples/tiny_overfit_edge_features.py
# Deep 8-layer stack gradient sanity for every GNN family
python examples/gradient_sanity_stack.py
# Graph builder directedness and self-loop demo
python examples/directed_vs_undirected_graphs.py
# 2-D image โ patch โ GNN (ConvMP + GAT)
python examples/image_patch_graph.py
# 3-D volume โ patch โ GNN (ConvMP + GAT)
python examples/volume_patch_graph.py
# All four GNN families on a 2-D and 3-D grid graph
python examples/gnn_family_with_graph_builders.py
# Factory examples (graph builders + model factories)
python examples/01_vector_node_classification.py
python examples/02_spatial_graph_classification.py
python examples/03_volumetric_graph_classification.py
python examples/04_config_based_model.py
python examples/05_edge_prediction.py
API reference
Graph
from tgraphx import Graph
g = Graph(
node_features, # torch.Tensor [N, ...] required
edge_index=None, # torch.LongTensor [2, E] or None optional
edge_weight=None, # torch.Tensor [E] optional
edge_features=None, # torch.Tensor [E, ...] optional
node_labels=None, # torch.Tensor [N, ...] optional
edge_labels=None, # torch.Tensor [E, ...] optional
graph_label=None, # torch.Tensor (any shape) optional
metadata=None, # dict optional
)
g.clone() # deep copy (tensors and metadata)
g.to("cuda", dtype=torch.float32) # moves all tensor fields; dtype only
# applies to floating-point tensors
g.cpu(); g.cuda() # convenience aliases
g.add_self_loops(); g.remove_self_loops()
g.make_undirected(reduce="mean") # symmetrize, coalesce duplicates
g.is_undirected() # structural check (ignores weights)
g.validate() # re-run validation after manual mutation
g.num_nodes, g.num_edges, g.feature_shape, g.edge_feature_shape
g.has_edges, g.has_edge_weight, g.has_edge_features
Supported per-node feature layouts: [N, D], [N, C, H, W], and storage-level
[N, C, D, H, W]. Edge features mirror this: [E, D_e], [E, C_e, H, W], and
storage-level [E, C_e, D, H, W].
Graph.__init__ raises immediately on:
- non-Tensor inputs
node_featuresoredge_featureswith fewer than 2 dimensionsedge_indexwith wrong shape, wrong dtype (torch.longrequired), or out-of-range indicesedge_weightthat is not 1-D, or whose length differs fromE- per-edge tensors (
edge_weight/edge_features/edge_labels) supplied without anedge_index - device mismatch between
node_featuresand any other tensor field - length mismatch between
node_features/edge_indexand any per-node / per-edge tensor
GraphBatch
from tgraphx import GraphBatch
batch = GraphBatch([g1, g2, g3])
# batch.node_features [N_total, ...]
# batch.edge_index [2, E_total] โ indices offset per graph
# batch.edge_weight [E_total] โ concatenated if every graph has it
# batch.edge_features [E_total, ...] โ concatenated if every graph has it
# batch.node_labels [N_total, ...] โ concatenated if every graph has it
# batch.edge_labels [E_total, ...] โ concatenated if every graph has it
# batch.graph_labels [B, ...] โ stacked if every graph has it
# batch.metadata list[Any] โ verbatim, length B (None entries OK)
# batch.batch [N_total] โ graph membership (dtype=long)
batch.to("cuda")
All graphs must share the same per-node feature shape (and per-edge feature
shape, when present). Passing graphs with different spatial sizes raises a
ValueError with a descriptive message. Optional per-edge tensors must be
present on every graph that has edges, or none โ mixing-some-with-none is
rejected so per-edge data is never silently dropped.
ConvMessagePassing
from tgraphx.layers import ConvMessagePassing
layer = ConvMessagePassing(
in_shape=(C, H, W), # tuple: per-node input shape (spatial only)
out_shape=(C_out, H, W), # H and W must stay equal to in_shape's H, W
aggr="sum", # "sum" (default) | "mean"
use_edge_features=False, # set True to concatenate edge tensors into messages
aggregator_params=None, # dict forwarded to DeepCNNAggregator; e.g.
# {"num_layers": 2, "dropout_prob": 0.1}
residual=False, # add skip connection when in_shape == out_shape
)
out = layer(node_features, edge_index) # [N, C_out, H, W]
out = layer(node_features, edge_index, edge_features) # with edge features
aggr="max"raisesNotImplementedError. UseGraphClassifier(pooling="max")for graph-level max readout.
AttentionMessagePassing
from tgraphx.layers import AttentionMessagePassing
# Spatial path
layer = AttentionMessagePassing(in_shape=(C, H, W), out_shape=(C_out, H, W))
# Vector path (also supported)
layer = AttentionMessagePassing(in_shape=(D,), out_shape=(D_out,))
out = layer(node_features, edge_index) # [N, C_out, H, W] or [N, D_out]
Important: This layer computes attn = sigmoid(qยทk / โd) independently per edge. Attention weights are not normalised over each destination node's neighbourhood (no softmax). This differs from standard GAT. For true GAT, use TensorGATLayer below.
TensorGATLayer (true multi-head GAT)
True GAT-style attention adapted to spatial features. For every destination
node j and every head k, attention weights satisfy ฮฃ_i ฮฑ_ij^k = 1.
from tgraphx.layers import TensorGATLayer
# 4 heads ร 8 channels each = 32 output channels (heads concatenated)
layer = TensorGATLayer(
in_channels=16,
out_channels=32, # divisible by num_heads when concat_heads=True
num_heads=4,
concat_heads=True, # False โ average heads, output is per-head channels
negative_slope=0.2, # LeakyReLU before edge softmax
attn_dropout=0.0, # dropout on attention weights (training only)
residual=True, # auto 1ร1 projection if in/out channels differ
bias=True,
add_self_loops=False, # True ensures every node has at least 1 in-edge
use_edge_features=False, # set True to enable EGAT-style vector edge bias
edge_dim=None, # required when use_edge_features=True
)
out = layer(x, edge_index) # [N, 32, H, W]
# Inspect attention weights (e.g. for visualisation or testing):
out, attn = layer(x, edge_index, return_attention=True)
# attn shape: [E, num_heads]; sums to 1 over incoming edges per destination per head.
# EGAT-style vector edge attention bias (e.g. relative box coords, IoU,
# distances, scale ratio):
layer_e = TensorGATLayer(
in_channels=16, out_channels=32, num_heads=4,
use_edge_features=True, edge_dim=3,
)
out = layer_e(x, edge_index, edge_features=ef) # ef: [E, 3]
Attention is scalar per (edge, head) in this implementation: the
projected query and key feature maps are mean-pooled over H ร W before
being scored, while the value tensors keep their full spatial layout
during aggregation. Per-pixel and per-channel attention modes are not yet
supported. Spatial edge feature tensors are not supported by this
layer โ use TensorGraphSAGELayer or TensorGINLayer for those.
TensorGraphSAGELayer
Tensor-aware GraphSAGE: h_j' = W_self(h_j) + W_neigh(AGG_i h_i).
from tgraphx.layers import TensorGraphSAGELayer
layer = TensorGraphSAGELayer(
in_channels=16,
out_channels=32,
aggr="mean", # "mean" or "max"
normalize=False, # True โ L2-normalise output channel vector per pixel
bias=True,
residual=False,
use_edge_features=False,
edge_dim=None, # required when use_edge_features=True
edge_features_kind="spatial", # or "vector" โ see below
)
out = layer(x, edge_index) # [N, 32, H, W]
# Spatial edge features [E, edge_dim, H, W] โ concatenated to source.
layer_s = TensorGraphSAGELayer(
in_channels=16, out_channels=32,
use_edge_features=True, edge_dim=4, edge_features_kind="spatial",
)
out = layer_s(x, edge_index, edge_features=ef_spatial)
# Vector edge features [E, edge_dim] โ projected to channel bias and added
# to W_neigh(h_src) before aggregation.
layer_v = TensorGraphSAGELayer(
in_channels=16, out_channels=32,
use_edge_features=True, edge_dim=3, edge_features_kind="vector",
)
out = layer_v(x, edge_index, edge_features=ef_vector) # ef_vector: [E, 3]
Isolated nodes (no incoming edges) receive only the self transform โ the neighbour aggregate is zero.
TensorGINLayer
Tensor-aware GIN / GINEConv: h_j' = MLP((1+ฮต)ยทh_j + ฮฃ_i m_ij).
from tgraphx.layers import TensorGINLayer
# Default 1ร1 Conv MLP (preserves spatial layout)
layer = TensorGINLayer(
in_channels=16,
out_channels=32,
hidden_channels=24, # defaults to out_channels
eps=0.0,
train_eps=False, # set True to make ฮต a learnable scalar parameter
use_batchnorm=False,
)
out = layer(x, edge_index) # [N, 32, H, W]
# Custom MLP (any nn.Module mapping [N, in_channels, H, W] โ [N, out_channels, H, W])
import torch.nn as nn
custom_mlp = nn.Sequential(
nn.Conv2d(16, 24, kernel_size=3, padding=1),
nn.ReLU(inplace=True),
nn.Conv2d(24, 32, kernel_size=1),
)
layer = TensorGINLayer(in_channels=16, out_channels=32, mlp=custom_mlp)
# GINEConv-style spatial edge inclusion: messages = ReLU(h_src + ฯ(e_ij))
layer_s = TensorGINLayer(
in_channels=16, out_channels=32,
use_edge_features=True, edge_dim=4, edge_features_kind="spatial",
)
out = layer_s(x, edge_index, edge_features=ef_spatial)
# Vector edge features [E, edge_dim] โ projected to [E, in_channels, 1, 1]
# and broadcast over H ร W before ReLU.
layer_v = TensorGINLayer(
in_channels=16, out_channels=32,
use_edge_features=True, edge_dim=3, edge_features_kind="vector",
)
out = layer_v(x, edge_index, edge_features=ef_vector) # ef_vector: [E, 3]
Custom layers via TensorMessagePassingLayer
import torch, torch.nn as nn
from tgraphx.layers import TensorMessagePassingLayer
class MyConv(TensorMessagePassingLayer):
def __init__(self, c_in, c_out):
super().__init__(in_shape=(c_in,), out_shape=(c_out,), aggr="mean")
self.W_g = nn.Conv2d(c_in, c_out, kernel_size=1)
self.W_v = nn.Conv2d(c_in, c_out, kernel_size=1)
def message(self, src, dest, edge_attr):
gate = torch.sigmoid(self.W_g(src + dest))
return gate * self.W_v(src)
def update(self, node_feature, aggregated_message):
return aggregated_message
The base class handles per-edge gather and aggregation (sum or mean)
for arbitrary trailing tensor shapes. See
examples/custom_message_passing.py.
CNNEncoder
from tgraphx.models import CNNEncoder
enc = CNNEncoder(
in_channels=3,
out_features=64,
num_layers=3, # total Conv2d blocks
hidden_channels=64,
dropout_prob=0.3,
use_batchnorm=True,
use_residual=True, # residual skip in intermediate blocks
pool_layers=1, # how many blocks include SafeMaxPool2d(2)
return_feature_map=True, # True โ [N, out_features, H', W']
# False โ [N, out_features] (global avg pool)
pre_encoder=None, # optional PreEncoder instance
)
features = enc(patches) # patches: [N, in_channels, patch_H, patch_W]
GraphClassifier
from tgraphx.models import GraphClassifier
clf = GraphClassifier(
in_shape=(C, H, W),
hidden_shape=(C_hidden, H, W),
num_classes=5,
num_layers=2,
aggr="sum",
pooling="mean", # "mean" | "sum" | "max"
)
logits = clf(
node_features, # [N, C, H, W]
edge_index, # [2, E]
batch=batch_vector, # [N] โ required for graph-level output
edge_features=None, # optional
) # โ [num_graphs, num_classes]
NodeClassifier
from tgraphx.models import NodeClassifier
nc = NodeClassifier(
in_shape=(64,), # vector features only
hidden_shape=(128,),
num_classes=3,
num_layers=2,
)
logits = nc(node_features, edge_index) # [N, num_classes]
CNN_GNN_Model
A full CNN โ GNN โ classify pipeline that accepts pre-split node patches.
from tgraphx.models import CNN_GNN_Model
model = CNN_GNN_Model(
cnn_params=dict(
in_channels=3,
out_features=64,
num_layers=2,
hidden_channels=64,
dropout_prob=0.0,
use_batchnorm=False,
use_residual=False,
pool_layers=1,
return_feature_map=True,
),
gnn_in_dim=(64, 8, 8), # must match CNN output shape exactly
gnn_hidden_dim=(64, 8, 8),
num_classes=10,
num_gnn_layers=2,
gnn_dropout=0.3, # forwarded to DeepCNNAggregator
residual=True, # per-layer skip connection
skip_cnn_to_classifier=False,
)
# raw_patches: pre-split by the user; shape [N, in_channels, pH, pW]
logits = model(raw_patches, edge_index) # [N, num_classes] (node-level)
logits = model(raw_patches, edge_index, batch=b) # [G, num_classes] (graph-level)
get_device
from tgraphx.core.utils import get_device
device = get_device() # CUDA (if available) โ MPS โ CPU
device = get_device(device_id=1) # specific CUDA device
Shape conventions
| Tensor | Shape | dtype | Notes |
|---|---|---|---|
node_features |
[N, D], [N, C, H, W], or [N, C, D, H, W] |
float | vector, 2-D spatial, or 3-D volumetric; N = number of nodes |
node_features (vector) |
[N, D] |
float | For NodeClassifier / LinearMessagePassing |
edge_index |
[2, E] |
torch.long |
Row 0 = source nodes, row 1 = destination nodes |
edge_features |
[E, ...] |
float | Optional; length must equal E |
batch |
[N] |
torch.long |
Maps each node to its graph index |
Device support
| Device | Status |
|---|---|
| CPU | Tested (CI) |
| NVIDIA CUDA | Tested (PyTorch 2.10, CUDA 12.8) |
| Apple Silicon MPS | Code path exists in get_device(); not yet in CI |
| Multi-GPU | Not supported |
from tgraphx.core.utils import get_device
device = get_device()
model.to(device)
g.to(device)
batch.to(device)
Supported Python and PyTorch versions
| Python | PyTorch | Status |
|---|---|---|
| 3.10 | โฅ 1.13 | CI (ubuntu-latest) |
| 3.11 | โฅ 1.13 | CI (ubuntu-latest) |
| 3.12 | โฅ 1.13 | CI (ubuntu-latest) |
| 3.9 | โฅ 1.13 | Should work; not in CI |
Limitations
- Scope: TGraphX provides tensor-aware adaptations of GCN-style, GAT, GraphSAGE, and GIN. It is not a drop-in PyTorch Geometric replacement: heterogeneous graphs, temporal graphs, graph transformers, and learned graph construction are all out of scope for the current release.
- No graph builders: Users must supply
edge_index. Common strategies for image-patch graphs include grid connectivity, kNN on patch centres, and IoU-based adjacency. - No patch extraction: Users split images into patches before passing them to the model.
AttentionMessagePassingis not GAT. It uses per-edge sigmoid gating without softmax normalisation. UseTensorGATLayerfor true multi-head GAT.- Scalar attention only in
TensorGATLayer. Per-channel and per-pixel attention modes are not implemented. - GAT edge features (vector or spatial โ pooled).
TensorGATLayeraccepts[E, edge_dim]vectors and matching-rank spatial tensors ([E, edge_dim, H, W]whenspatial_rank=2,[E, edge_dim, D, H, W]whenspatial_rank=3). Spatial tensors are mean-pooled over their spatial dims before the per-(edge, head)attention bias projection โ this keeps the scalar-attention regime stable. Mixed-rank edges (e.g. 5-D into a 2-D-configured GAT, or 4-D into a 3-D-configured GAT) raiseNotImplementedError.TensorGraphSAGELayerandTensorGINLayeruse matching-rank spatial edge tensors directly without pooling. - Node-feature ranks supported. TGraphX supports vector
[N, D], 2-D spatial[N, C, H, W], and 3-D volumetric[N, C, D, H, W]node features for the listed layers. It does not claim arbitrary-rank tensor support. Vector node features are handled byLinearMessagePassing; 2-D / 3-D byConvMessagePassing,TensorGATLayer,TensorGraphSAGELayer, andTensorGINLayer(withspatial_rank=2or3at construction time). - Differentiability: All learned parameters (CNN encoder, message-passing layers, classifier) are end-to-end differentiable. The graph topology (
edge_index) is user-provided and is not learned by the model.
GNN family coverage
| GNN family | Implemented? | Tested? | Limitations |
|---|---|---|---|
| Tensor-aware GCN-style (Conv message passing) | โ
ConvMessagePassing |
โ | 2-D [N, C, H, W] and 3-D [N, C, D, H, W]; edge features must be matching-rank spatial with channel count = node channel count |
| Tensor-aware GAT (multi-head) | โ
TensorGATLayer |
โ | 2-D and 3-D node features (spatial_rank=2/3); scalar attention per (edge, head); vector [E, D_e] and matching-rank spatial / volumetric edge features (mean-pooled); no per-pixel / per-voxel attention |
| Tensor-aware GraphSAGE | โ
TensorGraphSAGELayer |
โ | 2-D and 3-D node features (spatial_rank=2/3); mean / max only; no LSTM aggregator |
| Tensor-aware GIN / GINEConv | โ
TensorGINLayer |
โ | 2-D and 3-D node features (spatial_rank=2/3) |
| MPNN-style custom layer | โ
TensorMessagePassingLayer base |
โ (subclass test + example) | โ |
| Edge-conditioned MP (spatial / volumetric) | โ
ConvMessagePassing, TensorGATLayer (mean-pooled), TensorGraphSAGELayer, TensorGINLayer |
โ | edge features [E, C_e, H, W] (2-D) or [E, C_e, D, H, W] (3-D, matching the layer's spatial_rank) |
Per-edge edge_weight ([E]) |
โ all four message-passing layers, 2-D and 3-D | โ | scales messages before aggregation; on GAT applied after softmax-normalised attention |
| 3-D / volumetric node features | โ
ConvMessagePassing, TensorGATLayer, TensorGraphSAGELayer, TensorGINLayer |
โ | [N, C, D, H, W]; pass spatial_rank=3 to GAT/SAGE/GIN, or (C, D, H, W) in_shape to ConvMessagePassing. DeepCNNAggregator is rank-aware. LinearMessagePassing covers vector [N, D] and is unaffected. |
| Edge-conditioned MP (vector) | โ
TensorGATLayer, TensorGraphSAGELayer, TensorGINLayer |
โ | edge features [E, D_e]; edge_features_kind="vector" |
aggr="sum"|"mean"|"max" base |
โ all three modes | โ hand-computed + backward | ConvMessagePassing aggr="max" routes through scatter_max |
| Graph Transformer | โ | โ | not implemented |
| Heterogeneous graphs | โ | โ | not supported |
| Temporal / spatiotemporal graphs | โ | โ | not supported |
| Learned graph construction | โ | โ | edge_index is always user-supplied |
| Arbitrary-rank tensor support beyond rank 0 / 2 / 3 | โ | โ | only vector, 2-D, and 3-D shapes are supported |
Project structure
TGraphX/
โโโ tgraphx/
โ โโโ __init__.py # public API re-exports
โ โโโ core/
โ โ โโโ graph.py # Graph, GraphBatch
โ โ โโโ dataloader.py # GraphDataset, GraphDataLoader
โ โ โโโ utils.py # load_config, get_device
โ โโโ layers/
โ โ โโโ base.py # TensorMessagePassingLayer, LinearMessagePassing
โ โ โโโ conv_message.py # ConvMessagePassing
โ โ โโโ attention_message.py# AttentionMessagePassing (legacy sigmoid)
โ โ โโโ gat.py # TensorGATLayer (true multi-head GAT)
โ โ โโโ sage.py # TensorGraphSAGELayer
โ โ โโโ gin.py # TensorGINLayer / GINEConv
โ โ โโโ _scatter.py # internal: edge_softmax, scatter_*
โ โ โโโ aggregator.py # DeepCNNAggregator
โ โ โโโ safe_pool.py # SafeMaxPool2d
โ โโโ models/
โ โโโ cnn_encoder.py # CNNEncoder
โ โโโ cnn_gnn_model.py # CNN_GNN_Model
โ โโโ graph_classifier.py
โ โโโ node_classifier.py
โ โโโ pre_encoder.py # PreEncoder (optional ResNet-18)
โโโ tests/
โ โโโ conftest.py
โ โโโ test_imports.py
โ โโโ test_graph.py
โ โโโ test_layers.py
โ โโโ test_models.py
โ โโโ test_devices.py
โ โโโ test_gnn_families.py # GAT, GraphSAGE, GIN, custom subclass
โ โโโ test_math.py # edge-order invariance, permutation-equivariance, H=W=1, isolated nodes
โ โโโ test_gradients.py # single-layer backward, 8-layer stacks, tiny overfit
โ โโโ test_edge_features.py # vector edge features for GAT, SAGE, GIN
โโโ examples/
โ โโโ minimal_spatial_message_passing.py
โ โโโ minimal_graph_classifier.py
โ โโโ tensor_gat_minimal.py
โ โโโ tensor_graphsage_minimal.py
โ โโโ custom_message_passing.py
โ โโโ tiny_overfit_tensor_gat.py # trainability check per GNN family
โ โโโ tiny_overfit_edge_features.py # vector edge feature dependency check
โ โโโ gradient_sanity_stack.py # 8-layer deep stack gradient norms
โโโ pyproject.toml
โโโ requirements.txt
โโโ environment.yml
โโโ LICENSE
Development
# Install with dev dependencies (pytest, build, twine)
pip install -e ".[dev]"
# Run the test suite (CPU tests always run; CUDA/MPS skipped if unavailable)
pytest
# Run a specific test file
pytest tests/test_layers.py -v
# Run the examples
python examples/minimal_spatial_message_passing.py
python examples/minimal_graph_classifier.py
Authorship
Software author and maintainer: Arash Sajjadi, PhD Candidate in Computer Science, University of Saskatchewan (arash.sajjadi@usask.ca)
Academic supervision: Mark Eramian, PhD Supervisor / Academic Advisor, University of Saskatchewan
Related preprint: TGraphX: Tensor-Aware Graph Neural Network for Multi-Dimensional Feature Learning Arash Sajjadi and Mark Eramian โ arXiv:2504.03953
The software package is developed and maintained by Arash Sajjadi. Mark Eramian is Arash Sajjadi's PhD supervisor and co-author of the related academic preprint. Software authorship and paper co-authorship are separate roles; both are acknowledged accurately above.
Citation
If you use TGraphX in your research, please cite:
@misc{sajjadi2025tgraphxtensorawaregraphneural,
title={TGraphX: Tensor-Aware Graph Neural Network for Multi-Dimensional Feature Learning},
author={Arash Sajjadi and Mark Eramian},
year={2025},
eprint={2504.03953},
archivePrefix={arXiv},
primaryClass={cs.CV},
url={https://arxiv.org/abs/2504.03953},
}
License
TGraphX is released under the MIT License.
Questions, issues, or contributions are welcome โ please open a GitHub issue or pull request.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file tgraphx-0.1.1.tar.gz.
File metadata
- Download URL: tgraphx-0.1.1.tar.gz
- Upload date:
- Size: 156.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.9.25
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
221c52d6001d26eb92700a4a345683a1d912661d8067acd93b62ce04024d756c
|
|
| MD5 |
5b7547a2f6d8f2c91b8fc3db85c1c6d1
|
|
| BLAKE2b-256 |
91c42187ef34f4398fb5a1e7ca2527f2bcc906057f54530be196523fe26fd6cc
|
File details
Details for the file tgraphx-0.1.1-py3-none-any.whl.
File metadata
- Download URL: tgraphx-0.1.1-py3-none-any.whl
- Upload date:
- Size: 92.9 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.9.25
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
36f9ca70176859c46186455b48d444e489bb3b65f89eb70085f2413a2e0bce1a
|
|
| MD5 |
86492406fc0975bbaa124f9e90d32d3d
|
|
| BLAKE2b-256 |
cd25ed2eea7cfe38ab987c850a1c4c5eb363994ad5cd14ec58851c60e7b17757
|