English

Converting Transformers into DGNNs Form

Machine Learning 2025-03-05 v3 Computation and Language

Abstract

Recent advances in deep learning have established Transformer architectures as the predominant modeling paradigm. Central to the success of Transformers is the self-attention mechanism, which scores the similarity between query and key matrices to modulate a value matrix. This operation bears striking similarities to digraph convolution, prompting an investigation into whether digraph convolution could serve as an alternative to self-attention. In this study, we formalize this concept by introducing a synthetic unitary digraph convolution based on the digraph Fourier transform. The resulting model, which we term Converter, effectively converts a Transformer into a Directed Graph Neural Network (DGNN) form. We have tested Converter on Long-Range Arena benchmark, long document classification, and DNA sequence-based taxonomy classification. Our experimental results demonstrate that Converter achieves superior performance while maintaining computational efficiency and architectural simplicity, which establishes it as a lightweight yet powerful Transformer variant.

Keywords

Cite

@article{arxiv.2502.00585,
  title  = {Converting Transformers into DGNNs Form},
  author = {Jie Zhang and Mao-Hsuan Mao and Bo-Wei Chiu and Min-Te Sun},
  journal= {arXiv preprint arXiv:2502.00585},
  year   = {2025}
}

Comments

21 pages, 3 figures, and 8 tables; pseudocode improved

R2 v1 2026-06-28T21:29:12.793Z