LGAICLJan 27

Explicit Multi-head Attention for Inter-head Interaction in Large Language Models

arXiv:2601.19611v1h-index: 15
Originality Incremental advance
AI Analysis

This work addresses efficiency and performance bottlenecks in Transformer-based models, offering a practical solution for memory-constrained applications, though it is incremental as it builds on existing attention mechanisms.

The paper tackles the problem of enhancing attention performance in large language models by proposing Multi-head Explicit Attention (MEA), which explicitly models cross-head interaction, resulting in faster convergence, lower validation loss, and a 50% reduction in KV-cache memory usage with minimal performance loss.

In large language models built upon the Transformer architecture, recent studies have shown that inter-head interaction can enhance attention performance. Motivated by this, we propose Multi-head Explicit Attention (MEA), a simple yet effective attention variant that explicitly models cross-head interaction. MEA consists of two key components: a Head-level Linear Composition (HLC) module that separately applies learnable linear combinations to the key and value vectors across heads, thereby enabling rich inter-head communication; and a head-level Group Normalization layer that aligns the statistical properties of the recombined heads. MEA shows strong robustness in pretraining, which allows the use of larger learning rates that lead to faster convergence, ultimately resulting in lower validation loss and improved performance across a range of tasks. Furthermore, we explore the parameter efficiency of MEA by reducing the number of attention heads and leveraging HLC to reconstruct them using low-rank "virtual heads". This enables a practical key-value cache compression strategy that reduces KV-cache memory usage by 50% with negligible performance loss on knowledge-intensive and scientific reasoning tasks, and only a 3.59% accuracy drop for Olympiad-level mathematical benchmarks.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes