Beyond Parameters: Exploring Virtual Logic Depth for Scaling Laws
Not on the map. Why?
Abstract (arXiv)
Scaling large language models typically involves three dimensions: depth, width, and parameter count. In this work, we explore a fourth dimension, virtual logical depth (VLD), which increases effective algorithmic depth without changing parameter count by reusing weights. While parameter reuse is not new, its role in scaling has been underexplored. Unlike recent test-time methods that scale token-wise, VLD alters the internal computation graph during training and inference. Through controlled experiments, we obtain three key insights. (1) textitKnowledge capacity vs. parameters: at fixed parameter count, VLD leaves knowledge capacity nearly unchanged, while across models capacity still scales with parameters. (2) textitReasoning vs. reuse: properly implemented VLD substantially improves reasoning ability without more parameters, decoupling reasoning from size. This suggests a new scaling path beyond token-wise test-time methods. (3) textitRobustness and generality: reasoning gains persist across architectures and reuse schedules, showing VLD captures a general scaling behavior. These results provide insight into future scaling strategies and raise a deeper question: does superintelligence require ever-larger models, or can it be achieved by reusing parameters and increasing logical depth? We argue many unknown dynamics in scaling remain to be explored. Code is available at https://anonymous.4open.science/r/virtuallogicaldepth-8024/.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 28 of its 44 references that are in the map. First posted on arXiv 23 Jun 2025.
Builds on
28 of 44 references.
References · 28
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
- 2022Emergent Abilities of Large Language Modelscited by 2,512
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,986
- 2025A-MEM: Agentic Memory for LLM Agentscited by 1,063
16 more
- 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 839
- 2022Quantifying Memorization Across Neural Language Modelscited by 763
- 2018Universal Transformerscited by 647
- 2019Deep Equilibrium Modelscited by 615
- 2023Specializing Smaller Language Models towards Multi-Step Reasoningcited by 251
- 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 240
- 2023Looped Transformers are Better at Learning Learning Algorithmscited by 149
- 2024Physics of Language Models: Part 3.3, Knowledge Capacity Scaling Lawscited by 144
- 2024Physics of Language Models: Part 2.1, Grade-School Math and the Hidden Reasoning Processcited by 108
- 2024Not All Layers of LLMs Are Necessary During Inferencecited by 96
- 2021Lessons on Parameter Sharing across Layers in Transformerscited by 85
- 2024JetMoE: Reaching Llama2 Performance with 0.1M Dollarscited by 57
- 2024Self-evolving Agents with reflective and memory-augmented abilitiescited by 52
- 2021Subformer: Exploring Weight Sharing for Parameter Efficiency in Generative Transformerscited by 43
- 2021Leveraging redundancy in attention with Reuse Transformerscited by 33
- 2024Dynamic Layer Tying for Parameter-Efficient Transformerscited by 10
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Gated Recurrent Transformers: Expressive Depth through Recurrent Modulationcited by 4
- 2026Decoding Looped Transformers Better for (Almost) Freecited by 0
- 2026ALoDLM: Adaptively Looped Diffusion Language Modelscited by 0
- 2026Chain Dimension Scaling: Communication-Efficient Loop-Style Scaling for Industrial Short-Video Rankingcited by 0
- 2026Chain Dimension Scaling: Communication-Efficient Loop-Style Scaling for Industrial Short-Video Ranking12 Oct 2026
- 2026ALoDLM: Adaptively Looped Diffusion Language Models3 Oct 2026
- 2026Decoding Looped Transformers Better for (Almost) Free1 Oct 2026
- 2026Gated Recurrent Transformers: Expressive Depth through Recurrent Modulation15 Aug 2026
Similar, not cited
Close in wording, no citation either way
- 2025Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach
- 2025ParaThinker: Native Parallel Thinking as a New Paradigm to Scale LLM Test-time Compute
- 2026Think Deep, Not Just Long: Measuring LLM Reasoning Effort via Deep-Thinking Tokens
- 2025The Art of Scaling Test-Time Compute for Large Language Models
- 2025A Survey of Scaling in Large Language Model Reasoning
- 2025What Affects the Effective Depth of Large Language Models?
- 2025When Fewer Layers Break More Chains: Layer Pruning Harms Test-Time Scaling in LLMs
- 2025Inference-Time Scaling for Complex Tasks: Where We Stand and What Lies Ahead