FleXOR: Trainable Fractional Quantization
Not on the map. Why?
Abstract (arXiv)
Quantization based on the binary codes is gaining attention because each quantized bit can be directly utilized for computations without dequantization using look-up tables. Previous attempts, however, only allow for integer numbers of quantization bits, which ends up restricting the search space for compression ratio and accuracy. In this paper, we propose an encryption algorithm/architecture to compress quantized weights so as to achieve fractional numbers of bits per weight. Decryption during inference is implemented by digital XOR-gate networks added into the neural network model while XOR gates are described by utilizing tanh(x) for backward propagation to enable gradient calculations. We perform experiments using MNIST, CIFAR-10, and ImageNet to show that inserting XOR gates learns quantization/encrypted bit decisions through training and obtains high accuracy even for fractional sub 1-bit weights. As a result, our proposed method yields smaller size and higher model accuracy compared to binary neural networks.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 3; 2024: 1; 2025: 0; 2026: 1.
9 papers.
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2022Bitwidth Heterogeneous Federated Learning with Progressive Weight Dequantizationcited by 11
- 2021Sub-bit Neural Networks: Learning to Compress and Accelerate Binary Neural Networkscited by 7
- 2023Compacting Binary Neural Networks by Sparse Kernel Selectioncited by 3
- 2023ATHEENA: A Toolflow for Hardware Early-Exit Network Automationcited by 3
- 2026LegoNet: Memory Footprint Reduction Through Block Weight Clusteringcited by 1
- 2021Q-Rater: Non-Convex Optimization for Post-Training Uniform Quantizationcited by 0
- 2023MST-compression: Compressing and Accelerating Binary Neural Networks with Minimum Spanning Treecited by 0
- 2024Tiled Bit Networks: Sub-Bit Neural Network Compression Through Reuse of Learnable Binary Vectorscited by 0
- 2026LegoNet: Memory Footprint Reduction Through Block Weight Clustering18 Feb 2026
- 2024Tiled Bit Networks: Sub-Bit Neural Network Compression Through Reuse of Learnable Binary Vectors16 Jul 2024
- 2023MST-compression: Compressing and Accelerating Binary Neural Networks with Minimum Spanning Tree26 Aug 2023
- 2023ATHEENA: A Toolflow for Hardware Early-Exit Network Automation17 Apr 2023
- 2023Compacting Binary Neural Networks by Sparse Kernel Selection25 Mar 2023
- 2022Bitwidth Heterogeneous Federated Learning with Progressive Weight Dequantization23 Feb 2022
- 2021Sub-bit Neural Networks: Learning to Compress and Accelerate Binary Neural Networks18 Oct 2021
- 2021Q-Rater: Non-Convex Optimization for Post-Training Uniform Quantization5 May 2021
- 2021A Survey of Quantization Methods for Efficient Neural Network Inference25 Mar 2021