GraVNet Convolution: Methods & Applications

• GraVNet Convolution is a dual-purpose graph operation, with GravNet learning low-dimensional embeddings for irregular detector geometries and Graph-Variate convolution filtering spatio-temporal signals.
• It defines adaptive neighborhoods using k-NN in a learned coordinate space and applies Gaussian distance weighting for effective message passing.
• The method demonstrates practical benefits by improving clustering metrics and efficiency compared to conventional CNNs and other graph-based approaches.

GraVNet Convolution denotes two distinct graph-convolution usages in the cited literature. In "Learning representations of irregular particle-detector geometry with distance-weighted graph networks" (Qasim et al., 2019), the term corresponds to the GravNet layer, a convolution-like operation on irregular graphs that learns a low-dimensional coordinate space in which neighborhoods are defined and a feature space that is exchanged among neighbors with distance-weighted pooling. In "Graph Variate Neural Networks" (Roy et al., 24 Sep 2025), the query term is explicitly mapped to Graph-Variate convolution, a per-time-step, signal-dependent graph filter that combines instantaneous connectivity with a stable long-term support. This suggests a shared emphasis on data-adaptive locality, but the two operators act on different mathematical objects and were introduced for different problem classes.

1. Terminological scope and disambiguation

A recurrent source of confusion is that "GraVNet Convolution" is not a single standardized operator across all graph-learning literature. In the detector-reconstruction setting, GravNet is a learned-neighborhood message-passing layer on sparse, irregular detector graphs. In the GVNN setting, Graph-Variate convolution is a time-indexed graph filter on spatio-temporal signals, where the graph itself changes with the current sample (Qasim et al., 2019, Roy et al., 24 Sep 2025).

Usage	Core construction	Primary setting
GravNet	Learned coordinate embedding, $k$-NN, Gaussian distance weighting, mean/max pooling	Irregular particle-detector geometry
Graph-Variate convolution	$\Omega(t)=W\circ J(t)$, per-time aggregation, time mixing	Dynamically evolving spatio-temporal signals

The two constructions are related at the level of inductive bias rather than implementation. GravNet learns locality through a low-dimensional embedding $S$, whereas Graph-Variate convolution modulates a stable support $W$ by instantaneous interactions $J(t)$. A plausible implication is that both formulations address settings in which a fixed, hand-specified adjacency is either unavailable or too restrictive.

2. GravNet as a convolution on irregular detector graphs

In (Qasim et al., 2019), GravNet realizes a convolution-like operation on irregular graphs by learning for each node $i$ both a coordinate embedding $S_i \in \mathbb{R}^{D_S}$ and a propagated feature vector $F_i \in \mathbb{R}^{D_F}$. Starting from per-hit features $x_i \in \mathbb{R}^{F_{in}}$, the implementation first augments features with the global mean over vertices and passes them through three dense layers with 64 nodes and tanh activation, producing intermediate features $h_i$. The layer then computes

$\Omega(t)=W\circ J(t)$0

Neighborhoods are defined by $\Omega(t)=W\circ J(t)$1-nearest neighbors in the learned coordinate space $\Omega(t)=W\circ J(t)$2. With Euclidean distance

$\Omega(t)=W\circ J(t)$3

the neighborhood $\Omega(t)=W\circ J(t)$4 contains the $\Omega(t)=W\circ J(t)$5 closest nodes $\Omega(t)=W\circ J(t)$6. In the main calorimeter-clustering model, the hyperparameters are $\Omega(t)=W\circ J(t)$7, $\Omega(t)=W\circ J(t)$8, $\Omega(t)=W\circ J(t)$9, and $S$0.

The distance weighting is Gaussian:

$S$1

For each neighbor $S$2, the layer forms weighted messages

$S$3

It then applies two symmetric pooling operators over the neighborhood:

$S$4

The pooled summaries are concatenated with the current node features and projected by a shared dense transform with tanh activation,

$S$5

yielding the layer output in $S$6 (Qasim et al., 2019).

The paper characterizes this sequence as a "GraVNet Convolution": learn $S$7, find neighbors by $S$8-NN in $S$9, weight by a Gaussian kernel $W$0, aggregate by mean and max, and project back to features for the next block. It is also described as a message-passing layer in the sense of Gilmer et al., with messages $W$1 aggregated by symmetric functions and updated via an MLP. Relative to classical continuous convolution $W$2, GravNet constructs a discrete approximation on a learned manifold.

3. Architectural instantiation for calorimeter clustering

