mlsanityData to 7 Oct 2026

WARP Logic Neural Networks

arXiv 2602.03527 ↗First posted 3 Feb 2026cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Fast and efficient AI inference is increasingly important, and recent models that directly learn low-level logic operations have achieved state-of-the-art performance. However, existing logic neural networks incur high training costs, introduce redundancy or rely on approximate gradients, which limits scalability. To overcome these limitations, we introduce WAlsh Relaxation for Probabilistic (WARP) logic neural networks -- a novel gradient-based framework that efficiently learns combinations of hardware-native logic blocks. We show that WARP yields the most parameter-efficient representation for exactly learning Boolean functions and that several prior approaches arise as restricted special cases. Training is improved by introducing learnable thresholding and residual initialization, while we bridge the gap between relaxed training and discrete logic inference through stochastic smoothing. Experiments demonstrate faster convergence than state-of-the-art baselines, while scaling effectively to deeper architectures and logic functions with higher input arity.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 42 references that are in the map. First posted on arXiv 3 Feb 2026.

Builds on

25 of 42 references.

References · 25

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  3. 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
  4. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
  5. 2021Training Neural Networks with Fixed Sparse Maskscited by 212
  6. 2020Binary Neural Networks: A Surveycited by 184
  7. 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
  8. 2019AdderNet: Do We Really Need Multiplications in Deep Learning?cited by 82
  9. 2022Deep Differentiable Logic Gate Networkscited by 67
  10. 2019DeepShift: Towards Multiplication-Less Neural Networkscited by 52
  11. 2021Fast convolutional neural networks on FPGAs with hls4mlcited by 42
  12. 2024Convolutional Differentiable Logic Gate Networkscited by 37
13 more
  1. 2023PolyLUT: Learning Piecewise Polynomials for Ultra-Low Latency FPGA LUT-based Inferencecited by 30
  2. 2024Differentiable Weightless Neural Networkscited by 27
  3. 2024NeuraLUT: Hiding Neural Network Density in Boolean Synthesizable Functionscited by 21
  4. 2025TreeLUT: An Efficient Alternative to Deep Neural Networks for Inference Acceleration Using Gradient Boosted Decision Treescited by 15
  5. 2025NeuraLUT-Assemble: Hardware-aware Assembling of Sub-Neural Networks for Efficient LUT Inferencecited by 14
  6. 2025KANEL'E: Kolmogorov-Arnold Networks for Efficient LUT-based Evaluationcited by 13
  7. 2022Weightless Neural Networks for Efficient Edge Inferencecited by 12
  8. 2024Learning Interpretable Differentiable Logic Networkscited by 10
  9. 2025Light Differentiable Logic Gate Networkscited by 9
  10. 2025A Method for Optimizing Connections in Differentiable Logic Gate Networkscited by 5
  11. 2025Scalable Interconnect Learning in Boolean Networkscited by 4
  12. 2024BOLD: Boolean Logic Deep Learningcited by 3
  13. 2025nanoML for Human Activity Recognitioncited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.