跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2311.11091 · v4

Deep Tensor Network

深度张量网络

首次提交 2023-11-18 22:41
版本更新 2026-11-10 01:26
雷达观测 2026-11-10 15:22
arXiv ↗PDF ↗

摘要

The Deep Tensor Network is a family of sequence operators built from contractions of queries, keys, and values. Tensor Attention mixes tokens through the Gram operators Q(K⊤K)Q⊤Q(K^\top K)Q^\top and K(Q⊤Q)K⊤K(Q^\top Q)K^\top; Tensor Interaction mixes channels through operators derived from C=Q⊤KC=Q^\top K. Associativity lets us evaluate these products exactly without forming n×nn\times n token matrices. For query/key width dd and value width dvd_v, the Gram constructions use O(d2+ddv)O(d^2+dd_v) work and summary state per causal token, or O(d2)O(d^2) when dv=O(d)d_v=O(d). We derive prefix recurrences and distinguish trace, diagonal, and row normalization, including the conditions under which the weights are nonnegative and row-stochastic. The unmasked token operators are positive semidefinite with rank at most dd, but their entries can be negative. We also give exact evaluations and costs for Hadamard and matrix-exponential variants.

AI 论文解读

基于摘要 · 非全文审阅

提出由查询、键、值收缩构成的序列算子族,利用结合律以 O(d²+dd_v) 的逐 token 工作量精确计算 Gram 型混合,而无需构造 n×n 的 token 矩阵。

正在读取账号与研究记录…

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-10 01:26 · 最新观测版本

Deep Tensor Network

The Deep Tensor Network is a family of sequence operators built from contractions of queries, keys, and values. Tensor Attention mixes tokens through the Gram operators Q(K⊤K)Q⊤Q(K^\top K)Q^\top and K(Q⊤Q)K⊤K(Q^\top Q)K^\top; Tensor Interaction mixes channels through operators derived from C=Q⊤KC=Q^\top K. Associativity lets us evaluate these products exactly without forming n×nn\times n token matrices. For query/key width dd and value width dvd_v, the Gram constructions use O(d2+ddv)O(d^2+dd_v) work and summary state per causal token, or O(d2)O(d^2) when dv=O(d)d_v=O(d). We derive prefix recurrences and distinguish trace, diagonal, and row normalization, including the conditions under which the weights are nonnegative and row-stochastic. The unmasked token operators are positive semidefinite with rank at most dd, but their entries can be negative. We also give exact evaluations and costs for Hadamard and matrix-exponential variants.

查看此版本解读 →查看此版本原文 ↗