The principal application in (Qasim et al., 2019) is per-cell calorimeter clustering for two overlapping showers in an irregular tungsten calorimeter with 20 layers, $W$3 in $W$4, and length 2 in $W$5. Sensors are square, with fine segmentation in one quadrant and coarser segmentation elsewhere, and the sensor counts vary by depth. The per-hit input features are the total deposited energy $W$6, cell position $W$7, cell width or size, and layer number.

Each training event combines two showers. The network predicts two shower energy fractions per sensor through a per-vertex head consisting of Dense(3, ReLU) followed by Dense(2, softmax). Events where both showers have identical maximal deposit location, approximately $W$8, are discarded as inseparable. The dataset contains 16,000,000 generated events, with 100,000 used for validation and 250,000 for testing; the remainder is used for training (Qasim et al., 2019).

The GravNet-based network comprises four blocks. Each block performs augmentation by the global mean over vertices, three dense layers with 64 units and tanh activation, one GravNet layer with $W$9, propagated features $J(t)$0, $J(t)$1, and $J(t)$2, followed by batch normalization. The outputs of all blocks are concatenated and passed to a final dense layer with 128 units and ReLU. Batch normalization is applied to the input and after each block.

The training loss is

$J(t)$3

This mildly upweights higher-energy deposits via $J(t)$4. An additional evaluation quantity is the shower response

$J(t)$5

Optimization uses Adam with an initial learning rate of approximately $J(t)$6, exponentially decayed to $J(t)$7 over 2 million iterations and then modulated by $J(t)$8 at fixed frequency. The models are sized to approximately 100,000 trainable parameters. A TensorFlow implementation is referenced at https://github.com/jkiesele/caloGraphNN (Qasim et al., 2019).

4. Empirical behavior, metrics, and computational profile

On the calorimeter-clustering task, GravNet achieves the best inclusive metrics among the tested approaches, while all graph models surpass the binning CNN on overlap-specific metrics (Qasim et al., 2019).

Model	Inclusive $J(t)$9	Overlap-specific $i$0
GravNet	0.886	0.721
DG	0.881	0.728
GarNet	0.872	0.714
Binning CNN	0.867	0.697

For inclusive metrics, GravNet reports $i$1, $i$2, $i$3, $i$4, $i$5, $i$6, and accuracy $i$7. DG reports $i$8, $i$9, $S_i \in \mathbb{R}^{D_S}$0, $S_i \in \mathbb{R}^{D_S}$1, $S_i \in \mathbb{R}^{D_S}$2, $S_i \in \mathbb{R}^{D_S}$3, and $S_i \in \mathbb{R}^{D_S}$4. GarNet reports $S_i \in \mathbb{R}^{D_S}$5, $S_i \in \mathbb{R}^{D_S}$6, $S_i \in \mathbb{R}^{D_S}$7, $S_i \in \mathbb{R}^{D_S}$8, $S_i \in \mathbb{R}^{D_S}$9, $F_i \in \mathbb{R}^{D_F}$0, and $F_i \in \mathbb{R}^{D_F}$1. The binning CNN reports $F_i \in \mathbb{R}^{D_F}$2, $F_i \in \mathbb{R}^{D_F}$3, $F_i \in \mathbb{R}^{D_F}$4, $F_i \in \mathbb{R}^{D_F}$5, $F_i \in \mathbb{R}^{D_F}$6, $F_i \in \mathbb{R}^{D_F}$7, and $F_i \in \mathbb{R}^{D_F}$8.

For overlap-specific metrics, restricted to sensors with fractions in $F_i \in \mathbb{R}^{D_F}$9, GravNet reports $x_i \in \mathbb{R}^{F_{in}}$0, $x_i \in \mathbb{R}^{F_{in}}$1, $x_i \in \mathbb{R}^{F_{in}}$2, $x_i \in \mathbb{R}^{F_{in}}$3, $x_i \in \mathbb{R}^{F_{in}}$4, $x_i \in \mathbb{R}^{F_{in}}$5, and $x_i \in \mathbb{R}^{F_{in}}$6. DG reports $x_i \in \mathbb{R}^{F_{in}}$7, $x_i \in \mathbb{R}^{F_{in}}$8, $x_i \in \mathbb{R}^{F_{in}}$9, $h_i$0, $h_i$1, $h_i$2, and $h_i$3. GarNet reports $h_i$4, $h_i$5, $h_i$6, $h_i$7, $h_i$8, $h_i$9, and $\Omega(t)=W\circ J(t)$00. The binning CNN reports $\Omega(t)=W\circ J(t)$01, $\Omega(t)=W\circ J(t)$02, $\Omega(t)=W\circ J(t)$03, $\Omega(t)=W\circ J(t)$04, $\Omega(t)=W\circ J(t)$05, $\Omega(t)=W\circ J(t)$06, and $\Omega(t)=W\circ J(t)$07.

