Random Recursive Models
cs.LG, cs.AI
Submitted: 2026-09-30
Updated: 2026-09-30
Code: https://github.com/kulinshah98/llm-reasoning-logic-puzzles
License: http://creativecommons.org/licenses/by/4.0/
The gist: Recursive models create computational depth through parameter reuse, offering a parameter-efficient alternative to increasing model size.
Abstract
Recursive models create computational depth through parameter reuse, offering a parameter-efficient alternative to increasing model size. However, most recursive models repeatedly apply one learned transformation or a prescribed sequence of transformations, restricting computation to a fixed layer order. We introduce the Random Recursive Model (RRM), which maintains a pool of L learned layers and performs T recursive steps by sampling one layer independently with replacement for each example and step. This enables flexible layer reuse while retaining the parameter efficiency of recurrence. We evaluate RRM on challenging reasoning tasks, where it matches or exceeds the baselines, often with 50-75 % fewer parameters. RRM can vary its depth at inference, including beyond that seen during training, without retraining or adding parameters, improving tasks that benefit from deeper iterative computation. RRM also supports Monte Carlo inference and probabilistic test-time scaling, both of which improve performance without retraining. These insights may open new directions in neural network architecture design.
Sources
- Relaxed Recursive Transformers: Effective Parameter Sharing with Layer-wise LoRA
- Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computation
- PonderNet: Learning to Ponder
- End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking
- Conditional Computation in Neural Networks for faster models
- Inner Thinking Transformer: Leveraging Dynamic Depth Scaling to Foster Adaptive Internal Thinking
- On the Measure of Intelligence
- Towards Distributed Neural Architectures
- Universal Transformers
- An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale
- Reducing Transformer Depth on Demand with Structured Dropout
- Looped Transformers for Length Generalization
- PathNet: Evolution Channels Gradient Descent in Super Neural Networks
- LayerShuffle: Enhancing Robustness in Vision Transformers by Randomizing Layer Execution Order
- Adaptive Computation Time for Recurrent Neural Networks
- Deep Networks with Stochastic Depth
- Less is More: Recursive Reasoning with Tiny Networks
- Modular Networks: Learning to Decompose Neural Computation
- ALBERT: A Lite BERT for Self-supervised Learning of Language Representations
- FractalNet: Ultra-Deep Neural Networks without Residuals
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