LoCO: Low-rank Compositional Rotation Fine-tuning
Not on the map. Why?
Abstract (arXiv)
Parameter-efficient fine-tuning (PEFT) has emerged as an critical technique for adapting large-scale foundation models across natural language processing and computer vision. While existing methods such as low-rank adaptations achieve parameter efficiency via low-rank weight updates, they are limited in their ability to preserve the geometric structure of pretrained representations. We introduce Low-rank Compositional Orthogonal fine-tuning (LoCO), a novel PEFT method that constructs orthogonal transformations through low-rank skew-symmetric matrices and compositional rotation chains. We propose an approximation scheme that enables fully parallel computation of compositional rotations, making the approach practical for high-dimensional feature spaces. Our method maintains low computational complexity while maintaining orthogonality with controlled approximation error. We validate LoCO across diverse domains, including diffusion transformer fine-tuning, vision transformer adaptation, and language model adaptation. Our method demonstrates superior or competitive performance compared to both existing orthogonal and non-orthogonal methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 46 of its 55 references that are in the map. First posted on arXiv 15 May 2026.
Builds on
46 of 55 references.
References · 46
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2022Scalable Diffusion Models with Transformerscited by 6,054
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
34 more
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
- 2022Visual Prompt Tuningcited by 1,681
- 2021MUSIQ: Multi-scale Image Quality Transformercited by 1,081
- 2022Exploring CLIP for Assessing the Look and Feel of Imagescited by 991
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
- 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 735
- 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
- 2022MANIQA: Multi-dimension Attention Network for No-Reference Image Quality Assessmentcited by 522
- 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 425
- 2024OminiControl: Minimal and Universal Control for Diffusion Transformercited by 340
- 2022Scaling & Shifting Your Features: A New Baseline for Efficient Model Tuningcited by 294
- 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
- 2020Generalizing Convolutional Neural Networks for Equivariance to Lie Groups on Arbitrary Continuous Datacited by 248
- 2023A Rank Stabilization Scaling Factor for Fine-Tuning with LoRAcited by 243
- 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 208
- 2018Hyperbolic Entailment Cones for Learning Hierarchical Embeddingscited by 162
- 2023Parameter-Efficient Orthogonal Finetuning via Butterfly Factorizationcited by 114
- 2021Fully Hyperbolic Neural Networkscited by 108
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 106
- 2024MiLoRA: Harnessing Minor Singular Components for Parameter-Efficient LLM Finetuningcited by 94
- 2024LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameterscited by 76
- 2021Skew Orthogonal Convolutionscited by 67
- 2017Deep Hyperspherical Learningcited by 55
- 2018Decoupled Networkscited by 45
- 2023Efficient Adaptation of Large Vision Transformer via Adapter Re-Composingcited by 35
- 2019Angular Visual Hardnesscited by 29
- 2024Parameter Efficient Quasi-Orthogonal Fine-Tuning via Givens Rotationcited by 21
- 2024Bridging The Gap between Low-rank and Orthogonal Adaptation via Householder Reflection Adaptationcited by 15
- 2023Lie Group Decompositions for Equivariant Neural Networkscited by 12
- 2024Group and Shuffle: Efficient Structured Orthogonal Parametrizationcited by 11
- 20243-in-1: 2D Rotary Adaptation for Efficient Finetuning, Efficient Batching and Composabilitycited by 10
- 2025Reparameterized LLM Training via Orthogonal Equivalence Transformationcited by 9
- 2024Efficient Adaptation of Pre-trained Vision Transformer via Householder Transformationcited by 5
- 2025HOFT: Householder Orthogonal Fine-tuningcited by 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Towards Higher Effective Rank in Parameter-efficient Fine-tuning using Khatri--Rao Product
- 2025PEFT A2Z: Parameter-Efficient Fine-Tuning Survey for Large Language and Vision Models
- 2026LOFT: Low-Rank Orthogonal Fine-Tuning via Task-Aware Support Selection
- 2023PELA: Learning Parameter-Efficient Models with Low-Rank Approximation
- 2024LoLDU: Low-Rank Adaptation via Lower-Diag-Upper Decomposition for Parameter-Efficient Fine-Tuning
- 2024Preserving Pre-trained Representation Space: On Effectiveness of Prefix-tuning for Large Multi-modal Models
- 2026When Is Rank-1 Enough? Geometry-Guided Initialization for Parameter-Efficient Fine-Tuning
- 2025Transformed Low-rank Adaptation via Tensor Decomposition and Its Applications to Text-to-image Models