Methods › Natural Language Processing › Transformers › EGT

Edge-augmented Graph Transformer

EGT

10 papers tagged archive 2025-07-28

Introduced by Md Shamim Hussain et al. in Global Self-Attention as a Replacement for Graph Convolution

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Transformer neural networks have achieved state-of-the-art results for unstructured data such as text and images but their adoption for graph-structured data has been limited. This is partly due to the difficulty of incorporating complex structural information in the basic transformer framework. We propose a simple yet powerful extension to the transformer - residual edge channels. The resultant framework, which we call Edge-augmented Graph Transformer (EGT), can directly accept, process and output structural information as well as node information. It allows us to use global self-attention, the key element of transformers, directly for graphs and comes with the benefit of long-range interaction among nodes. Moreover, the edge channels allow the structural information to evolve from layer to layer, and prediction tasks on edges/links can be performed directly from the output embeddings of these channels. In addition, we introduce a generalized positional encoding scheme for graphs based on Singular Value Decomposition which can improve the performance of EGT. Our framework, which relies on global node feature aggregation, achieves better performance compared to Convolutional/Message-Passing Graph Neural Networks, which rely on local feature aggregation within a neighborhood. We verify the performance of EGT in a supervised learning setting on a wide range of experiments on benchmark datasets. Our findings indicate that convolutional aggregation is not an essential inductive bias for graphs and global self-attention can serve as a flexible and adaptive alternative.

PaperSource

In Syntology name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.

From the lookup's note on this name: Nothing resolved to this name, but 3 entries in Syntology's graph carry it; the most cited is “Entropy-Guided Training (EGT)”, a method in the paper “Entropy-Guided Data-Efficient Training for Multimodal Reasoning Reward Models” (arXiv:2602.01884, 1 citation). None of them is well cited, so for any better known sense of the name this is still a gap in coverage; they are listed so you can judge, not as a substitute. For arXiv:2602.01884: ask the lookup about it.

Near matches the lookup lists, each a different name: EGT-KG; Entropy-Guided Training (EGT); Explanation-Guided Training (EGT); Equalized Generative Treatment (EGT).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 10 · with a code link: 2 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (1 of 10 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 10 of 10, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

18 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Edge Classification1
Explainable artificial intelligence1
Form1
Graph Classification1
Graph Learning1
Graph Property Prediction1
Graph Regression1
Image Classification1
Inductive Bias1
Kolmogorov-Arnold Networks1
Link Prediction1
Node Classification1
Reinforcement Learning (RL)1
Self-Supervised Learning1
Symbolic Regression1
Transfer Learning1
image-classification1
whole slide images1

Usage over time archive 2025-07-28

Papers per year tagged with EGT: 2021 to 2025, peak 3 3 0 2021: 1 paper 2021 2022: 2 papers 2022 2023: 2 papers 2023 2024: 2 papers 2024 2025: 3 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (10 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Transformers

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections