← The frontier
Technology & AIAug 26, 2026

How Much Rank Does LoRA Need? Rank-Error Bounds for Transformer Attention

Choosing the rank of a low-rank adaptation (LoRA) update is usually an empirical task.

Choosing the rank of a low-rank adaptation (LoRA) update is usually an empirical task. In this paper, we provide a task-dependent theory of the approximation error achievable at each LoRA rank for Transformer attention. We fix a pretrained attention head, a target attention…

The frontier is open to all. Sign in to learn this from first principles and save it to your knowledge base.