Krause Synchronization Transformers
Jingkun Liu, Yisong Yue, Max Welling, Yue Song
TL;DR
Krause Attention replaces global dot-product attention with distance-based, bounded-confidence interactions, promoting local, selective token coupling and mitigating attention sinks. Grounded in Krause consensus dynamics and analyzed via interacting-particle and mean-field frameworks, it yields multi-cluster token coordination and linear-time complexity $O(N W d)$ instead of $O(N^2 d)$. Empirically, Krause Transformers show consistent gains across vision, autoregressive generation, and LLMs, with improved robustness and reduced computation. This approach introduces a principled inductive bias for scalable, dynamics-aware Transformer design, preserving diversity while enabling coherent local coordination.
Abstract
Self-attention in Transformers relies on globally normalized softmax weights, causing all tokens to compete for influence at every layer. When composed across depth, this interaction pattern induces strong synchronization dynamics that favor convergence toward a dominant mode, a behavior associated with representation collapse and attention sink phenomena. We introduce Krause Attention, a principled attention mechanism inspired by bounded-confidence consensus dynamics. Krause Attention replaces similarity-based global aggregation with distance-based, localized, and selectively sparse interactions, promoting structured local synchronization instead of global mixing. We relate this behavior to recent theory modeling Transformer dynamics as interacting particle systems, and show how bounded-confidence interactions naturally moderate attention concentration and alleviate attention sinks. Restricting interactions to local neighborhoods also reduces runtime complexity from quadratic to linear in sequence length. Experiments across vision (ViT on CIFAR/ImageNet), autoregressive generation (MNIST/CIFAR-10), and large language models (Llama/Qwen) demonstrate consistent gains with substantially reduced computation, highlighting bounded-confidence dynamics as a scalable and effective inductive bias for attention.
