Regularization in Relevance Learning Vector Quantization Using l one Norms

2013-10-18 · Martin Riedel, Marika Kästner, Fabrice Rossi, Thomas Villmann

We propose in this contribution a method for l one regularization in prototype based relevance learning vector quantization (LVQ) for sparse relevance profiles. Sparse relevance profiles in hyperspectral data analysis fade down those spectral bands which are not necessary for classification. In particular, we consider the sparsity in the relevance profile enforced by LASSO optimization. The latter one is obtained by a gradient learning scheme using a differentiable parametrized approximation of the $l_{1}$-norm, which has an upper error bound. We extend this regularization idea also to the matrix learning variant of LVQ as the natural generalization of relevance learning.

📄 PDF Abstract BibTeX arXiv:1310.5095

Code (0)

등록된 구현이 없습니다.

Tasks

General Classification Quantization

Spectral k-Support Norm Regularization

2014-12-01 · NeurIPS 2014 12 · Andrew M. McDonald, Massimiliano Pontil, Dimitris Stamos

The $k$-support norm has successfully been applied to sparse vector prediction problems. We observe that it belongs to a wider class of norms, which we call the box-norms. Within this framework we derive an efficient alg…

Matrix Completion

Lipschitz Continuity Retained Binary Neural Network

2022-07-13 · Yuzhang Shang, Dan Xu, Bin Duan, Ziliang Zong 외

Relying on the premise that the performance of a binary neural network can be largely restored with eliminated quantization error between full-precision weight vectors and their corresponding binary vectors, existing wor…

Binarization Quantization

RSLM: Training-Free Vector Quantization for Approximate Nearest Neighbor Search

2026-08-31 · Rastislav Lenhardt, Teodora Dobos, Thomas Vecchiato, Jiri Isa 외 arxiv

By introducing RSLM (Rotated Scaled Lloyd-Max), a family of training-free vector quantization codecs compressing embeddings to 1--4 bits per dimension, we reduce memory cost and memory bandwidth of a typical large-scale …

Constraining Logits by Bounded Function for Adversarial Robustness

2020-10-06 · Sekitoshi Kanai, Masanori Yamada, Shin'ya Yamaguchi, Hiroshi Takahashi 외

We propose a method for improving adversarial robustness by addition of a new bounded function just before softmax. Recent studies hypothesize that small logits (inputs of softmax) by logit regularization can improve adv…

Adversarial Robustness

Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search

2019-11-12 · Xinyan Dai, Xiao Yan, Kelvin K. W. Ng, Jie Liu 외

Vector quantization (VQ) techniques are widely used in similarity search for data compression, fast metric computation and etc. Originally designed for Euclidean distance, existing VQ techniques (e.g., PQ, AQ) explicitly…

Data Compression Quantization