Gradient-Free Training of Quantized Neural Networks
Noa Cohen, Omkar Joglekar, Dotan Di Castro, Vladimir Tchuiev, Shir Kozlovsky, Michal Moshkovitz

TL;DR
This paper introduces a gradient-free approach for training quantized neural networks, significantly reducing energy consumption and parameter updates while maintaining competitive performance.
Contribution
It presents a novel heuristic optimization framework that eliminates the need for gradients in training quantized neural networks, addressing computational efficiency.
Findings
Achieves comparable accuracy to gradient-based training on standard datasets.
Uses up to 3x less energy during training.
Requires up to 5x fewer parameter updates.
Abstract
Training neural networks requires significant computational resources and energy. Methods like mixed-precision and quantization-aware training reduce bit usage, yet they still depend heavily on computationally expensive gradient-based optimization. In this work, we propose a paradigm shift: eliminate gradients altogether. One might hope that, in a finite quantized space, finding optimal weights with out gradients would be easier but we theoretically prove that this problem is NP-hard even in simple settings where the continuous case is efficiently solvable. To address this, we introduce a novel heuristic optimization framework that avoids full weight updates and significantly improves efficiency. Empirically, our method achieves performance comparable to that of full-precision gradient-based training on standard datasets and architectures, while using up to 3x less energy and requiring…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
