跳到正文
arXiv:cs.AI· Helong Hu (Zhanjiang Campus, Guangdong Ocean University, Zhanjiang, Guangdong, China), Hongdan Pan (Maoming Administrative Service Center, Maoming, Guangdong, China), Shuiqing Hu (China Pacific Insurance)·· 16 小时前

FON:一种无需序列级二次注意力的起草-修订双器官语言模型

FON: A Draft-Revise Dual-Organ Language Model without Sequence-Level Quadratic Attention

AI 导读

FON(Fusion-Organ Network)将同一权重栈拆分出起草器官与修订器官,起草器官用多抽头可学习延迟加内容自适应递归,实现 O(S) 训练与 O(1) 解码状态,不做序列级二次注意力。

正文

Authors:Helong Hu (1), Hongdan Pan (2), Shuiqing Hu (3) ((1) Zhanjiang Campus, Guangdong Ocean University, Zhanjiang, Guangdong, China, (2) Maoming Administrative Service Center, Maoming, Guangdong, China, (3) China Pacific Insurance (Group) Co., Ltd. Foshan Branch, Foshan, Guangdong, China)

View PDF

Abstract:Self-attention assigns two functions to one mechanism-where to read and how to mix-at the price of O(L^2) training, an O(T) decode state, and position signals bound to the training length. Existing attention-free alternatives all optimize the single function of generation. We propose FON (Fusion-Organ Network), which differentiates one weight stack into a drafting organ (multi-tap learnable delays + content-adaptive recursion; causal, O(S) training, O(1) decode state, no sequence-level quadratic attention) and a revision organ that re-processes the written prefix through multi-scale ripple kernels injected via weak gates, never generating. At 30M parameters, iso-parameter and iso-token budget, FON reaches perplexity 131.03 on WikiText-103, beating Transformer (197.73) and Mamba2 (152.53); the advantage persists under all depth-aligned baselines and at the 70M tier (-20.8%). At 8x length extrapolation FON degrades by ~8-9% without positional-encoding engineering, between ALiBi and RoPE. The revision channel provides a structural pathway for in-domain infilling that causal architectures lack in principle (+19% over on-demand coupling), at a perplexity cost indistinguishable within measurement precision. We report all costs and boundaries: impaired long-range retrieval, synthetic-task disadvantages, weaker out-of-domain code infilling than a same-recipe Transformer, and a 6.5-12.3x wall-clock gap.
Comments: 24 pages, 14 figures, 9 tables
Subjects: Artificial Intelligence (cs.AI)
Cite as: arXiv:2610.16301 [cs.AI]
  (or arXiv:2610.16301v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2610.16301

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Helong Hu [view email]
[v1] Mon, 12 Oct 2026 07:28:24 UTC (2,118 KB)

来源:arXiv:cs.AI · arxiv.org