mlsanityData to 7 Oct 2026

COAP: Memory-Efficient Training with Correlation-Aware Gradient Projection

arXiv 2412.00071 ↗First posted 26 Nov 2024cs.LG cs.AI cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

Training large-scale neural networks in vision, and multimodal domains demands substantial memory resources, primarily due to the storage of optimizer states. While LoRA, a popular parameter-efficient method, reduces memory usage, it often suffers from suboptimal performance due to the constraints of low-rank updates. Low-rank gradient projection methods (e.g., GaLore, Flora) reduce optimizer memory by projecting gradients and moment estimates into low-rank spaces via singular value decomposition or random projection. However, they fail to account for inter-projection correlation, causing performance degradation, and their projection strategies often incur high computational costs. In this paper, we present COAP (Correlation-Aware Gradient Projection), a memory-efficient method that minimizes computational overhead while maintaining training performance. Evaluated across various vision, language, and multimodal tasks, COAP outperforms existing methods in both training speed and model performance. For LLaMA-1B, it reduces optimizer memory by 61% with only 2% additional time cost, achieving the same PPL as AdamW. With 8-bit quantization, COAP cuts optimizer memory by 81% and achieves 4x speedup over GaLore for LLaVA-v1.5-7B fine-tuning, while delivering higher accuracy.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 51 of its 67 references that are in the map. First posted on arXiv 26 Nov 2024.

Builds on

51 of 67 references.

References · 51

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  5. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  6. 2023GPT-4 Technical Reportcited by 18,132
  7. 2024The Llama 3 Herd of Modelscited by 14,192
  8. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  9. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  10. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  11. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  12. 2023Visual Instruction Tuningcited by 7,792
38 more
  1. 2020Scaling Laws for Neural Language Modelscited by 6,411
  2. 2023BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Modelscited by 6,069
  3. 2022Scalable Diffusion Models with Transformerscited by 5,931
  4. 2023Adding Conditional Control to Text-to-Image Diffusion Modelscited by 5,466
  5. 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
  6. 2023Improved Baselines with Visual Instruction Tuningcited by 4,362
  7. 2023SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesiscited by 4,290
  8. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  9. 2023PaLM-E: An Embodied Multimodal Language Modelcited by 2,037
  10. 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,881
  11. 2019ZeRO: Memory Optimizations Toward Training Trillion Parameter Modelscited by 1,278
  12. 2017Mixed Precision Trainingcited by 1,135
  13. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 896
  14. 2016Training Deep Nets with Sublinear Memory Costcited by 825
  15. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
  16. 2024SiT: Exploring Flow and Diffusion-based Generative Models with Scalable Interpolant Transformerscited by 707
  17. 2024Representation Alignment for Generation: Training Diffusion Transformers Is Easier Than You Thinkcited by 666
  18. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
  19. 20218-bit Optimizers via Block-wise Quantizationcited by 395
  20. 2021ZeRO-Offload: Democratizing Billion-Scale Model Trainingcited by 339
  21. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
  22. 2024LoRA Learns Less and Forgets Lesscited by 313
  23. 2023To Generate or Not? Safety-Driven Unlearned Diffusion Models Are Still Easy To Generate Unsafe Images ... For Nowcited by 204
  24. 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 200
  25. 2023RTMPose: Real-Time Multi-Person Pose Estimation based on MMPosecited by 170
  26. 2024Defensive Unlearning with Adversarial Training for Robust Concept Erasure in Diffusion Modelscited by 164
  27. 2023Full Parameter Fine-tuning for Large Language Models with Limited Resourcescited by 134
  28. 2024LoRA-GA: Low-Rank Adaptation with Gradient Approximationcited by 134
  29. 2024Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmarkcited by 113
  30. 2023Navigating Text-To-Image Customization: From LyCORIS Fine-Tuning to Model Evaluationcited by 108
  31. 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 103
  32. 2024Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learningcited by 80
  33. 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
  34. 2015Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guaranteescited by 68
  35. 2022How to Robustify Black-Box ML Models? A Zeroth-Order Optimization Perspectivecited by 39
  36. 2016Non-Convex Projected Gradient Descent for Generalized Low-Rank Tensor Regressioncited by 23
  37. 2023HALOC: Hardware-Aware Automatic Low-Rank Compression for Compact Neural Networkscited by 20
  38. 2023COMCAT: Towards Efficient Compression and Customization of Attention-Based Vision Modelscited by 14

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

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

8 papers.