mlsanityData to 14 Oct 2026

LoCA: Location-Aware Cosine Adaptation for Parameter-Efficient Fine-Tuning

arXiv 2502.06820 ↗First posted 5 Feb 2025cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Low-rank adaptation (LoRA) has become a prevalent method for adapting pre-trained large language models to downstream tasks. However, the simple low-rank decomposition form may constrain the hypothesis space. To address this limitation, we introduce Location-aware Cosine Adaptation (LoCA), a novel frequency-domain parameter-efficient fine-tuning method based on inverse Discrete Cosine Transform (iDCT) with selective locations of learnable components. We begin with a comprehensive theoretical comparison between frequency-domain and low-rank decompositions for fine-tuning pre-trained large models. Our analysis reveals that frequency-domain decomposition with carefully selected frequency components can surpass the expressivity of traditional low-rank-based methods. Furthermore, we demonstrate that iDCT offers a more efficient implementation compared to inverse Discrete Fourier Transform (iDFT), allowing for better selection and tuning of frequency components while maintaining equivalent expressivity to the optimal iDFT-based adaptation. By employing finite-difference approximation to estimate gradients for discrete locations of learnable coefficients on the DCT spectrum, LoCA dynamically selects the most informative frequency components during training. Experiments on diverse language and vision fine-tuning tasks demonstrate that LoCA offers enhanced parameter efficiency while maintains computational feasibility comparable to low-rank-based methods.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 49 of its 72 references that are in the map. First posted on arXiv 5 Feb 2025.

Builds on

49 of 72 references.

References · 49

  1. 2017Attention Is All You Needcited by 60,361
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  5. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
  6. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  7. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  8. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  9. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  10. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
  11. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
  12. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
37 more
  1. 2017Neural Discrete Representation Learningcited by 4,712
  2. 2022BLIP: Bootstrapping Language-Image Pre-training for Unified Vision-Language Understanding and Generationcited by 4,322
  3. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  4. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  5. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  6. 2022InstructPix2Pix: Learning to Follow Image Editing Instructionscited by 2,611
  7. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  8. 2013Fine-Grained Visual Classification of Aircraftcited by 1,726
  9. 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
  10. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  11. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  12. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
  13. 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
  14. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  15. 2017Deep Neural Networks as Gaussian Processescited by 622
  16. 2021ImageNet-21K Pretraining for the Massescited by 613
  17. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
  18. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
  19. 2023VeRA: Vector-based Random Matrix Adaptationcited by 300
  20. 2017The E2E Dataset: New Challenges For End-to-End Generationcited by 253
  21. 2022DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptationcited by 233
  22. 2020AdapterDrop: On the Efficiency of Adapters in Transformerscited by 224
  23. 2015Coordinate Descent Algorithmscited by 219
  24. 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 215
  25. 2020fastai: A Layered API for Deep Learningcited by 183
  26. 2021Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuningcited by 146
  27. 2021FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learningcited by 141
  28. 2020Exploring Versatile Generative Language Model Via Parameter-Efficient Transfer Learningcited by 139
  29. 2023LoRA-FA: Efficient and Effective Low Rank Representation Fine-tuningcited by 137
  30. 2022KronA: Parameter Efficient Tuning with Kronecker Adaptercited by 133
  31. 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 108
  32. 2024Parameter-Efficient Fine-Tuning with Discrete Fourier Transformcited by 71
  33. 2023Parameter-Efficient Fine-Tuning Design Spacescited by 67
  34. 2023Neural Architecture Search for Parameter-Efficient Fine-tuning of Large Pre-trained Language Modelscited by 25
  35. 2022Random matrix analysis of deep neural network weight matricescited by 21
  36. 2023Non-Intrusive Adaptation: Input-Centric Parameter-efficient Fine-Tuning for Versatile Multimodal Modelingcited by 20
  37. 2022Structured Pruning Adapterscited by 12

Built on by

Cited by year

Citing papers per year: 2025: 4.

4 papers.