Corrected for shower swapping, GravNet remains best overall. The swapped-event fractions are $\Omega(t)=W\circ J(t)$08 for GravNet, $\Omega(t)=W\circ J(t)$09 for DG, $\Omega(t)=W\circ J(t)$10 for GarNet, and $\Omega(t)=W\circ J(t)$11 for the binning CNN. In resource terms, DG has the largest memory usage; GravNet uses approximately $\Omega(t)=W\circ J(t)$12 less memory than DG, while GarNet is lower still. The binning CNN is fastest on GPU, graph models have similar runtimes for small GPU batches, and GarNet benefits strongly from CPU execution, approximately $\Omega(t)=W\circ J(t)$13 faster than DG on a single core. Exact numeric timing values are not tabulated.

From the computational side, the paper gives the brute-force $\Omega(t)=W\circ J(t)$14-NN complexity of GravNet as $\Omega(t)=W\circ J(t)$15 for distance computation, $\Omega(t)=W\circ J(t)$16 comparisons for neighbor selection, $\Omega(t)=W\circ J(t)$17 for weighted aggregation, and $\Omega(t)=W\circ J(t)$18 memory for edges and messages. The qualitative design guidance is to keep $\Omega(t)=W\circ J(t)$19 small and $\Omega(t)=W\circ J(t)$20 moderate in order to control memory and compute while preserving locality.

5. Relation to GarNet and other message-passing operators

The 2019 paper introduces GravNet together with GarNet, and situates both relative to DG, an EdgeConv-like baseline, and to GraphSAGE (Qasim et al., 2019). The contrast with GarNet is structural. Instead of learning coordinates $\Omega(t)=W\circ J(t)$21 and performing vertex-to-vertex neighborhood aggregation, GarNet learns distances from each vertex to $\Omega(t)=W\circ J(t)$22 aggregators. For each vertex,

$\Omega(t)=W\circ J(t)$23

with $\Omega(t)=W\circ J(t)$24 interpreted as the signed distance to aggregator $\Omega(t)=W\circ J(t)$25. The potential is

$\Omega(t)=W\circ J(t)$26

Information flows in two phases: first from vertices to aggregators, then back from aggregators to vertices. The paper describes GarNet as lighter and more sequential, with notably faster CPU inference, while GravNet directly models learned geometric neighborhoods and proved slightly higher-performing on inclusive clustering metrics.

Relative to EdgeConv, GravNet separates geometry from features. EdgeConv forms edges in the high-dimensional feature space and uses edge features of the form $\Omega(t)=W\circ J(t)$27 with dynamically recomputed neighborhoods in that feature space. GravNet instead learns a low-dimensional coordinate space, with $\Omega(t)=W\circ J(t)$28 in the main model, for neighborhood definition, thereby reducing the cost of neighbor search and the number of edges. Relative to GraphSAGE, which aggregates over a fixed or random neighborhood on a given adjacency, GravNet learns the adjacency itself end-to-end via $\Omega(t)=W\circ J(t)$29 and equips it with a differentiable distance-weighted kernel.

Several properties and limitations are explicitly noted. GravNet avoids imposing a regular pixelization and can exploit full detector granularity while natively managing event sparsity and arbitrarily complex detector geometries. It is not hard-coded to be translation- or rotation-invariant in detector coordinates; rather, it can learn an embedding $\Omega(t)=W\circ J(t)$30 that is stable under such transformations if needed. Neighbor selection by $\Omega(t)=W\circ J(t)$31-NN is non-differentiable, so gradients do not flow through the discrete neighbor set. The paper also reports a mild low-energy bias in response arising from the use of a bounded target with mean-square error. Training guidance includes using both mean and max pooling to stabilize convergence, batch normalization after blocks, tanh in internal blocks, ReLU in heads, and small $\Omega(t)=W\circ J(t)$32 with moderate $\Omega(t)=W\circ J(t)$33.

6. Graph-Variate convolution in GVNNs

In (Roy et al., 24 Sep 2025), "GraVNet Convolution" is mapped to the Graph-Variate convolution used inside Graph-Variate Neural Networks. The setting is a spatio-temporal signal with sequence tensor $\Omega(t)=W\circ J(t)$34, or, in the single-feature matrix form used for the layer formulas, $\Omega(t)=W\circ J(t)$35 with column $\Omega(t)=W\circ J(t)$36. The operator combines a stable long-term support $\Omega(t)=W\circ J(t)$37 with an instantaneous, data-driven connectivity matrix $\Omega(t)=W\circ J(t)$38 defined by a node-pair function $\Omega(t)=W\circ J(t)$39.

