Bridging Graph Position Encodings for Transformers with Weighted Graph-Walking Automata
원문 초록
A current goal in the graph neural network literature is to enable transformers to operate on graph-structured data, given their success on language and vision tasks. Since the transformer's original sinusoidal positional encodings (PEs) are not applicable to graphs, recent work has focused on developing graph PEs, rooted in spectral graph theory or various spatial features of a graph. In this work, we introduce a new graph PE, Graph Automaton PE (GAPE), based on weighted graph-walking automata (a novel extension of graph-walking automata). We compare the performance of GAPE with other PE schemes on both machine translation and graph-structured tasks, and we show that it generalizes several other PEs. An additional contribution of this study is a theoretical and controlled experimental comparison of many recent PEs in graph transformers, independent of the use of edge features.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Long-Short Distance Graph Neural Networks and Improved Curriculum Learning for Emotion Recognition in Conversation
Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
RLHGNN: Reinforcement Learning-driven Heterogeneous Graph Neural Network for Next Activity Prediction in Business Processes
Has Machine Translation Evaluation Achieved Human Parity? The Human Reference and the Limits of Progress
CycleDistill: Bootstrapping Machine Translation using LLMs with Cyclical Distillation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.