# End to End Binarized Neural Networks for Text Classification

arXiv: https://arxiv.org/abs/2010.05223 · HTML: https://mlsanity.com/paper/2010.05223/

## Key facts

- Cited by 13 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Oct 2020.

## Built on by (most cited first, 13 of 13)

- [A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part II: Applications, Cognitive Models, and Challenges](https://mlsanity.com/paper/2112.15424/) (2021)
- [A comprehensive review of Binary Neural Network](https://mlsanity.com/paper/2110.06804/) (2021)
- [Vector Symbolic Architectures as a Computing Framework for Emerging Hardware](https://mlsanity.com/paper/2106.05268/) (2021)
- [Generalized Learning Vector Quantization for Classification in Randomized Neural Networks and Hyperdimensional Computing](https://mlsanity.com/paper/2106.09821/) (2021)
- [Hyperseed: Unsupervised Learning with Vector Symbolic Architectures](https://mlsanity.com/paper/2110.08343/) (2021)
- [Hyperdimensional Computing for Efficient Distributed Classification with Randomized Neural Networks](https://mlsanity.com/paper/2106.00881/) (2021)
- [HEAL: Brain-inspired Hyperdimensional Efficient Active Learning](https://mlsanity.com/paper/2402.11223/) (2024)
- [AnchorFormer: Differentiable Anchor Attention for Efficient Vision Transformer](https://mlsanity.com/paper/2505.16463/) (2025)
- [On Effects of Compression with Hyperdimensional Computing in Distributed Randomized Neural Networks](https://mlsanity.com/paper/2106.09831/) (2021)
- [Do Trajectories Encode Verb Meaning?](https://mlsanity.com/paper/2206.11953/) (2022)
- [SpikeFit: Towards Optimal Deployment of Spiking Networks on Neuromorphic Hardware](https://mlsanity.com/paper/2510.15542/) (2025)
- [Comparing Trajectory and Vision Modalities for Verb Representation](https://mlsanity.com/paper/2303.12737/) (2023)
- [On Integer Programming for the Binarized Neural Network Verification Problem](https://mlsanity.com/paper/2510.01525/) (2025)

## Abstract (arXiv)

Deep neural networks have demonstrated their superior performance in almost every Natural Language Processing task, however, their increasing complexity raises concerns. In particular, these networks require high expenses on computational hardware, and training budget is a concern for many. Even for a trained network, the inference phase can be too demanding for resource-constrained devices, thus limiting its applicability. The state-of-the-art transformer models are a vivid example. Simplifying the computations performed by a network is one way of relaxing the complexity requirements. In this paper, we propose an end to end binarized neural network architecture for the intent classification task. In order to fully utilize the potential of end to end binarization, both input representations (vector embeddings of tokens statistics) and the classifier are binarized. We demonstrate the efficiency of such architecture on the intent classification of short texts over three datasets and for text classification with a larger dataset. The proposed architecture achieves comparable to the state-of-the-art results on standard intent classification datasets while utilizing ~ 20-40% lesser memory and training time. Furthermore, the individual components of the architecture, such as binarized vector embeddings of documents or binarized classifiers, can be used separately with not necessarily fully binary architectures.