The paper proves an upper bound of about sqrt(r/N) on the LoRA generalization gap and claims a matching lower bound, but both proofs contain structural gaps.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Sharp Generalization Bounds for Foundation Models with Asymmetric Randomized Low-Rank Adapters
The paper proves an upper bound of about sqrt(r/N) on the LoRA generalization gap and claims a matching lower bound, but both proofs contain structural gaps.