Skip to content
Preprint

Wiola 13M, a Gated Spiral Attention Architecture for Parameter Efficient Small Language Models

Jul 2026 · 0 citations · 12 references
Computer Science

TL;DR

Wiola is presented, a decoder only language model whose novelty is concentrated in three drop in components of every layer, and it is proved that the gated attention admits an exact and numerically verified equivalence between full sequence training and cached autoregressive decoding, so that no approximation is introduced at inference time.

Abstract

Small language models in the ten to one hundred million parameter range are attractive for on device inference, rapid experimentation, and controlled scientific study, yet most of them reuse the standard transformer block without adaptation to the small scale regime. We present Wiola, a decoder only language model whose novelty is concentrated in three drop in components of every layer. First, Spiral Rotary Positional Encoding perturbs the standard rotary frequencies by a slowly growing per dimension factor so that phase trajectories fan outward, improving long range discrimination while adding no parameters. Second, Gated Spiral Attention introduces a per head, content adaptive scalar gate derived from a causal cumulative statistic of the query stream, providing an implicit and differentiable form of soft head selection at negligible cost. Third, the Butterfly feed forward block replaces the conventional expansion layer with a multiplicative interaction and an intra block bypass path, matching the parameter count of a four times gated linear unit block while improving gradient flow in shallow stacks. We formalize each component, derive exact parameter and computation budgets, and prove that the gated attention admits an exact and numerically verified equivalence between full sequence training and cached autoregressive decoding, so that no approximation is introduced at inference time. We also describe a fully reproducible training and evaluation protocol on a standard tiny story corpus. The reference implementation is released as an open source package with weights ready publishing support.

View source

Similar papers

Preprint Jul 2026

Hidden Decoding at Scale: Latent Computation Scaling for Large Language Models

Scaling Large Language Models (LLMs) has been driven mainly by enlarging the Transformer backbone, but for an already-strong model this requires another round of costly pretraining. We study whether an existing backbone can keep improving by allocating more computation to each token while leaving the Transformer backbo...

Aiwei Liu, Cheng Shi, Chuhan Wu et al. · 2 citations

ResonatorLM: Causal Resonant Field Mixing for Efficient Long-Context Language Modeling

Contemporary language models are dominated by the transformer architecture, which leverages self-attention mechanisms to enable more efficient, parallelized training across a wide set of documents and corpora. This has allowed transformers to effectively model data across a wide range of modalities and contexts. Howeve...

Archie Chaudhury · 0 citations
#small language model Preprint Aug 2026

Daedalus-150M: A Convolution-Attention Hybrid Designed for CPU Inference

A conventional all-attention model of the same size on the same data and a conventional all-attention hybrid that beats GPT-2 124M, Pythia-160M, OPT-125M and GPT-neo-125M, and exceeds MobileLLM-125M's published score despite that model seeing a trillion tokens.

Christos Koutsiaris · 0 citations
Jul 2026

Convolution for Large Language Models

These results support depthwise convolution as a lightweight complement to self-attention for modeling short-range token interactions and suggest that the convolution makes repeated token IDs more sensitive to their immediate context.

Yu-Chuan Tian, Yingte Shu, Wei He et al. · 0 citations
Preprint Aug 2026

TreeWY: Speculative Verification for Gated DeltaNet Hybrids

A tree-structured WY transform of the gated delta rule is used, turning the freed HBM into higher throughput and much lower time-to-first-token (TTFT) wherever memory binds, and costing a few percent where it does not.

S. Ghantasala · 1 citation
#natural language process... Preprint Aug 2026

TANGO: Token-Aggregated Nonlinear Gating Operators for Natural and Formal Language Modeling

The TANGO model (Token-Aggregated Nonlinear Gating Operators), which replaces these two sublayers with one cross-token gated residual update, obtains the lowest mean validation negative log-likelihood on FineWeb-Edu, Lean, and DeepMind Mathematics, although it has the largest analytical forward-pass operation count.

Joshua Nunley · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.