mlsanityData to 7 Oct 2026

Nonlinearity as Rank: Generative Low-Rank Adapter with Radial Basis Functions

arXiv 2602.05709 ↗First posted 5 Feb 2026cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Low-rank adaptation (LoRA) approximates the update of a pretrained weight matrix using the product of two low-rank matrices. However, standard LoRA follows an explicit-rank paradigm, where increasing model capacity requires adding more rows or columns (i.e., basis vectors) to the low-rank matrices, leading to substantial parameter growth. In this paper, we find that these basis vectors exhibit significant parameter redundancy and can be compactly represented by lightweight nonlinear functions. Therefore, we propose Generative Low-Rank Adapter (GenLoRA), which replaces explicit basis vector storage with nonlinear basis vector generation. Specifically, GenLoRA maintains a latent vector for each low-rank matrix and employs a set of lightweight radial basis functions (RBFs) to synthesize the basis vectors. Each RBF requires far fewer parameters than an explicit basis vector, enabling higher parameter efficiency in GenLoRA. Extensive experiments across multiple datasets and architectures show that GenLoRA attains higher effective LoRA ranks under smaller parameter budgets, resulting in superior fine-tuning performance. The code is available at https://anonymous.4open.science/r/GenLoRA.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 54 references that are in the map. First posted on arXiv 5 Feb 2026.

Builds on

28 of 54 references.

References · 28

  1. 2024The Llama 3 Herd of Modelscited by 14,192
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  3. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
  6. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  7. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  8. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  9. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  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. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 861
16 more
  1. 2023WizardCoder: Empowering Code Large Language Models with Evol-Instructcited by 728
  2. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 642
  3. 2024InternLM2 Technical Reportcited by 391
  4. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 365
  5. 2016Solving General Arithmetic Word Problemscited by 353
  6. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 317
  7. 2023Magicoder: Empowering Code Generation with OSS-Instructcited by 251
  8. 2024LoRA-GA: Low-Rank Adaptation with Gradient Approximationcited by 134
  9. 2022KronA: Parameter Efficient Tuning with Kronecker Adaptercited by 130
  10. 2024Parameter-Efficient Fine-Tuning with Discrete Fourier Transformcited by 67
  11. 2023NOLA: Compressing LoRA using Linear Combination of Random Basiscited by 28
  12. 2024Efficient Learning With Sine-Activated Low-rank Matricescited by 22
  13. 2024MELoRA: Mini-Ensemble Low-Rank Adapters for Parameter-Efficient Fine-Tuningcited by 16
  14. 2025HyperLoRA: Parameter-Efficient Adaptive Generation for Portrait Synthesiscited by 10
  15. 2025Beyond Higher Rank: Token-wise Input-Output Projections for Efficient Low-Rank Adaptationcited by 5
  16. 2025Don't Forget the Nonlinearity: Unlocking Activation Functions in Efficient Fine-Tuningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.