mlsanityData to 14 Oct 2026

HD-PiSSA: High-Rank Distributed Orthogonal Adaptation

arXiv 2505.18777 ↗First posted 24 May 2025cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Existing parameter-efficient fine-tuning (PEFT) methods for large language models (LLMs), such as LoRA and PiSSA, constrain model updates to low-rank subspaces, limiting their expressiveness and leading to suboptimal performance on complex tasks. To address this, we introduce High-rank Distributed PiSSA (HD-PiSSA), a distributed PEFT approach that initializes orthogonal adapters across different devices and aggregates their delta updates collectively on W for fine-tuning. Unlike Data Parallel LoRA or PiSSA, which maintain identical adapters across all devices, HD-PiSSA assigns different principal components of the pre-trained weights to each GPU, significantly expanding the range of update directions. This results in over 16x higher effective updated ranks than data-parallel LoRA or PiSSA when fine-tuning on 8 GPUs with the same per-device adapter rank. Empirically, we evaluate HD-PiSSA across various challenging downstream tasks, including mathematics, code generation, and multi-task learning. In the multi-task setting, HD-PiSSA achieves average gains of 10.0 absolute points (14.63%) over LoRA and 4.98 points (6.60%) over PiSSA across 12 benchmarks, demonstrating its benefits from the extra optimization flexibility.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 30 references that are in the map. First posted on arXiv 24 May 2025.

Builds on

24 of 30 references.

References · 24

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  6. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  7. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  8. 2021Program Synthesis with Large Language Modelscited by 3,637
  9. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  10. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  11. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  12. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
12 more
  1. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
  2. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
  3. 2023WizardLM: Empowering large pre-trained language models to follow complex instructionscited by 1,125
  4. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
  5. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
  6. 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
  7. 2023WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instructcited by 625
  8. 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 312
  9. 2024OpenCodeInterpreter: Integrating Code Generation with Execution and Refinementcited by 247
  10. 2021Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuningcited by 146
  11. 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressorscited by 108
  12. 2023Delta-LoRA: Fine-Tuning High-Rank Parameters with the Delta of Low-Rank Matricescited by 74

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.