FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment

Riccardo Zaccone, Stefanos Laskaridis, Marco Ciccone, Samuel Horváth
2/2/2026
cs.LG

No confident code implementation found for this paper.

Abstract

The growing scale of deep neural networks, encompassing large language models (LLMs) and vision transformers (ViTs), has made training from scratch prohibitively expensive and deployment increasingly costly. These models are often used as computational monoliths with fixed cost, a rigidity that does not leverage overparametrized architectures and largely hinders adaptive deployment across different cost budgets. We argue that importance-ordered nested components can be extracted from pretrained models, and selectively activated on the available computational budget. To this end, our proposed FlexRank method leverages low-rank weight decomposition with nested, importance-based consolidation to extract submodels of increasing capabilities. Our approach enables a "train-once, deploy-everywhere" paradigm that offers a graceful trade-off between cost and performance without training from scratch for each budget - advancing practical deployment of large models.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zaccone2026flexrank,
  title  = {FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment},
  author = {Riccardo Zaccone and Stefanos Laskaridis and Marco Ciccone and Samuel Horváth},
  year   = {2026},
  eprint = {2602.02680},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.02680v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.02680.svg)](https://codeofpaper.com/paper/2602.02680)

Discussion