Neural Networks Weights Quantization: Target None-retraining Ternary (TNT)
Not on the map. Why?
Abstract (arXiv)
Quantization of weights of deep neural networks (DNN) has proven to be an effective solution for the purpose of implementing DNNs on edge devices such as mobiles, ASICs and FPGAs, because they have no sufficient resources to support computation involving millions of high precision weights and multiply-accumulate operations. This paper proposes a novel method to compress vectors of high precision weights of DNNs to ternary vectors, namely a cosine similarity based target non-retraining ternary (TNT) compression method. Our method leverages cosine similarity instead of Euclidean distances as commonly used in the literature and succeeds in reducing the size of the search space to find optimal ternary vectors from 3N to N, where N is the dimension of target vectors. As a result, the computational complexity for TNT to find theoretically optimal ternary vectors is only O(N log(N)). Moreover, our experiments show that, when we ternarize models of DNN with high precision parameters, the obtained quantized models can exhibit sufficiently high accuracy so that re-training models is not necessary.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Dec 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 0; 2026: 1.
3 papers.
- 2026VAD to the Bone: Ultra-Tiny Speech Activity Detection for Edge Deployment28 Jul 2026
- 2021One Loss for All: Deep Hashing with a Single Cosine Similarity based Learning Objective29 Sep 2021
- 2021Ternary Hashing16 Mar 2021