paper-with-me

Papers

LooC: Effective Low-Dimensional Codebook for Compositional Vector Quantization

2026-01-01 · Jie Li, Kwan-Yee K. Wong, Kai Han arxiv

Vector quantization (VQ) is a prevalent and fundamental technique that discretizes continuous feature vectors by approximating them using a codebook. As the diversity and complexity of data and models continue to increase, there is an urgent need for high-capacity, yet more compact VQ methods. This paper aims to reconcile this conflict by presenting a new approach called LooC, which utilizes an effective Low-dimensional codebook for Compositional vector quantization. Firstly, LooC introduces a parameter-efficient codebook by reframing the relationship between codevectors and feature vectors, significantly expanding its solution space. Instead of individually matching codevectors with feature vectors, LooC treats them as lower-dimensional compositional units within feature vectors and combines them, resulting in a more compact codebook with improved performance. Secondly, LooC incorporates a parameter-free extrapolation-by-interpolation mechanism to enhance and smooth features during the VQ process, which allows for better preservation of details and fidelity in feature approximation. The design of LooC leads to full codebook usage, effectively utilizing the compact codebook while avoiding the problem of collapse. Thirdly, LooC can serve as a plug-and-play module for existing methods for different downstream tasks based on VQ. Finally, extensive evaluations on different tasks, datasets, and architectures demonstrate that LooC outperforms existing VQ methods, achieving state-of-the-art performance with a significantly smaller codebook.

📄 PDF Abstract BibTeX arXiv:2601.00222

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Efficient Decoding of Compositional Structure in Holistic Representations

2023-05-26 · Denis Kleyko, Connor Bybee, Ping-Chen Huang, Christopher J. Kymn 외

We investigate the task of retrieving information from compositional distributed representations formed by Hyperdimensional Computing/Vector Symbolic Architectures and present novel techniques which achieve new informati…

compressed sensingRetrieval

Stacked Quantizers for Compositional Vector Compression

2014-11-08 · Julieta Martinez, Holger H. Hoos, James J. Little

Recently, Babenko and Lempitsky introduced Additive Quantization (AQ), a generalization of Product Quantization (PQ) where a non-independent set of codebooks is used to compress vectors into small binary codes. Unfortuna…

Quantization

Efficient Estimation of Regularized Tyler's M-Estimator Using Approximate LOOCV

2025-05-30 · Karim Abou-Moustafa

We consider the problem of estimating a regularization parameter, or a shrinkage coefficient $\alpha \in (0,1)$ for Regularized Tyler's M-estimator (RTME). In particular, we propose to estimate an optimal shrinkage coeff…

Face RecognitionObject Recognition

On Optimal Generalizability in Parametric Learning

2017-11-14 · NeurIPS 2017 12 · Ahmad Beirami, Meisam Razaviyayn, Shahin Shahrampour, Vahid Tarokh

We consider the parametric learning problem, where the objective of the learner is determined by a parametric loss function. Employing empirical risk minimization with possibly regularization, the inferred parameter vect…

CodeBind: Decoupled Representation Learning for Multimodal Alignment with Unified Compositional Codebook

2026-05-18 · Zeyu Chen, Jie Li, Kai Han arxiv

Multimodal representation alignment is pivotal for large language models and robotics. Traditional methods are often hindered by cross-modal information discrepancies and data scarcity, leading to suboptimal alignment sp…

Representation Learning