Summary
This paper introduces gradient-boosted attention, a novel attention mechanism that applies the principle of gradient boosting within a single Transformer attention layer. Standard attention computes a single softmax-weighted average over values, which is a one-pass estimate unable to correct its own errors. The proposed method adds a second attention pass, with its own learned projections, that attends to the prediction error of the first pass and applies a gated correction. Under a squared reconstruction objective, the construction maps onto Friedman's gradient boosting machine: each attention pass acts as a base learner and the per-dimension gate serves as the shrinkage parameter. The authors also show that a single Hopfield-style update erases all query information orthogonal to the stored-pattern subspace, and that further iteration under local contraction can collapse distinct query representations. Empirically, on a 10M-token subset of WikiText-103, gradient-boosted attention achieves a perplexity of 67.9 versus 72.2 for standard attention. Authored by Saleh Sargolzaei, the paper (arXiv:2604.03190) offers a theoretically grounded way to improve attention expressivity with minimal architectural change.
Overview
- Field: Machine Learning
- Author: Saleh Sargolzaei
- Published: 2026-04-03
- arXiv: 2604.03190
Summary
Transformer attention computes a single softmax-weighted average over values — a one-pass estimate that cannot correct its own errors. This paper introduces *gradient-boosted attention*, which applies the principle of gradient boosting within a single attention layer: a second attention pass, with its own learned projections, attends to the prediction error of the first and applies a gated correction.
Under a squared reconstruction objective, the construction maps onto Friedman's gradient boosting machine, with each attention pass acting as a base learner and the per-dimension gate serving as the shrinkage parameter.
The authors further show that a single Hopfield-style update erases all query information orthogonal to the stored-pattern subspace, and that further iteration under local contraction can collapse distinct query representations.
Results
On a 10M-token subset of WikiText-103, gradient-boosted attention achieves a perplexity of 67.9, compared with 72.2 for standard attention.
---
*Auto-collected on 2026-04-06.*
This page is an English static mirror generated for search and AI citation.
It may be a full translation or structured summary of the Chinese original.
Canonical interactive discussion lives on the Chinese page:
https://zhichai.net/topic/177169589