HyperAIHyperAI

Command Palette

Search for a command to run...

Vision Transformersにおけるキュムラントアテンション(学生アブストラクト)

Yuto Morimoto Zhipeng Wang Koji Yasuda

概要

トランスフォーマーモデルは、自然言語処理(NLP)やコンピュータビジョン(CV)をはじめとする多様なディープラーニング分野で顕著な成功を収めている。これらのモデルの課題の一つは、トランスフォーマーの中核コンポーネントであるsoftmaxアテンションの計算コストが、時間的にもメモリ的にも二次計算量を要する点にある。データ規模が拡大する中、このボトルネックを克服するための様々な試みが報告されている。本研究の目的は、効率性と精度を体系的に両立させる新たなアテンション機構「キュムラントアテンション」を提案することである。本提案は、統計力学の視点と、キュムラント展開に基づく信頼性の高い近似をアテンション層に導入するものである。低次数変種は、線形アテンションと同様に計算量を線形オーダーに低減しつつ、softmaxアテンションの非線形性を保持する。CVタスクにおける複数の変種を評価しており、ImageNet-100を用いたViTによる画像分類や、UCF-101を用いたViViTによる動画分類が含まれる。実験結果により、キュムラントアテンションが線形アテンションを上回る性能を示し、softmaxアテンションと同等の精度を達成することが実証された。これらの知見は本手法の有効性を裏付けるとともに、より大規模なモデルへのスケーリング、他モダリティへの拡張、GPUハードウェア向けの実装最適化など、今後の研究方向性を示している。

One-sentence Summary

Researchers at Nagoya University's Institute of Materials and Systems for Sustainability propose Cumulant Attention, an attention mechanism that applies cumulant expansion from statistical mechanics to approximate softmax attention at linear computational complexity while preserving its nonlinearity, outperforming linear attention and matching softmax accuracy on ViT-based image and video classification tasks.

Key Contributions

  • The paper introduces Cumulant Attention, an attention mechanism that incorporates a statistical-mechanics perspective and cumulant expansion into the transformer attention layer to balance efficiency and accuracy.

  • A low-order variant of Cumulant Attention reduces attention computation to linear order while preserving nonlinear behavior associated with softmax attention.

  • Experiments on image classification with ViT on ImageNet-100 and video classification with ViViT on UCF-101 show that Cumulant Attention outperforms linear attention and achieves accuracy comparable to softmax attention.

Introduction

Transformer attention powers modern models across language, vision, speech, graphs, and multimodal tasks, but its standard softmax attention scales quadratically with sequence length, creating a serious efficiency bottleneck for large-scale data. Prior efficient attention methods, such as linear attention, reduce cost through kernelized approximations, yet they can struggle with spatial selectivity and local feature extraction in computer vision. The authors leverage ideas from statistical mechanics to design an efficient attention mechanism that interprets attention through physical concepts and cumulants, aiming to retain expressive relevance modeling while reducing computational overhead. Their method achieves strong performance on CV tasks, outperforming linear attention and approaching softmax attention accuracy.

Method

The authors recast standard scaled dot product attention as a gradient of a statistical mechanical free energy. They consider the tokens xlx^lxl as possible states of a random variable XXX, uniformly drawn from the set of LLL keys. The query side is treated as an external field, with the field direction determined by the query-key interaction through the usual key and query projections. The partition function is defined as

Z(p)=⟨exp⁡(p⋅X)⟩,Z(p) = \langle \exp(p \cdot X) \rangle,Z(p)=⟨exp(p⋅X)⟩,

and the log partition function

F(p)=log⁡Z(p)F(p) = \log Z(p)F(p)=logZ(p)

plays the role of a negative free-energy potential. Differentiating this quantity with respect to the external field gives the normalized expectation under a Boltzmann-type distribution,

∂F(p)∂p=∑l=1Lxlexp⁡(p⋅xl)∑l=1Lexp⁡(p⋅xl).\frac{\partial F(p)}{\partial p} = \frac{\sum_{l=1}^L x^l \exp(p \cdot x^l)} {\sum_{l=1}^L \exp(p \cdot x^l)}.∂p∂F(p)​=∑l=1L​exp(p⋅xl)∑l=1L​xlexp(p⋅xl)​.

After applying the value projection and the usual query-key scaling, this derivative reproduces the attention output,

attn⁡(q)=∑j=1Lexp⁡(q⋅kj)vj∑j=1Lexp⁡(q⋅kj).\operatorname{attn}(q) = \frac{\sum_{j=1}^L \exp(q \cdot k^j) v^j} {\sum_{j=1}^L \exp(q \cdot k^j)}.attn(q)=∑j=1L​exp(q⋅kj)∑j=1L​exp(q⋅kj)vj​.

Thus, attention is interpreted not merely as a learned mixture of value vectors, but as the response of a physical system to an external field. The softmax denominator corresponds to the partition function, and attention corresponds to the derivative of the free-energy potential.

