mlsanityData to 14 Oct 2026

On the Depth Scalability of Logic Gate Networks

arXiv 2607.21633 ↗First posted 19 Jul 2026cs.LG cs.AI cs.LOcited by 0

Not on the map. Why?

Abstract (arXiv)

Logic Gate Networks (LGNs) compute through compositions of Boolean operations, yet existing LGNs do not reliably benefit from increased depth. We identify two causes: optimization collapse and topology-induced degradation of output-specific credit that persists even after skip-biased initialization and straight-through estimation stabilize training. We introduce Input-Anchored Logic Gate Networks (IALGNs), in which each gate combines a private hidden spine with a direct input anchor. This topology prevents output-path merging while retaining input access at every layer. Credit diagnostics show that random wiring dilutes or conflicts output-specific gradients, whereas IALGN maintains usable and coherent credit. Random-kx relaxation improves anchor selection without relaxing the spine. Across MNIST, CIFAR-10, and CIFAR-100, IALGN exhibits consistent fixed-width depth--accuracy scaling up to 150 layers, while alternative topologies saturate or degrade. Linear probes, topology ablations, and operation-aware analysis show that trained IALGNs preserve private states and apply sparse anchor-conditioned updates. These results indicate that scalable LGN depth requires both stable optimization and credit-preserving information access.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 5 references that are in the map. First posted on arXiv 19 Jul 2026.

Builds on

2 of 5 references.

References · 2

  1. 2025Recurrent Deep Differentiable Logic Gate Networkscited by 12
  2. 2026Fully Trainable Deep Differentiable Logic Gate Networks and Lookup Table Networkscited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Fitting Multilinear Polynomials for Logic Gate Networks
  2. 2024ShortCircuit: AlphaZero-Driven Circuit Design
  3. 2026Polynomial Surrogate Training for Differentiable Ternary Logic Gate Networks
  4. 2026Differentiable Logic Synthesis: Spectral Coefficient Selection via Sinkhorn-Constrained Composition
  5. 2026EI-DDLGN: Efficient Encrypted Inference with Deep Differentiable Logic Gate Networks under TFHE
  6. 2024NeuraLUT: Hiding Neural Network Density in Boolean Synthesizable Functions
  7. 2024Towards Narrowing the Generalization Gap in Deep Boolean Networks
  8. 2025Alignment-Constrained Dynamic Pruning for LLMs: Identifying and Preserving Alignment-Critical Circuits