about
Lizard: An Efficient Linearization Framework for Large Language Models (arxiv.org)
2 points by simonpure on Jul 17, 2025 | hide | past | pdf | discuss on HN

In plain words: It converts a trained transformer into one whose attention cost grows slowly with sequence length, using small learnable modules that mimic softmax attention. Unlike earlier conversions, it nearly matches the original model, beating them by up to 24.5 points on a five-shot knowledge test.

Abstract

We propose Lizard, a linearization framework that transforms pretrained Transformer-based Large Language Models (LLMs) into subquadratic architectures. Transformers faces severe computational and memory bottlenecks with long sequences due to the quadratic complexity of softmax attention and the growing Key-Value (KV) cache that makes inference memory-bound by context length. Lizard addresses these limitations by introducing a subquadratic attention mechanism that closely approximates softmax attention while preserving model quality. Unlike prior linearization methods constrained by fixed, non-adaptive structures, Lizard augments the architecture with compact, learnable modules that enable adaptive memory control and robust length generalization. Moreover, we introduce a hardwareaware algorithm that solves numerical instability in gated attention to accelerate training. Extensive experiments show that Lizard achieves near-lossless recovery of its teacher model's performance, significantly outperforming previous methods by up to 9.4 - 24.5 points on the 5-shot MMLU benchmark and demonstrating superior associative recall.

Chien Van Nguyen, Huy Nguyen, Ruiyi Zhang, Hanieh Deilamsalehy, Puneet Mathur, Viet Dac Lai, Haoliang Wang, Jayakumar Subramanian, Ryan A. Rossi, Trung Bui, Nikos Vlassis, Franck Dernoncourt, et al.
arXiv:2507.09025 · cs.CL, cs.LG · submitted Jul 11, 2025 · updated Apr 18, 2026
abstract · pdf · html · ACL 2026 (Main)

add comment on HN