Scaling Laws and Tradeoffs in Recurrent Networks of Expressive Neurons

arXiv:2605.12049 · cs.LG, cs.AI, cs.IT, cs.NE, math.IT · Submitted 2026-05-12 · Read on arXiv

cs.LG, cs.AI, cs.IT, cs.NE, math.IT

Submitted: 2026-05-12

Updated: 2026-10-26

Terminology

• Benchmark — 1× in this paper · explained in 2 episodes
• Expressive Leaky Memory — 1× in this paper
• Redundancy — 1× in this paper · explained in 2 episodes
• Scaling Laws — 1× in this paper · explained in 4 episodes
• Trace — 1× in this paper · explained in 2 episodes

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