mlsanityData to 7 Oct 2026

Cuttlefish: Low-Rank Model Training without All the Tuning

arXiv 2305.02538 ↗First posted 4 May 2023cs.LGcited by 25

Not on the map. Why?

Abstract (arXiv)

Recent research has shown that training low-rank neural networks can effectively reduce the total number of trainable parameters without sacrificing predictive accuracy, resulting in end-to-end speedups. However, low-rank model training necessitates adjusting several additional factorization hyperparameters, such as the rank of the factorization at each layer. In this paper, we tackle this challenge by introducing Cuttlefish, an automated low-rank training approach that eliminates the need for tuning factorization hyperparameters. Cuttlefish leverages the observation that after a few epochs of full-rank training, the stable rank (i.e., an approximation of the true rank) of each layer stabilizes at a constant value. Cuttlefish switches from full-rank to low-rank training once the stable ranks of all layers have converged, setting the dimension of each factorization to its corresponding stable rank. Our results show that Cuttlefish generates models up to 5.6 times smaller than full-rank models, and attains up to a 1.2 times faster end-to-end training process while preserving comparable accuracy. Moreover, Cuttlefish outperforms state-of-the-art low-rank model training methods and other prominent baselines. The source code for our implementation can be found at: https://github.com/hwang595/Cuttlefish.

Key facts. Cited by 25 papers in the map (data through 7 Oct 2026). Builds on 63 of its 81 references that are in the map. First posted on arXiv 4 May 2023.

Builds on

63 of 81 references.

References · 63

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  5. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  6. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  7. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  8. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  9. 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
  10. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  11. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  12. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
38 more
  1. 2016Wide Residual Networkscited by 3,057
  2. 2019Advances and Open Problems in Federated Learningcited by 3,021
  3. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  4. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  5. 2016Xception: Deep Learning with Depthwise Separable Convolutionscited by 2,320
  6. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  9. 2020Reformer: The Efficient Transformercited by 1,658
  10. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,479
  11. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  12. 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,441
  13. 2017ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devicescited by 1,194
  14. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  15. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  16. 2016SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model sizecited by 1,054
  17. 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 829
  18. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  19. 2013Network In Networkcited by 600
  20. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  21. 2018Rethinking the Value of Network Pruningcited by 595
  22. 2020Federated Learning with Matched Averagingcited by 564
  23. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  24. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  25. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  26. 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 413
  27. 2021ResMLP: Feedforward networks for image classification with data-efficient trainingcited by 338
  28. 2021A Field Guide to Federated Optimizationcited by 312
  29. 2018Slimmable Neural Networkscited by 301
  30. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
  31. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
  32. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  33. 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
  34. 2019Universally Slimmable Networks and Improved Training Techniquescited by 219
  35. 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 212
  36. 2017Incremental Network Quantization: Towards Lossless CNNs with Low-Precision Weightscited by 211
  37. 2016Trained Ternary Quantizationcited by 203
  38. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160

50 most cited of 63 All 63 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 5; 2024: 11; 2025: 5; 2026: 4.

25 papers.

Sort:

By area:

  1. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
  2. 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 104
  3. 2023LLM360: Towards Fully Transparent Open-Source LLMscited by 100
  4. 2025Efficient-vDiT: Efficient Video Diffusion Transformers With Attention Tilecited by 26
  5. 2024From Low Rank Gradient Subspace Stabilization to Low-Rank Weights: Observations, Theories, and Applicationscited by 24
  6. 2024CHAI: Clustered Head Attention for Efficient LLM Inferencecited by 13
  7. 2024Parameter-Efficient Fine-Tuning of State Space Modelscited by 11
  8. 2023InRank: Incremental Low-Rank Learningcited by 10
  9. 2023Maestro: Uncovering Low-Rank Structures via Trainable Decompositioncited by 8
  10. 2025AltLoRA: Towards Better Gradient Approximation in Low-Rank Adaptation with Alternating Projectionscited by 8
  11. 2024FRUGAL: Memory-Efficient Optimization by Reducing State Overhead for Scalable Trainingcited by 7
  12. 2024LoRTA: Low Rank Tensor Adaptation of Large Language Modelscited by 5
13 more
  1. 2024Characterizing the Accuracy -- Efficiency Trade-off of Low-rank Decomposition in Language Modelscited by 4
  2. 2023Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning Dynamicscited by 3
  3. 2024Full-Rank No More: Low-Rank Weight Training for Modern Speech Recognition Modelscited by 3
  4. 2026MemoryLLM: Plug-n-Play Interpretable Feed-Forward Memory for Transformerscited by 3
  5. 2024SwitchLoRA: Switched Low-Rank Adaptation Can Learn Full-Rank Informationcited by 2
  6. 2025HRP: High-Rank Preheating for Superior LoRA Initializationcited by 1
  7. 2025On the Duality between Gradient Transformations and Adapterscited by 1
  8. 2025Q3R: Quadratic Reweighted Rank Regularizer for Effective Low-Rank Trainingcited by 1
  9. 2024AB-Training: A Communication-Efficient Approach for Distributed Low-Rank Learningcited by 0
  10. 2024On Sampling Strategies for Spectral Model Shardingcited by 0
  11. 2026LRD-MPC: Efficient MPC Inference through Low-rank Decompositioncited by 0
  12. 2026TIDE: Every Layer Knows the Token Beneath the Contextcited by 0
  13. 2026Spectral Weight Decay: Inducing Low-Rank Structure in Neural Network Weightscited by 0