arXiv Computer Vision
RBF-GNN: Rational Basis Functions for Pseudo-Coordinate based Graph Convolutions
Read the original on arXiv Computer Vision →The Flow has not summarised this story yet — read it at arXiv Computer Vision.
Related stories
arXiv Machine Learning
Jul 7
On Preserving Geometrical Invariance for Superpixel Image Classification using Graph Transformer
arXiv:2607. 04262v1 Announce Type: new Abstract: Convolutional Neural Network (CNN) and Vision Transformer (ViT) for image classification exploit a dense grid of pixels containing redundant information.
arXiv Machine Learning
Jun 2
AdaKernel: Learning Adaptive Kernel Parameters for Spatiotemporal Graph Neural Networks
arXiv:2606. 01283v1 Announce Type: new Abstract: Modeling spatial dependencies is central to spatiotemporal data analysis using Graph Neural Networks (GNNs).
arXiv Machine Learning
Jul 31
Train Small, Deploy Large: Zero-Shot GNN Transfer Through Geometric Renormalization
arXiv:2607. 27767v1 Announce Type: new Abstract: Graph neural networks (GNNs) can operate on large graphs but become infrastructure-sensitive at the scale of millions of nodes and typically require scalable training techniques for even larger graphs.
arXiv Machine Learning
Sep 15
Size Transferability of Graph Transformers with Convolutional Positional Encodings
arXiv:2602.15239v3 Announce Type: replace Abstract: Transformers have achieved remarkable success across domains, motivating the rise of Graph Transformers (GTs) as attention-based architectures for...
arXiv AI
Sep 15
Degraded but Not Entirely Ineffective: PE-Based Deformable Graph Neural Networks
The paper introduces a Position Encoding-Based Deformable Spatial Aggregation Module (PEBDSAM) that uses a deformable mechanism in position space to identify relevant nodes beyond first‑order neighbors, thereby addressing over‑smoothing, over‑compression, limited receptive fields, and noise from heterophilous graphs. Diagnostic experiments revealed that current offsets are ineffective, yet performance still improves, leading to a streamlined version called PEBSAM and a faster variant, PEBSAM‑Speed. The module is plug‑and‑play and can be integrated into GCN, GAT, GIN, and GraphSAGE, achieving strong results on both homophilous and heterophilous datasets.
arXiv AI
Aug 13
Making Gaussian Kolmogorov-Arnold Networks Reliable and Accurate
arXiv:2604. 21174v3 Announce Type: replace-cross Abstract: Kolmogorov-Arnold Networks (KANs) replace fixed activations with learnable univariate edge functions whose behavior depends strongly on the chosen basis.