Title: xLSTM Scaling Laws: Competitive Performance with Linear Time-Complexity
Primary area: foundation or frontier models, including LLMs
Keywords: xLSTM, Transformers, Scaling Laws, Sequence Modeling, TFLA, Linear Attention, Inference

Abstract: Scaling laws play a central role in the success of Large Language Models (LLMs), enabling the prediction of model performance relative to compute budgets prior to training.
While Transformers have been the dominant architecture, recent alternatives such as xLSTM offer linear complexity with respect to context length while remaining competitive in the billion-parameter regime.
We conduct a comparative investigation on the scaling behavior of Transformers and xLSTM along the following lines, providing insights to guide future model design and deployment.
First, we study the scaling behavior for xLSTM in compute-optimal and over-training regimes using both IsoFLOP and parametric fit approaches on a wide range of model sizes (80M-7B) and number of training tokens (2B-2T).
Second, we examine the dependence of optimal model sizes on context length, a pivotal aspect that was largely ignored in previous work. 
Finally, we analyze inference-time scaling characteristics.
Our findings reveal that in typical LLM training and inference scenarios, xLSTM scales favorably compared to Transformers.
Importantly, xLSTM's advantage widens as training and inference contexts grow.

TL;DR: Scaling laws for linear time-complexity xLSTM model, comparing against Transformers for both training and inference.