提出新型无归一化函数Derf,性能超越现有方法。
Stronger Normalization-Free Transformers
- 设计新激活函数Derf,基于误差函数改进稳定性与表现
- 在视觉、语音、生物序列等多领域超越层归一化和DyT
- 优势来自泛化能力提升,适合追求高性能的Transformer架构
尽管归一化层长期被视为深度学习架构的必要组件,但近期提出的动态双曲正切(DyT)表明替代方案是可行的。本文研究点对点函数的内在特性如何影响训练与性能,并通过大规模搜索发现一种更优设计:$ \mathrm{Derf}(x) = \mathrm{erf}(αx + s)$,其中$ \mathrm{erf}(x)$为缩放后的高斯累积分布函数。Derf在视觉识别与生成、语音表征、DNA序列建模等多个领域均优于层归一化(LayerNorm)、RMSNorm及DyT。分析表明,其性能提升主要源于更强的泛化能力而非拟合能力。该函数结构简单且效果显著,是无归一化Transformer架构的理想选择。
原文摘要 · Abstract (English)
Although normalization layers have long been viewed as indispensable components of deep learning architectures, the recent introduction of Dynamic Tanh (DyT) has demonstrated that alternatives are possible. The point-wise function DyT constrains extreme values for stable convergence and reaches normalization-level performance; this work seeks further for function designs that can surpass it. We first study how the intrinsic properties of point-wise functions influence training and performance. Building on these findings, we conduct a large-scale search for a more effective function design. Through this exploration, we introduce $\mathrm{Derf}(x) = \mathrm{erf}(αx + s)$, where $\mathrm{erf}(x)$ is the rescaled Gaussian cumulative distribution function, and identify it as the most performant design. Derf outperforms LayerNorm, RMSNorm, and DyT across a wide range of domains, including visual recognition and generation, speech representation, and DNA sequence modeling. Our analysis also suggests that the performance gains of Derf largely stem from its improved generalization rather than stronger fitting capacity. Its simplicity and stronger performance make Derf a practical choice for normalization-free Transformer architectures.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。