Auditing PEFT Claims: A Stability Probe Unifying Three LoRA-Variant Fragility Patterns

Suan Lee, JaeSeong Kim


Abstract
Most published PEFT improvements over LoRA do not survive paired multi-seed evaluation. We audit four methods — DoRA, PiSSA, AdaLoRA, and rsLoRA — against LoRA across 16 claim cells spanning 125M–7B, using paired seeds, bootstrap confidence intervals, sign-flip permutation tests, and Holm–Bonferroni correction, with adjudication rules committed before the confirmatory runs. Only 2 of 15 confirmatory cells remain supported after correction, and 4 reverse outright. Three findings stand out. (i) DoRA shows no supported gain in any of its seven audited cells. (ii) PiSSA’s +2.6% GSM8K advantage under a common budget reverses under paper-faithful hyperparameters, including in the cleanest claim-matched 7B setting (Gemma-7B, MetaMathQA → GSM8K: Δ = −1.58pp, p ≈ 0.004, 1W/9L). (iii) PiSSA’s in-distribution NLI gain reverses on adversarial OOD yet improves on counterfactual sentiment, so in-distribution audits alone can mislead. A 303-run stability landscape then supplies a mechanism for three of the four variants. The effective adapter learning rate, lr × α/√r, marks a risk boundary near 5×10⁻⁴ on BERT-base/MNLI/AdamW: nothing below it collapsed (40/40 stable), while 11 of 32 configurations above it did. The boundary transfers to 7B (Mistral rsLoRA: 3/10 seeds degrade at α/√r = 4) and predicts DoRA’s α-driven failures at high rank, but it is calibrated rather than universal: a second 7B cell trains stably well above it once dtype is controlled, and we withdraw that cell as supporting evidence. AdaLoRA is excluded from this account: its failure is schedule-driven rather than driven by lr × α/√r. We release all configs, seeds, and scripts, and propose a minimal reporting standard: ≥10 paired seeds, bootstrap CIs, a regime ablation, and disclosure of α/√r.
Anthology ID:
2026.aacl-short.32
Volume:
Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 2: Short Papers)
Month:
November
Year:
2026
Address:
Hengqin, China
Editors:
Yue Zhang, Ruifeng Xu, Ayu Purwarianti, Tong Rong, Jun Suzuki
Venues:
AACL | IJCNLP
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
474–494
Language:
URL:
https://aclanthology.org/2026.aacl-short.32/
DOI:
Bibkey:
Cite (ACL):
Suan Lee and JaeSeong Kim. 2026. Auditing PEFT Claims: A Stability Probe Unifying Three LoRA-Variant Fragility Patterns. In Proceedings of the 15th International Joint Conference on Natural Language Processing and the 5th Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 2: Short Papers), pages 474–494, Hengqin, China. Association for Computational Linguistics.
Cite (Informal):
Auditing PEFT Claims: A Stability Probe Unifying Three LoRA-Variant Fragility Patterns (Lee & Kim, AACL-IJCNLP 2026)
Copy Citation:
PDF:
https://aclanthology.org/2026.aacl-short.32.pdf