- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper aims to make machine learning models suitable for fast, resource-constrained inference by constructing networks from simple Boolean operations, such as AND, OR, and XOR. The challenge is that both each neuron's operation and its connections are discrete choices, making these networks difficult to train directly. The proposed approach combines three components: learning connections through candidate resampling, compact Boolean convolutions, and progressive discretization. The experiments show improved accuracy and smaller pruned Boolean networks relative to the implemented DiffLogicNet and TreeLogicNet baselines.
Critical strengths
- The method addresses a meaningful bottleneck.
- The improvements over the implemented baselines are supported.
- The ablations directly examine the proposed mechanisms.
Critical weaknesses
- The headline hardware claims exceed the evidence presented. The abstract states that the model achieves 6.48 ns latency “on an FPGA,” and the introduction mentions FPGA synthesis on an edge device. However, Section 5.4 and Appendix J explain that the reported times come from a heuristic formula based on circuit depth and output-reduction depth.
- The strongest relevant sparse-connectivity alternative is not adequately addressed. Section 4.1 characterizes earlier connection-learning approaches as requiring large, dense connection-weight matrices. That description does not cover the sparse Top-K variant in the cited LILogic Net paper, which learns input choices from small candidate sets.
- Model selection, tuning, and training-cost reporting need more clarification. Several reporting issues affect reproducibility and the interpretation of small accuracy differences: checkpoint selection is insufficiently specified, patience is described as both fixed and tuned (section 5.1), and the training-time tables appear to cover different amounts of work (table 5 vs. table 22).
Questions for authors
- Are any device-specific synthesis, place-and-route, or hardware measurements available for the reported models?
- Why does the reproduced TreeLogicNet-L use substantially more Boolean operations than the published model? Which differences arise from architecture, pruning, and inclusion of output summation or other decoding logic?
- How does the proposed connection-learning strategy compare with sparse Top-K wiring?
3 comments
Q4. Why does the reproduced TreeLogicNet-L use substantially more Boolean operations than the published model? Which differences arise from architecture, pruning, and inclusion of output summation or other decoding logic?
Our TreeLogicNet baseline follows the published architecture through a third-party implementation, as explained in Appendix E, because the official implementation is unavailable. The operation counts, however, are obtained using different simplification procedures. Petersen et al. (2024, Appendix A.3) report gate counts after custom logic synthesis, while we count Boolean operations after the simple pruning in Algorithm 3, which removes constants and disconnected nodes, bypasses identity gates and absorbs negations. The published description of their synthesis procedure does not provide enough detail for us to reproduce its gate counts.
To keep our comparison consistent, we apply the same pruning procedure and operation-counting convention to TreeLogicNet and our models. We have clarified in the revised manuscript that these #BOPs differ from the synthesized gate counts reported in the original work.
Thank you for the clarification. I would like to keep my current score as weak acceptance.
We thank Reviewer \Rkc for their careful comments and helpful feedback. We address each concern below. The additional results (Figs. S1–S2 and Table S1) are available at: https://mega.nz/file/K95xnL4L#PMYmluEDLyHFevYiF2aKcYFBlmR0JYevN80ltil9BqY
Q1. FPGA inference time is based on estimation. Are any device-specific synthesis, place-and-route, or hardware measurements available for the reported models?
The FPGA device used for the published baseline measurements is unavailable to us, and we do not have the AMD Vivado license required for the intended device-specific evaluation. To provide a fair comparison despite these resource constraints, we evaluate our models and the baselines using the same timing model and coefficients. This lets us compare the models under the same hardware assumptions.
The estimate is based on how these circuits compute: each stage must wait for the preceding stage to produce its inputs, so a longer chain of stages takes more time. We therefore estimate latency by counting the successive Boolean and output-summation stages, assigning a fixed delay to each stage, and adding register overhead. Using the same stage delays for all models translates differences in circuit depth into comparable latency estimates. As a consistency check, this timing model estimates 8.16 ns and 9.06 ns for the convolutional CIFAR-10 TreeLogicNet-S and TreeLogicNet-M models, respectively, closely matching the 9 ns reported by Petersen et al. (2024) for both models.
We have revised the abstract and introduction in the revised manuscript to clearly identify the reported latencies as practical estimates rather than direct hardware measurements.
Q2. How does the connection-learning method in Sec. 4.1 compare to the sparse Top-K variant in LILogic Net?
We have added comparisons with LILogicNet (Fojcik et al., 2026) and DWN (Bacellar et al., 2024) on CIFAR-10 in Figs. S1–S2. We included both dense and the sparse top-K variant for LILogic. These comparisons show that our models offer better accuracy–training-memory and accuracy–training-throughput tradeoffs. For example, our convolutional T model achieves 62.71% accuracy, exceeding the 60.98% of LILogicNet-L and 57.51% of DWN, while requiring less training memory and training faster than both.
Q3. Several reporting issues: checkpoint selection is insufficiently specified, patience is described as both fixed and tuned (section 5.1), and the training-time tables appear to cover different amounts of work (table 5 vs. table 22).
Checkpoint selection. We select the checkpoint with the highest test accuracy observed during periodic evaluation. Appendix H (Lines 1228–1230) specifies evaluation every 1K training steps for regular models and every 2K steps for convolutional models. To assess sensitivity to this choice, Table S1 compares the selected and final checkpoints from the same run. Their accuracies differ by 0.45 and 0.44 percentage points for Ours-S and Ours-M, respectively, while the two checkpoints coincide for Ours-L. These small differences indicate that the reported performance is robust to this checkpoint-selection choice.
Patience. The fixed and tuned values refer to two different parameters. Adaptive discretization uses a fixed patience of T=200 across all models and datasets, whereas adaptive resampling uses a patience chosen by model configuration, as specified in Appendix H and Table 22. We have clarified this distinction in the revised manuscript.
Training time. The tables report different quantities: Table 22 gives measured wall-clock times for complete training runs (including the validation time every 1k steps), whereas Tables 4 and 5 extrapolated times from throughput benchmarks for 300K and 400K steps, respectively. The latter therefore does not represent the full 600K-step training runs used for the convolutional models.
To remove this confusion, we have removed the extrapolated time entries from Tables 4 and 5 and revised Sec. 5.5 to compare training throughput. We will update Table 5 with the common-hardware throughput measurements accompanying Figs. S1–S2. Table 22 will retain the measured complete-run times, with the hardware and training budgets stated explicitly.