Quantization Aware Factorization for Deep Neural Network Compression

Tensor decomposition of convolutional and fully-connected layers is an effective way to reduce parameters and FLOP in neural networks. Due to memory and power consumption limitations of mobile or embedded devices, the quantization step is usually necessary when pre-trained models are deployed. A conventional post-training quantization approach applied to networks with decomposed weights yields a drop in accuracy. This motivated us to develop an algorithm that finds tensor approximation directly with quantized factors and thus benefit from both compression techniques while keeping the prediction quality of the model. Namely, we propose to use Alternating Direction Method of Multipliers (ADMM) for Canonical Polyadic (CP) decomposition with factors whose elements lie on a specified quantization grid. We compress neural network weights with a devised algorithm and evaluate it’s prediction quality and performance. We compare our approach to state-of-the-art post-training quantization methods and demonstrate competitive results and high flexibility in achiving a desirable quality-performance tradeoff.

Authors

Institutions

Publication Details

Journal
Journal of Artificial Intelligence Research
Published
2024-12-20
DOI
https://doi.org/10.1613/jair.1.16167
Citations
3
Primary Topic
Advanced Data Compression Techniques
Type
article
Field-Weighted Citation Impact
0.75

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantization Aware Factorization for Deep Neural Network Compression

Ivan Oseledets, Andrzej Cichocki, Julia Gusak, Anh Huy Phan et al.
3 citations
Journal of Artificial Intelligence Research
Advanced Data Compression Techniques
0.75
article

Quantization Aware Factorization for Deep Neural Network Compression

Ivan Oseledets, Andrzej Cichocki, Julia Gusak, Anh Huy Phan, Daria Cherniuk, Stanislav Abukhovich
article en
3 citations

Abstract

Tensor decomposition of convolutional and fully-connected layers is an effective way to reduce parameters and FLOP in neural networks. Due to memory and power consumption limitations of mobile or embedded devices, the quantization step is usually necessary when pre-trained models are deployed. A conventional post-training quantization approach applied to networks with decomposed weights yields a drop in accuracy. This motivated us to develop an algorithm that finds tensor approximation directly with quantized factors and thus benefit from both compression techniques while keeping the prediction quality of the model. Namely, we propose to use Alternating Direction Method of Multipliers (ADMM) for Canonical Polyadic (CP) decomposition with factors whose elements lie on a specified quantization grid. We compress neural network weights with a devised algorithm and evaluate it’s prediction quality and performance. We compare our approach to state-of-the-art post-training quantization methods and demonstrate competitive results and high flexibility in achiving a desirable quality-performance tradeoff.

Journal of Artificial Intelligence ResearchVol. 81
Skolkovo Institute of Science and Technology (RU)
Institut national de recherche en informatique et en automatique (INRIA), Skolkovo Institute of Science and Technology
Affordable and clean energy
Openalex Percentile: Top 26%
Advanced Data Compression Techniques
0.75
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Quantization Aware Factorization for Deep Neural Network Compression — Ivan Oseledets, Andrzej Cichocki, et al. · Journal of Artificial Intelligence Research (2024) | TGRS Research Map | TGRS