cs.LGOct 27, 2026

Attention as Lattice Gauge Theory: Relations Interact Only Through Wilson Loops

Authors: Aakash Sarkar, Ananya Mukherjee, Motoshige Sato

Organizations: University of California, San Francisco · Brigham and Women’s Hospital

Abstract

Relations compose through the entity they share - Alice is Bob's mother and Bob is Carol's father, so Alice is Carol's grandmother - and the order matters, since a father's mother is not a mother's father; verifying a composed relation means closing the loop. We show that if each entity's coordinate frame may be rotated independently (per-entity frame freedom), three things follow. In the pure-gauge sector, relations that share no cycle cannot interact at all. The only gauge-invariant score of a triangle is a class function of its holonomy H=TijTjkTkiH = T_{ij} T_{jk} T_{ki} - a Wilson loop. And the only equivariant update of an edge is U=Ψ(H) TijU = Ψ(H)\, T_{ij} with ΨΨ conjugation-equivariant. Edge attention by Wilson loops is therefore not one design among many but the unique form the symmetry permits. Three communities hold pieces of this form: the commuting-operator embeddings of knowledge graphs are its abelian (commuting) sector; AlphaFold's triangle update and the Edge Transformer have its shape - an edge updated through the third vertex - without its constraints; and lattice QCD builds it equivariantly on lattices. We instantiate the equivariant sub-family on general relational graphs as holonomy attention. With no training and composition alone, it infers unobserved S4S_4 relations on sparse graphs at 0.88 with a fifth of the edges corrupted, at or slightly below specialist synchronization algorithms, where every commutative architecture is capped at 0.083; its holonomy score flags corrupted triangles at AUC 0.99 where commuting scores are capped at 0.76 by a second selection rule, and it separates clusters without labels.

Figures & tables

Explore similar work

Aug 3, 2026

When Should Graph Attention Be Sparse? Learning a Per-Edge Tsallis Index

Graph attention normalizes neighborhood scores with softmax, the maximum-entropy choice under Shannon statistics. But homophilic and heterophilic graphs want different attention shapes, and one fixed normalization cannot serve both. We propose LTGA (Learnable Tsallis Graph Attention), a graph attention layer whose Tsallis entropic index qq is learned jointly with the weights, interpolating continuously between heavy-tailed (q ⁣< ⁣1q\!<\!1), softmax (q ⁣= ⁣1q\!=\!1) and compact-support (q ⁣> ⁣1q\!>\!1) attention at four granularities from a global scalar to a per-edge index, under a bounded reparameterization that starts every model at the GAT baseline. Across eight benchmarks at ten seeds, LTGA-Edge takes the best average rank (2.752.75), but the omnibus test does not reject (p ⁣= ⁣0.199p\!=\!0.199) and learning qq does not beat searching it: a validation-tuned frozen grid reaches 61.4%61.4\%, tuned αα-entmax 62.2%62.2\% and a capacity-matched q ⁣≡ ⁣1q\!\equiv\!1 control 62.0%62.0\%, against 61.7%61.7\% for LTGA-Edge. What the learned index buys is one run instead of a grid, and an interpretable mechanism: where qq leaves 11, it prunes 42%42\% of attention coefficients to exactly zero, and those edges are selectively the wrong ones, restoring them costs 7.17.1 points, while random pruning at the same rate costs 13.013.0 more. Project page: https://kleyt0n.github.io/ltga
Oct 13, 2026

Emergent Loop Geometry in Gauge-Equivariant Graph Neural Networks

Gauge-equivariant graph neural networks generate ordered products of gauge links through local message passing, but the geometry of these internal structures is not captured by the receptive field alone. We investigate the statistical ensemble of closed lattice walks generated by recursive node- and edge-feature operations, independently of network training. Analytical and numerical results reveal a separation between rapid growth of contour length and much slower spatial expansion: deeper compositions generate increasingly long paths through repeated traversal of relatively compact regions. Loop expansions of fermionic observables provide a physical interpretation of this hierarchy, showing how spatial locality remains compatible with high-order dependence on nearby gauge fields. These findings identify complementary roles of network depth in extending spatial reach and enriching the representations constructed within that reach, providing a geometrical perspective on learning lattice gauge observables.
Apr 22, 2026

Gauge-Equivariant Graph Neural Networks for Lattice Gauge Theories

Local gauge symmetry underlies fundamental interactions and strongly correlated quantum matter, yet existing machine-learning approaches lack a general, principled framework for learning under site-dependent symmetries, particularly for intrinsically nonlocal observables. Here we introduce a gauge-equivariant graph neural network that embeds non-Abelian symmetry directly into message passing via matrix-valued, gauge-covariant features and symmetry-compatible updates, extending equivariant learning from global to fully local symmetries. In this formulation, message passing implements gauge-covariant transport across the lattice, allowing nonlocal correlations and loop-like structures to emerge naturally from local operations. We validate the approach across pure gauge, gauge-matter, and dynamical regimes, establishing gauge-equivariant message passing as a general paradigm for learning in systems governed by local symmetry.