arXiv (All)
open access
How Many Ranks Does a Token Need? A Noise-Floor Squelch for Rank-One LoRA Experts
Low-rank adaptation (LoRA) applies every rank-one component of its update to every token, and mixture-of-experts variants replace this with a learned router that activates a fixed number of components. We argue that the number of components a token needs is a detection question with a classical answ
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
- Adaptive Utilization of Low-Rank Adaptation via Conditioned Gating#1202219
- On the Convergence of Stochastic Low-Rank Adaptation#1116380
- Learn the Directions, Normalize the Gains: Post-Training Normalization for LoRA#1161041
- Learn the Directions, Normalize the Gains: Post-Training Normalization for LoRA#1157415
- Dynamic LoRA-Experts and Prototype-Ensemble Matching for Class-Incremental Learning#1145006
Record · ID 1344856
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