mlsanityData to 14 Oct 2026

CR-Net: Scaling Parameter-Efficient Training with Cross-Layer Low-Rank Structure

arXiv 2509.18993 ↗First posted 23 Sep 2025cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Low-rank architectures have become increasingly important for efficient large language model (LLM) pre-training, providing substantial reductions in both parameter complexity and memory/computational demands. Despite these advantages, current low-rank methods face three critical shortcomings: (1) compromised model performance, (2) considerable computational overhead, and (3) limited activation memory savings. To address these limitations, we propose Cross-layer Low-Rank residual Network (CR-Net), an innovative parameter-efficient framework inspired by our discovery that inter-layer activation residuals possess low-rank properties. CR-Net implements this insight through a dual-path architecture that efficiently reconstructs layer activations by combining previous-layer outputs with their low-rank differences, thereby maintaining high-rank information with minimal parameters. We further develop a specialized activation recomputation strategy tailored for CR-Net that dramatically reduces memory requirements. Extensive pre-training experiments across model scales from 60M to 7B parameters demonstrate that CR-Net consistently outperforms state-of-the-art low-rank frameworks while requiring fewer computational resources and less memory.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 56 of its 71 references that are in the map. First posted on arXiv 23 Sep 2025.

Builds on

56 of 71 references.

References · 56

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2024The Llama 3 Herd of Modelscited by 14,715
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  5. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  6. 2025Qwen3 Technical Reportcited by 8,820
  7. 2020Scaling Laws for Neural Language Modelscited by 6,586
  8. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  9. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  10. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  11. 2016Pointer Sentinel Mixture Modelscited by 3,096
  12. 2022Training Compute-Optimal Large Language Modelscited by 3,019
38 more
  1. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  2. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  3. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
  4. 2021Scaling Language Models: Methods, Analysis & Insights from Training Gophercited by 1,202
  5. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
  6. 2016Training Deep Nets with Sublinear Memory Costcited by 848
  7. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
  8. 2021Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LMcited by 632
  9. 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 519
  10. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
  11. 2023Symbolic Discovery of Optimization Algorithmscited by 434
  12. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
  13. 2023Fine-Tuning Language Models with Just Forward Passescited by 345
  14. 2024LoRA Learns Less and Forgets Lesscited by 328
  15. 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 265
  16. 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 204
  17. 2013Optimal rates for zero-order convex optimization: the power of two function evaluationscited by 198
  18. 2021The Low-Rank Simplicity Bias in Deep Networkscited by 154
  19. 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attentioncited by 131
  20. 2024MiniCache: KV Cache Compression in Depth Dimension for Large Language Modelscited by 125
  21. 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 108
  22. 2024Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learningcited by 82
  23. 2019A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimizationcited by 68
  24. 2023SWARM Parallelism: Training Large Models Can Be Surprisingly Communication-Efficientcited by 59
  25. 2024Variance-reduced Zeroth-Order Methods for Fine-Tuning Language Modelscited by 54
  26. 2024APOLLO: SGD-like Memory, AdamW-level Performancecited by 54
  27. 2024DenseFormer: Enhancing Information Flow in Transformers via Depth Weighted Averagingcited by 53
  28. 2024Enhancing Zeroth-order Fine-tuning for Language Models with Low-rank Structurescited by 50
  29. 2024SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretrainingcited by 45
  30. 2024Fira: Can We Achieve Full-rank Training of LLMs Under Low-rank Constraint?cited by 43
  31. 2024Memory-Efficient LLM Training with Online Subspace Descentcited by 39
  32. 2024LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statisticscited by 38
  33. 2024Tracing Representation Progression: Analyzing and Enhancing Layer-Wise Similaritycited by 36
  34. 2024Subspace Optimization for Large Language Models with Convergence Guaranteescited by 34
  35. 2023Mitigating Over-smoothing in Transformers via Regularized Nonlocal Functionalscited by 32
  36. 2022Fine-tuning Language Models over Slow Networks using Activation Compression with Guaranteescited by 30
  37. 2022Exploring Low Rank Training of Deep Neural Networkscited by 30
  38. 2023SPDF: Sparse Pre-training and Dense Fine-tuning for Large Language Modelscited by 28

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 6.

7 papers.