Compute-Optimal Scaling Laws for Spiking Language Models

arXiv:2610.15146 · cs.LG, cs.CL, cs.NE · Submitted 2026-10-10 · Read on arXiv

cs.LG, cs.CL, cs.NE

Submitted: 2026-10-10

Updated: 2026-10-10

Terminology

• Scaling Laws — 1× in this paper · explained in 4 episodes

Sources

• Scaling Laws for Neural Language Models
• Surrogate Gradient Learning in Spiking Neural Networks
• Reconciling Kaplan and Chinchilla Scaling Laws
• The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scale
• RWKV: Reinventing RNNs for the Transformer Era
• Scaling Laws for Linear Complexity Language Models
• SpikeLLM: Scaling up Spiking Neural Network to Large Language Models via Saliency-based Spiking
• Feature Learning in Infinite-Width Neural Networks
• Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks