Skip to content

SAD-LoRA: Spectral Alignment for Low-Rank Knowledge Distillation

Jul 2026 · arXiv.org · Vol abs/2607.04306 · 0 citations · 28 references
Computer Science

TL;DR

SAD-LoRA is proposed (SAD-LoRA), which selects this subspace from the data-weighted student-space reference update $\DWT\Sigx^{1/2}$ and maintains it during training via a differentiable principal-angle loss on $\colspan(B)$.

Abstract

Distilling a fine-tuned teacher into a LoRA-adapted student is a standard recipe for parameter-efficient compression, but output-level KD does not explicitly control which rank-$r$ weight subspace the adapter occupies. We propose \textbf{SAD-LoRA} (\textbf{S}pectral \textbf{A}lignment \textbf{D}istillation), which selects this subspace from the data-weighted student-space reference update $\DWT\Sigx^{1/2}$ and maintains it during training via a differentiable principal-angle loss on $\colspan(B)$. We show that the data-weighted distillation error decomposes exactly into subspace misalignment, within-subspace coefficient mismatch, and irreducible rank residual; standard KD can affect the first term only indirectly through output gradients. On controlled synthetic problems with a flat teacher spectrum, SAD-LoRA reduces the subspace-misalignment term from $51\%$ to nearly zero and lifts final subspace alignment from $0.49$ to $1.00$. On RoBERTa-large to RoBERTa-base distillation across six GLUE tasks, SAD-LoRA improves rank efficiency: at $r{=}4$, it matches or beats the strongest included spectral baseline on five of six tasks, and at $r{=}8$ it gives the best result on SST-2 and CoLA. Ablations identify subspace alignment as the load-bearing component, while coefficient matching is auxiliary.

View source

Similar papers

Preprint Aug 2026

How Much Rank Does LoRA Need? Rank-Error Bounds for Transformer Attention

This paper provides a task-dependent theory of the approximation error achievable at each LoRA rank for Transformer attention, and extends the analysis to fused multi-head LoRA and joint query/key updates, exposing the effects of rank sharing and query/key factorization constraints.

G. Planes · 0 citations
Conference Open access Sep 2026

SeMi-LoRA: Enhancing Low-Rank Adaptation via Separation and Mixing

This work proposes SeMi-LoRA (Separation and Mixing LoRA), a novel framework that enables complete high-rank updates while preserving mergeability and consistently outperforms strong PEFT baselines with favorable parameter efficiency.

Zhen-Fei Yang, Beiming Yu, Peiqin Lin et al. · 0 citations
Preprint Aug 2026

Finding Usable Weight Mechanisms with Tiled SVD

This work proposes extracting mechanism mounts directly from linear sites by column-tiled SVD: each mount is a triple read as trigger, write, and strength, and evaluates mounts with a pre-registered suite judged on full-write energy lift rather than tile-local lift.

Ash Manvi, Samreena Tajreen · 0 citations
Preprint Aug 2026

Fine-Tuning of Transformer models with Frames

The experiments show that FrameFT achieves performance on par with/exceeding state-of-the-art PEFT techniques, but needs far fewer trainable parameters.

Harshavardhan Adepu, Li Zhang, Sanjiv Kumar et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.