The interest in linear complexity models for large language models is on the rise, although their scaling capacity remains uncertain.In this study, we present the scaling laws for linear complexity language models to establish a foundation for their scalability.Specifically, we examine the scaling behaviors of three efficient linear architectures.These include TNL (Qin et al., 2024c), a linear attention model with data-independent decay; HGRN2 (Qin et al., 2024e), a linear RNN with data-dependent decay; and cosFormer2 (Qin et al., 2022b(Qin et al., , 2024a)), a linear attention model without decay.We also include LLaMA as a baseline architecture for comparison with softmax attention.These models were trained with six variants, ranging from 70M to 7B parameters on a 300B-token corpus, and evaluated with a total of 1,376 intermediate checkpoints on various downstream tasks.These tasks include validation loss, commonsense reasoning, and information retrieval and generation.The study reveals that existing linear complexity language models exhibit similar scaling capabilities as conventional transformer-based models while also demonstrating superior linguistic proficiency and knowledge retention.