TL;DR
PERA introduces polynomial expansion into low-rank fine-tuning of LLMs, enabling richer nonlinear interactions and significantly improving performance without extra inference costs.
Contribution
It proposes a novel polynomial expansion method for low-rank adaptation, enhancing expressive capacity beyond linear models in LLM fine-tuning.
Findings
PERA outperforms state-of-the-art methods across multiple benchmarks.
High-order nonlinear components, especially square terms, are key to improved expressiveness.
PERA maintains efficiency by not increasing rank or inference cost.
Abstract
Low-rank adaptation (LoRA) is a widely used strategy for efficient fine-tuning of large language models (LLMs), but its strictly linear structure fundamentally limits expressive capacity. The bilinear formulation of weight updates captures only first-order dependencies between low-rank factors, restricting the modeling of nonlinear and higher-order parameter interactions. In this paper, we propose Polynomial Expansion Rank Adaptation (PERA), a novel method that introduces structured polynomial expansion directly into the low-rank factor space. By expanding each low-rank factor to synthesize high-order interaction terms before composition, PERA transforms the adaptation space into a polynomial manifold capable of modeling richer nonlinear coupling without increasing rank or inference cost. We provide theoretical analysis demonstrating that PERA offers enhanced expressive capacity and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
