Adaptive Rank Allocation
Overview
Adaptive rank allocation studies how to divide a limited low-rank budget so models preserve useful capacity without spending equally everywhere. In LoRA and other parameter-efficient fine-tuning, methods use gradient or Fisher scores, activation sensitivity, uncertainty, or information-flow structure; spectral methods use singular values to allocate capacity for compression and model merging. These approaches are evaluated on settings such as language understanding, math and code reasoning, image generation, and long-context cache compression, often at matched parameter or memory budgets. A central tension is that importance scores do not always predict capacity needs: signals that help in supervised fine-tuning may fail in reinforcement-learning alignment, and dynamic allocation must justify its added estimation or training cost.
Latest papers
32 papers6 papers in the last four weeks, up 50% on the four weeks before. 0.0% of all new papers.