TL;DR
This paper introduces novel methods for learning compact, accurate Boolean networks suitable for resource-constrained environments, demonstrating significant improvements over prior approaches in accuracy, efficiency, and latency.
Contribution
It presents three new techniques: a parameter-free connection learning strategy, a compact convolutional Boolean architecture, and an adaptive discretization process.
Findings
Achieves higher accuracy with up to 47x fewer Boolean operations.
Surpasses prior state-of-the-art in accuracy and runtime on FPGA for MNIST.
Generates circuits that are 7x smaller while maintaining high performance.
Abstract
Floating-point neural networks dominate modern machine learning but incur substantial inference costs, motivating emerging interest in Boolean networks for resource-constrained deployments. Since Boolean networks use only Boolean operations, they can achieve nanosecond-scale inference latency. However, learning Boolean networks that are both compact and accurate remains challenging because of their discrete, combinatorial structure. In this work we address this challenge via three novel, complementary contributions: (i) a new parameter-free strategy for learning effective connections, (ii) a novel compact convolutional Boolean architecture that exploits spatial locality while requiring fewer Boolean operations than existing convolutional kernels, and (iii) an adaptive discretization procedure that reduces the accuracy drop incurred when converting a continuously relaxed network into a…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
