arXiv CS
open access
LARC: Low-Rank Adaptive Residual Connections for Learning in Frozen Models
Low-Rank Adaptive Residual Connections (LARC) give a frozen model a compact numerical state that can learn from feedback. The map $h+BAh$ adds a low-rank correction to a hidden representation. A slow state $ρ$ learns starting factors across tasks; a private fast state $Φ$ copies them, changes with f
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
- LARC: Low-Rank Adaptive Residual Connections for Learning in Frozen Models#1154332
- Staleness-Learning Rate Scaling Laws for Asynchronous RLHF#329084
- Why diffusion models do not memorize: the role of implicit dynamical regularization in training#1120376
- Neural ODEs Meet Concurrent Learning: Stable Online Learning with Lyapunov Guarantees#1116620
- How Temporal Correlations Shape Memory in Linear Recurrent Neural Networks#819868
Record · ID 1136846
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