mlsanityData to 7 Oct 2026

Dual Decomposition of Weights and Singular Value Low Rank Adaptation

arXiv 2505.14367 ↗First posted 20 May 2025cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

Parameter-Efficient Fine-Tuning (PEFT) has emerged as a critical paradigm for adapting Large Language Models (LLMs) to downstream tasks, among which Low-rank Adaptation (LoRA) represents one of the most widely adopted methodologies. However, existing LoRA-based approaches exhibit two fundamental limitations: unstable training dynamics and inefficient knowledge transfer from pre-trained models, both stemming from random initialization of adapter parameters. To overcome these challenges, we propose DuDe, a novel approach that decomposes weight matrices into magnitude and direction components, employing Singular Value Decomposition (SVD) for principled initialization. Our comprehensive evaluation demonstrates DuDe's superior performance and robustness, achieving up to 48.35% accuracy on MMLU and 62.53% (± 1.59) accuracy on GSM8K. Our theoretical analysis and empirical validation collectively demonstrate that DuDe's decomposition strategy enhances optimization stability and better preserves pre-trained representations, particularly for domain-specific tasks requiring specialized knowledge. The combination of robust empirical performance and rigorous theoretical foundations establishes DuDe as a significant contribution to PEFT methodologies for LLMs.

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

Builds on

24 of 32 references.

References · 24

  1. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  2. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  3. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  4. 2024Qwen2.5 Technical Reportcited by 4,713
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  6. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  7. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  8. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  9. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
  10. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  11. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  12. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,793
12 more
  1. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
  2. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
  3. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
  4. 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
  5. 2022KronA: Parameter Efficient Tuning with Kronecker Adaptercited by 130
  6. 2023Parameter-Efficient Orthogonal Finetuning via Butterfly Factorizationcited by 112
  7. 2023Cross-lingual Prompting: Improving Zero-shot Chain-of-Thought Reasoning across Languagescited by 96
  8. 2024LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameterscited by 73
  9. 2023Conditional Adapters: Parameter-efficient Transfer Learning with Fast Inferencecited by 69
  10. 2023Parameter-Efficient Fine-Tuning without Introducing New Latencycited by 59
  11. 2024SVFT: Parameter-Efficient Fine-Tuning with Singular Vectorscited by 57
  12. 2023FACTUAL: A Benchmark for Faithful and Consistent Textual Scene Graph Parsingcited by 50

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.