Singular Value Decomposition (SVD) has become an important technique for reducing the computational burden of Vision Language Models (VLMs), which play a central role in tasks such as image captioning and visual question answering. Although multiple prior works have proposed efficient SVD variants to enable low-rank operations, we find that in practice it remains difficult to achieve substantial latency reduction during model execution. To address this limitation, we introduce a new computational pattern and apply SVD at a finer granularity, enabling real and measurable improvements in execution latency. Furthermore, recognizing that weight elements differ in their relative importance, we adaptively allocate relative importance to each element during SVD process to better preserve accuracy, then extend this framework with quantization applied to both weights and activations, resulting in a highly efficient VLM. Collectively, we introduce~Weighted SVD (WSVD), which outperforms other approaches by achieving over 1.8× decoding speedup while preserving accuracy. We open source our code at: \href{https://github.com/SAI-Lab-NYU/WSVD}{`https://github.com/SAI-Lab-NYU/WSVD`
Figures & tables
Figure 1: (a) Architecture of vision-language model. (b) Overview of WSVD framework.
Figure 2: (a) Latency evaluation of VLM including self-attention (SA) and feed-forward (FFN) modules. (b) Conventional SVD: the left side illustrates SVD of Wk , and the right side shows the reconstruction of Kh from the shared latent. (c) Per-head SVD: the left side illustrates per-head SVD of WKh , and right side shows per-head reconstruction of Kh from per-head latent.
Figure 3: (a) Naive reconstruction requires materializing and writing back full Kh to VRAM (global GPU memory), leading to excessive memory usage and I/O. (b) Our fused kernel consumes CKh and CVh tiles on-chip with flash decoding, reducing both peak memory footprint and I/O traffic. All the step numbers are shown in circle.
Figure 4: WSVD decoding pipeline. Each token is down-projected to low-rank latents, and K and V latents are appended to the cache, while Q latent is up-projected and consumed together with cached CKh,CVh in the fused kernel.
Acc.
Method
ScienceQA-IMG ↑
SEED-Bench ↑
Avg. ↑
ρ1:90%
ρ1:80%
ρ1:70%
ρ1:60%
ρ1:50%
ρ1:90%
ρ1:80%
ρ1:70%
ρ1:60%
ρ1:50%
LLaVA-v1.5 7B
ASVD
49.93%
50.12%
47.10%
36.69%
19.19%
54.27%
53.53%
48.35%
37.17%
24.17%
42.05%
SVD-LLM
65.44%
63.71%
61.92%
57.41%
55.53%
57.89%
57.50%
55.33%
54.64%
55.31%
58.47%
QSVD-noQ
67.72%
68.22%
67.08%
65.05%
62.37%
59.84%
59.07%
59.78%
59.00%
58.23%
62.64%
WSVD-noQ
68.17%
67.72%
67.28%
65.89%
65.49%
60.10%
60.17%
59.89%
60.18%
60.46%
63.54%
FP16
Accuracy: 68.01%
Accuracy: 60.18%
64.10%
Table 1: Accuracy evaluation of different methods under FP16 (detailed results in Appendix A.3 ).
Method
ScienceQA-IMG ↑
SEED-Bench ↑
Avg. ↑
v1.5 7B
v1.5 13B
Next 7B
Next 13B
v1.5 7B
v1.5 13B
Next 7B
Next 13B
DuQuant
57.36%
67.22%
66.34%
70.20%
54.11%
61.43%
63.64%
66.15%
63.31%
QVLM
55.24%
66.46%
60.60%
65.28%
50.13%
59.22%
50.38%
65.39%
59.09%
QASVD
41.92%
65.34%
49.37%
64.85%
41.26%
59.30%
49.63%
66.54%
54.78%
QSVD
65.61%
70.12%
66.10%
70.43%
58.49%
62.95%
65.63%
69.21%
66.07%
WSVD
64.25%
72.14%
66.94%
73.08%
60.23%
62.01%
67.49%
70.67%
67.10%
Table 2: Accuracy evaluation of different methods under low-precision on LLaVA-v1.5 7B, LLaVA-v1.5 13B, LLaVA-Next 7B and LLaVA-Next 13B.
Acc.
Method
ρ1=90%
ρ1=70%
ρ1=50%
v1.5 7B
FP16
68.01%
WSVD-noFT
67.82%
66.82%
65.09%
WSVD-noQ
68.17%
67.28%
65.49%
Table 3: Results of weighted finetuning ablation under different ρ1 settings.
Method
ScienceQA-IMG ↑
Avg. ↑
v1.5 7B
v1.5 13B
Next 7B
Next 13B
W/o QAT
63.91%
71.99%
66.59%
72.68%
68.79%
WSVD
64.25%
72.14%
66.94%
73.08%
69.10%
Table 4: Results of local QAT ablation.
Figure 5: Latency evaluation and normalized latency on: (a) RTX 4090 and (b) RTX 5090.
Table 5: Latency (ms) on RTX 4090 (left) and RTX 5090 (right) for different sequence lengths.
Table 6: Latency (ms) on RTX 4090 (left) and RTX 5090 (right) for different batch sizes.