Labeled Incidence Structures for Native Transformer Modeling of Text, Knowledge Graphs, and Hypergraphs
Not on the map. Why?
Abstract (arXiv)
Current Transformer interfaces index tokens by one or more integer coordinates, which determine their addresses inside attention. In RoPE and its multi-axis or hierarchical variants, the resulting address has the form A(i)=R1i1R2i2R3i3, where the exponents are integer coordinates assigned after choosing a serialized token layout. When Transformers process new or large collections of data, this addressing scheme can produce unseen offsets or coordinate combinations, push repositories toward retrieve-and-serialize pipelines, and force new entities, records, or repository items to be represented by long token strings or identifier embeddings not seen in training. We introduce labeled incidence structures (LIS), in which each participating token or value is an endpoint with content x and a structural index i. The index can include local position, relation role, relation instance, text unit, field, or content-derived identity. The model maps this index to a structural address A(i), so adding new tokens, facts, text units, or repository items applies the same learned address rule to structural and content coordinates rather than requiring larger integer coordinates, unseen coordinate combinations, or new identifier embeddings. Attention scores endpoints i,j using qi^top Pj→ ikj, where journey consistency forces Pj→ i=A(i)-1A(j). When i has several coordinates, such as position, role, and instance, coordinate independence is equivalent to factoring A(i) into one address factor per coordinate. This recovers RoPE, RoPE-2D, and HiRoPE as special cases. This allows knowledge-graph (KG) roles, fact instances, and text units to enter the attention score directly. In controlled shallow diagnostics, the LIS address interface is implemented inside ordinary Transformer attention and yields promising results across text, KG, and n-ary settings.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 36 references that are in the map. First posted on arXiv 29 Jul 2026.
Builds on
25 of 36 references.
References · 25
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
- 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,103
- 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 898
- 2023Extending Context Window of Large Language Models via Positional Interpolationcited by 740
- 2020Benchmarking Graph Neural Networkscited by 680
- 2023YaRN: Efficient Context Window Extension of Large Language Modelscited by 601
- 2020Heterogeneous Graph Transformercited by 582
- 2018Hypergraph Neural Networkscited by 488
- 2019KG-BERT: BERT for Knowledge Graph Completioncited by 324
- 2021Do Transformers Really Perform Bad for Graph Representation?cited by 320
- 2019Gauge Equivariant Convolutional Networks and the Icosahedral CNNcited by 267
13 more
- 2024Rotary Position Embedding for Vision Transformercited by 236
- 2022Pure Transformers are Powerful Graph Learnerscited by 188
- 2019HIBERT: Document Level Pre-training of Hierarchical Bidirectional Transformers for Document Summarizationcited by 121
- 2023Randomized Positional Encodings Boost Length Generalization of Transformerscited by 117
- 2020Gauge Equivariant Mesh CNNs: Anisotropic convolutions on geometric graphscited by 92
- 2020CoLAKE: Contextualized Language and Knowledge Embeddingcited by 86
- 2016On the representation and embedding of knowledge bases beyond binary relationscited by 55
- 2024Contextual Position Encoding: Learning to Count What's Importantcited by 54
- 2022An Exploration of Hierarchical Attention Transformers for Efficient Long Document Classificationcited by 38
- 2021Knowledge Hypergraph Embedding Meets Relational Algebracited by 11
- 2024HiRoPE: Length Extrapolation for Code Models Using Hierarchical Positioncited by 8
- 2023Hypergraph Transformer for Semi-Supervised Classificationcited by 7
- 2021Sentence-Permuted Paragraph Generationcited by 4
Built on by
Not cited yet.