mlsanityData to 7 Oct 2026

VersatileFFN: Achieving Parameter Efficiency in LLMs via Adaptive Wide-and-Deep Reuse

arXiv 2512.14531 ↗First posted 16 Dec 2025cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

The rapid scaling of Large Language Models (LLMs) has achieved remarkable performance, but it also leads to prohibitive memory costs. Existing parameter-efficient approaches such as pruning and quantization mainly compress pretrained models without enhancing architectural capacity, thereby hitting the representational ceiling of the base model. In this work, we propose VersatileFFN, a novel feed-forward network (FFN) that enables flexible reuse of parameters in both width and depth dimensions within a fixed parameter budget. Inspired by the dual-process theory of cognition, VersatileFFN comprises two adaptive pathways: a width-versatile path that generates a mixture of sub-experts from a single shared FFN, mimicking sparse expert routing without increasing parameters, and a depth-versatile path that recursively applies the same FFN to emulate deeper processing for complex tokens. A difficulty-aware gating dynamically balances the two pathways, steering "easy" tokens through the efficient width-wise route and allocating deeper iterative refinement to "hard" tokens. Crucially, both pathways reuse the same parameters, so all additional capacity comes from computation rather than memory. Experiments across diverse benchmarks and model scales demonstrate the effectiveness of the method. The code is available at https://github.com/huawei-noah/noah-research/tree/master/VersatileFFN.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 50 of its 63 references that are in the map. First posted on arXiv 16 Dec 2025.

Builds on

50 of 63 references.

References · 50

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  2. 2025Qwen3 Technical Reportcited by 8,195
  3. 2020Scaling Laws for Neural Language Modelscited by 6,411
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2025Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilitiescited by 3,655
  6. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  7. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  8. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  9. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  10. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  11. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  12. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
38 more
  1. 2024Mixtral of Expertscited by 1,785
  2. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
  3. 2019Root Mean Square Layer Normalizationcited by 1,425
  4. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
  5. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
  6. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  7. 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 834
  8. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  9. 2018Universal Transformerscited by 613
  10. 2025Kimi K2: Open Agentic Intelligencecited by 523
  11. 2023LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Compositioncited by 359
  12. 20242 OLMo 2 Furiouscited by 302
  13. 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
  14. 2023Looped Transformers as Programmable Computerscited by 224
  15. 2025Reasoning with Latent Thoughts: On the Power of Looped Transformerscited by 223
  16. 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 187
  17. 2024Mixture of LoRA Expertscited by 179
  18. 2025Hierarchical Reasoning Modelcited by 167
  19. 2025Scaling Latent Reasoning via Looped Language Modelscited by 145
  20. 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Modelscited by 140
  21. 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 120
  22. 2024Looped Transformers for Length Generalizationcited by 91
  23. 2024Harder Tasks Need More Experts: Dynamic Routing in MoE Modelscited by 71
  24. 2024Can Looped Transformers Learn to Implement Multi-step Gradient Descent for In-context Learning?cited by 60
  25. 2024MoE++: Accelerating Mixture-of-Experts Methods with Zero-Computation Expertscited by 55
  26. 2024ReMoE: Fully Differentiable Mixture-of-Experts with ReLU Routingcited by 53
  27. 2025A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformerscited by 49
  28. 2024Mixture Compressor for Mixture-of-Experts LLMs Gains Morecited by 38
  29. 2021Dynamic Resolution Networkcited by 31
  30. 2024STBLLM: Breaking the 1-Bit Barrier with Structured Binary LLMscited by 31
  31. 2024HyperMoE: Towards Better Mixture of Experts via Transferring Among Expertscited by 25
  32. 2025FloE: On-the-Fly MoE Inference on Memory-constrained GPUcited by 9
  33. 2025EAQuant: Enhancing Post-Training Quantization for MoE Models via Expert-Aware Optimizationcited by 9
  34. 2025Towards a Comprehensive Scaling Law of Mixture-of-Expertscited by 9
  35. 2024Revisiting SMoE Language Models by Evaluating Inefficiencies with Task Specific Expert Pruningcited by 8
  36. 2022Redistribution of Weights and Activations for AdderNet Quantizationcited by 3
  37. 2025Pangu Light: Weight Re-Initialization for Pruning and Accelerating LLMscited by 3
  38. 2025FLRC: Fine-grained Low-Rank Compressor for Efficient LLM Inferencecited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025RevFFN: Memory-Efficient Full-Parameter Fine-Tuning of Mixture-of-Experts LLMs with Reversible Blocks
  2. 2025From Dense to Dynamic: Token-Difficulty Driven MoEfication of Pre-Trained LLMs
  3. 2026Adaptive Depth Sparse Framework: Similarity-Driven Resource Allocation for Pre-Trained LLMs
  4. 2025Beyond Sunk Costs: Boosting LLM Pre-training Efficiency via Orthogonal Growth of Mixture-of-Experts
  5. 2026Efficient Scaling of LLM Training with Flexible Context Parallelism
  6. 2025Speed Always Wins: A Survey on Efficient Architectures for Large Language Models
  7. 2025Generalizing Scaling Laws for Dense and Sparse Large Language Models
  8. 2024Duo-LLM: A Framework for Studying Adaptive Computation in Large Language Models