arXiv Machine Learning
Efficient Edge-aware Attention Network for Graph Generation
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Aug 31
Node-wise Feature Encoding for Neural Performance Prediction
FeatureFormer is a neural performance predictor that adds explicit node-wise encodings of FLOPs, parameter counts, and memory proxies to a gated graph attention architecture. It is designed to improve latency and energy prediction for neural networks on edge devices, addressing the limitation of existing GNN and transformer predictors that largely ignore node-level computational cost. The authors also introduce NNEQ, a large-scale energy consumption dataset, and show through extensive experiments that FeatureFormer achieves state‑of‑the‑art performance across both metrics, including challenging out‑of‑domain settings, while the encoding can broadly enhance existing predictors with negligible overhead.
arXiv Machine Learning
Aug 28
Plain Transformers Can be Powerful Graph Learners
The paper shows that a plain Transformer can serve as an effective graph learner by adding three lightweight modifications: simplified L₂ attention, adaptive RMS normalization, and an MLP-based positional encoding stem. These changes preserve token magnitude and enable the model to achieve high expressivity on graph benchmarks, outperforming more complex graph transformer variants. The results suggest that plain Transformers can act as a unified backbone for multimodal learning across language, vision, and graph domains.
arXiv AI
Jul 14
Local Message-Passing for Discrete Graph Generation
arXiv:2603. 08825v2 Announce Type: replace-cross Abstract: Discrete graph generation has emerged as a powerful paradigm for modeling graph-structured data, yet state of the art models often rely on Graph Transformers or higher order architectures.
arXiv Machine Learning
Jul 21
Node4All: Learning Node Representation Beyond Datasets
arXiv:2607. 17272v1 Announce Type: new Abstract: Node representation learning has advanced rapidly, yet most existing methods rely on per-dataset training and hyperparameter tuning.
arXiv AI
Jul 3
X-LogSMask: Expand Transformer for Graph-Structured Data
arXiv:2607. 01553v1 Announce Type: cross Abstract: Transformers have become general-purpose architectures, but their all-to-all self-attention is poorly matched to graph data, whose interactions are sparse, structured and multi-scale.
arXiv Machine Learning
Oct 28
Gating and Learnable Temperature for Graph Attention Mechanisms
The paper introduces gated graph attention and a learnable temperature to enhance standard graph attention networks. Gating filters out unreliable feature dimensions, while the temperature parameter adjusts the sharpness of attention coefficient distributions. Experiments on node classification and heterophilic benchmarks show that these modifications improve performance and robustness, with theoretical analysis supporting the observed gains.