Two node functions are emphasized. Instantaneous correlation is

$\Omega(t)=W\circ J(t)$40

where $\Omega(t)=W\circ J(t)$41. Local Dirichlet Energy is

$\Omega(t)=W\circ J(t)$42

The graph-variate slice at time $\Omega(t)=W\circ J(t)$43 is then formed by Hadamard filtering,

$\Omega(t)=W\circ J(t)$44

An optional symmetrically renormalized form is

$\Omega(t)=W\circ J(t)$45

with $\Omega(t)=W\circ J(t)$46.

For layer $\Omega(t)=W\circ J(t)$47, the graph-variate aggregation is

$\Omega(t)=W\circ J(t)$48

followed by a residual-like combination with learnable per-time scalars $\Omega(t)=W\circ J(t)$49 and $\Omega(t)=W\circ J(t)$50,

$\Omega(t)=W\circ J(t)$51

and a learned time-mixing block $\Omega(t)=W\circ J(t)$52 with nonlinearity $\Omega(t)=W\circ J(t)$53,

$\Omega(t)=W\circ J(t)$54

Per node and per time step, this becomes

$\Omega(t)=W\circ J(t)$55

The paper gives a spectral interpretation: if $\Omega(t)=W\circ J(t)$56, then the two-tap graph-variate filter has instantaneous frequency response $\Omega(t)=W\circ J(t)$57. No ad hoc sliding window is used; $\Omega(t)=W\circ J(t)$58 and $\Omega(t)=W\circ J(t)$59 are recomputed at every time step. The computational cost is $\Omega(t)=W\circ J(t)$60 in time and, if $\Omega(t)=W\circ J(t)$61 is materialized, $\Omega(t)=W\circ J(t)$62 in memory, which is linear in sequence length $\Omega(t)=W\circ J(t)$63 and quadratic in the number of nodes $\Omega(t)=W\circ J(t)$64. The paper also states theoretical guarantees: rank lifting under instantaneous correlation when $\Omega(t)=W\circ J(t)$65, a Gershgorin-Dirichlet spectral-radius bound for Local Dirichlet Energy, and global Lipschitz bounds for the layer.

Empirically, GVNNs using this operator outperform graph-based baselines such as GTCNN, GGRNN, and GVARMA on several forecasting benchmarks, and are competitive with LSTMs and Transformers. Reported examples include Hopfield test MSE $\Omega(t)=W\circ J(t)$66 for GVNN versus $\Omega(t)=W\circ J(t)$67 for GTCNN at horizon $\Omega(t)=W\circ J(t)$68, MacArthur test MSE $\Omega(t)=W\circ J(t)$69 for GVNN versus $\Omega(t)=W\circ J(t)$70 for GTCNN at $\Omega(t)=W\circ J(t)$71, PEMS-BAY MSE $\Omega(t)=W\circ J(t)$72 for GVNN with learned $\Omega(t)=W\circ J(t)$73 versus $\Omega(t)=W\circ J(t)$74 for Transformer and $\Omega(t)=W\circ J(t)$75 for LSTM at horizon 3, and METR-LA MSE $\Omega(t)=W\circ J(t)$76 for GVNN with learned $\Omega(t)=W\circ J(t)$77 versus $\Omega(t)=W\circ J(t)$78 for Transformer. On EEG motor imagery, the paper reports $\Omega(t)=W\circ J(t)$79 accuracy on BNCI 2a for GVNN with LDE and fixed $\Omega(t)=W\circ J(t)$80, compared with $\Omega(t)=W\circ J(t)$81 for EEGNet, and $\Omega(t)=W\circ J(t)$82 on PhysioNet MI for GraphVar+MLP with LDE and learned $\Omega(t)=W\circ J(t)$83, compared with $\Omega(t)=W\circ J(t)$84 for Transformer.

The two meanings of GraVNet Convolution therefore should be distinguished carefully. In (Qasim et al., 2019), it is a learned-neighborhood Gaussian graph convolution for irregular detector geometry. In (Roy et al., 24 Sep 2025), it is a graph-variate, per-time-step filter in which instantaneous connectivity is gated by a stable support. The terminological overlap reflects a common reliance on data-adaptive graph structure, but not a shared layer definition.