arXiv (All)
open access
On the Depth Scalability of Logic Gate Networks
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Depth Scalability of Logic Gate Networks#783610
- Accelerating the Mitigation of LLM Inference Nondeterminism Across GPU Architectures#1061261
- Decoupling Logical Masks from GPU Execution for Dynamic Block-Sparse Attention#1061497
- ChainForge: Characterizing Embedding as the Bottleneck in Quantum Annealer Workloads#617073
- ChainForge: Characterizing Embedding as the Bottleneck in Quantum Annealer Workloads#616573
Record · ID 785201
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive