paper-with-me

홈 › Papers

More Expressive Feedforward Layers: Part I. Token-Adaptive Mixing of Activations

2026-05-26 · Mingze Wang, Jinbo Wang, Yikuan Xia, Kai Shen, Shu Zhong arxiv

Feedforward network (FFN) layers account for a large fraction of parameters and nonlinear expressivity in Transformer-based large language models (LLMs). Despite the evolution from ReLU and GELU to gated variants such as SwiGLU, most FFN designs still use a single fixed activation function, applying the same nonlinear transformation to all tokens. In this work, we propose Mixture of Activations (MoA), a token-adaptive FFN design that mixes a dictionary of activation functions using lightweight input-dependent gates while sharing the same linear projections. As an input-independent counterpart, we also introduce learnable activations (LA), which form linear combinations of activation functions for both ReLU-type and SwiGLU-type FFNs. Theoretically, we establish strict finite-width expressive separations among fixed-activation FFNs, LA, and MoA: LA strictly contains fixed-activation FFNs, while MoA strictly contains LA, with the additional expressivity arising from input-dependent nonlinear hybridization. Empirically, we evaluate MoA through extensive pre-training experiments on dense and MoE language models ranging from 0.12B to 2B parameters under different token budgets, optimizers, and learning rate schedules. MoA consistently achieves lower terminal loss and exhibits more favorable scaling behavior than well-tuned baselines, with minimal parameter and computational overhead. These results suggest that token-adaptive activation mixing is a simple and effective mechanism for improving FFN expressivity in LLMs.

📄 PDF Abstract BibTeX arXiv:2605.26647

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On the Expressive Power of Transformers for Maxout Networks and Continuous Piecewise Linear Functions

2026-03-03 · Linyan Gu, Lihua Yang, Feng Zhou arxiv

Transformer networks have achieved remarkable empirical success across a wide range of applications, yet their theoretical expressive power remains insufficiently understood. In this paper, we study the expressive capabi…

Transformers Can Overcome the Curse of Dimensionality: A Theoretical Study from an Approximation Perspective

2025-04-18 · Yuling Jiao, Yanming Lai, Yang Wang, Bokai Yan

The Transformer model is widely used in various application areas of machine learning, such as natural language processing. This paper investigates the approximation of the H\"older continuous function class $\mathcal{H}…

CoLT5: Faster Long-Range Transformers with Conditional Computation

2023-03-17 · Joshua Ainslie, Tao Lei, Michiel de Jong, Santiago Ontañón 외

Many natural language processing tasks benefit from long inputs, but processing long documents with Transformers is expensive -- not only due to quadratic attention complexity but also from applying feedforward and proje…

Long-range modeling

Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation

2026-05-22 · Guoming Li, Shangyu Zhang, Junwei Pan, Wentao Ning 외 arxiv

Scaling recommendation models is a central challenge in recommender systems. Recently, RankMixer has emerged as an effective solution, operating on a unified token representation and alternating between token mixing and …

Analogies between Transformer Layers and Power Method

2026-05-25 · Chenglong Li, Claudio Altafini arxiv

In the paper we show that there is an analogy between the operations occurring in a layer of a transformer (projections and layer normalizations, disregarding the feedforward neural network) and a step in the power metho…