arXiv (All)
open access
Not All Ranks Are Equal: Budget-Aware LoRA Merging Across Tasks
Merging low-rank adapters (LoRAs) promises to eliminate the overhead of swapping task-specific weights at inference time. However, existing merging methods assume every layer needs the same rank budget. Further, some methods assume that rank budget needs to be split equally among the tasks too. We s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Score the Update, Not the Token: Descent-Aligned Routing for Combinatorial LoRA Experts#1155428
- DIET: Deletion-response Expert Trimming for Video Diffusion Transformers#1142137
- Routing in Gradient Space: Balanced Usage Is Not Expert Specialization#1131925
- Modular Expert Merging for Biomedical Retrieval#924503
- Modular Expert Merging for Biomedical Retrieval#920272
Record · ID 1036920
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive