---
title: "CoS-VQ: Coordinated Shared-Scale Vector Quantization for Large Language Models"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2610.37336v1"
permalink: "https://feed.astralor.com/items/itm_323aee39c727ba1322457bdb"
published: "2026-10-27T14:43:00.000Z"
score: 55
channel: "tech"
tags: ["LLM","CoS-VQ","Coordinated Shared-Scale Vector","Quantization","Large Language Models","Large","LLMs","Existing"]
---

# CoS-VQ: Coordinated Shared-Scale Vector Quantization for Large Language Models

## 速览

Large language models (LLMs) require substantial memory, motivating low-bit weight quantization for efficient deployment. Existing vector quantization (VQ) methods often improve accuracy by increasing the effective codi…

## 关键点

- Large language models (LLMs) require substantial memory, motivating low-bit weight quantization for efficient deployment.
- Existing vector quantization (VQ) methods often improve accuracy by increasing the effective coding dimension, which can complicate independent lookup and local codeword updates.
- We propose CoS-VQ (Coordinated Shared-Scale Vector Quantization), which preserves low-dimensional codewords while jointly optimizing hard indices and their shared scale across positions.

## 全文

Large language models (LLMs) require substantial memory, motivating low-bit weight quantization for efficient deployment. Existing vector quantization (VQ) methods often improve accuracy by increasing the effective coding dimension, which can complicate independent lookup and local codeword updates. We propose CoS-VQ (Coordinated Shared-Scale Vector Quantization), which preserves low-dimensional codewords while jointly optimizing hard indices and their shared scale across positions. The key challenge is scale-induced coupling: the optimal scale depends on the entire codeword combination and, in turn, changes candidate rankings across positions, so pointwise updates can stall even after scale re-optimization. CoS-VQ collects candidates at multiple probe scales and constructs a tangent separable upper bound for the residual-aware quadratic objective. By reducing candidate comparisons to lower envelopes of lines over positive scales, it identifies finitely many representative intervals for joint index--scale updates without exhaustively enumerating codeword combinations. On Qwen3.8-27B, CoS-VQ outperforms QTIP and LLVQ on the evaluated language modeling, coding, and reasoning benchmarks. Ablations from the same initialization further show larger gains from joint updates than from scale-only refinement, highlighting joint selection as an alternative to increasing codeword dimensionality. The code is available at https://github.com/xzktx003/Cos_VQ.

---

引用前请核对原文;本文由星际流动整理:https://feed.astralor.com/items/itm_323aee39c727ba1322457bdb