The second central idea is to approximate the free-energy potential using a cumulant expansion. Cumulants are coefficients in the power series expansion of log⁡Z(p)\log Z(p)logZ(p) and represent correlations among random variables. The first cumulant is the mean, the second cumulant is the covariance, and higher cumulants describe genuine higher-order statistical dependence. The expansion takes the form

F(p)=F(0)+∑ipi⟨Xi⟩+∑ijpipj2(⟨XiXj⟩−⟨Xi⟩⟨Xj⟩)+∑ijkpipjpk3!⟨XiXjXk⟩c+⋯\begin{aligned} F(p) = F(0) &+ \sum_i p_i \langle X_i \rangle + \sum_{ij} \frac{p_i p_j}{2} \left( \langle X_i X_j \rangle - \langle X_i \rangle \langle X_j \rangle \right) \\ &+ \sum_{ijk} \frac{p_i p_j p_k}{3!} \langle X_i X_j X_k \rangle_c + \cdots \end{aligned}F(p)=F(0)​+i∑​pi​⟨Xi​⟩+ij∑​2pi​pj​​(⟨Xi​Xj​⟩−⟨Xi​⟩⟨Xj​⟩)+ijk∑​3!pi​pj​pk​​⟨Xi​Xj​Xk​⟩c​+⋯​

where the third central cumulant is

⟨XiXjXk⟩c=⟨XiXjXk⟩−⟨XiXj⟩⟨Xk⟩−⟨XjXk⟩⟨Xi⟩−⟨XkXi⟩⟨Xj⟩+2⟨Xi⟩⟨Xj⟩⟨Xk⟩.\begin{aligned} \langle X_i X_j X_k \rangle_c = &\langle X_i X_j X_k \rangle - \langle X_i X_j \rangle \langle X_k \rangle - \langle X_j X_k \rangle \langle X_i \rangle \\ &- \langle X_k X_i \rangle \langle X_j \rangle + 2 \langle X_i \rangle \langle X_j \rangle \langle X_k \rangle. \end{aligned}⟨Xi​Xj​Xk​⟩c​=​⟨Xi​Xj​Xk​⟩−⟨Xi​Xj​⟩⟨Xk​⟩−⟨Xj​Xk​⟩⟨Xi​⟩−⟨Xk​Xi​⟩⟨Xj​⟩+2⟨Xi​⟩⟨Xj​⟩⟨Xk​⟩.​

The method truncates this expansion to obtain a controlled approximation to attention. Keeping only the first and second cumulants yields the second-order cumulant attention

attn⁡2nd=Lvˉ+∑l=1L[q⋅(kl−kˉ)](vl−vˉ),\operatorname{attn}_{\mathrm{2nd}} = L \bar{v} + \sum_{l=1}^L \left[ q \cdot (k^l - \bar{k}) \right] (v^l - \bar{v}),attn2nd​=Lvˉ+l=1∑L​[q⋅(kl−kˉ)](vl−vˉ),

where kˉ\bar{k}kˉ and vˉ\bar{v}vˉ denote the average key and value vectors, respectively. This expression replaces the softmax normalization with an additive correction built from centered key-value statistics. The leading correction to this approximation comes from the diagonal part of the third cumulant, producing

attn⁡3rd=attn⁡2nd+12∑l=1L∑iqi2(kil−kˉi)2(vl−vˉ).\operatorname{attn}_{\mathrm{3rd}} = \operatorname{attn}_{\mathrm{2nd}} + \frac{1}{2} \sum_{l=1}^L \sum_i q_i^2 (k_i^l - \bar{k}_i)^2 (v^l - \bar{v}).attn3rd​=attn2nd​+21​l=1∑L​i∑​qi2​(kil​−kˉi​)2(vl−vˉ).

In this formulation, the approximation operates through moments of the key and value embeddings. Second-order attention corresponds to retaining mean and covariance information, which is equivalent to assuming that the underlying statistical variables follow a multivariate normal distribution. The third-order term introduces additional dependence on higher-order embedding correlations and serves as a systematic correction to that Gaussian approximation. A notable property of the cumulant formulation is that the linked-cluster theorem removes the denominator, yielding an additive approximation whose structure is determined by centered key-value moments.

Experiment

Experiments evaluated Cumulant Attention on image and video classification using ViT on ImageNet-100 and ViViT on UCF-101. The results show that cumulant attention consistently outperforms linear attention and approaches softmax attention, reflecting its selective capability and more localized attention patterns. A similar trend is observed for video classification, although the model tends to overfit because of the small dataset size.


AIでAIを構築

アイデアからローンチまで — 無料のAIコーディング支援、すぐに使える環境、最高のGPU価格でAI開発を加速。

AI コーディング補助
すぐに使える GPU
最適な料金体系

HyperAI Newsletters

最新情報を購読する
北京時間 毎週月曜日の午前9時 に、その週の最新情報をメールでお届けします
メール配信サービスは MailChimp によって提供されています