Complete Identification of Deep ReLU Networks through {\L}ukasiewicz Logic
Quick summary
arXiv:2602.00266v2 Announce Type: replace Abstract: Two deep ReLU networks can have entirely different architectures and parameters, yet realize the same function. We provide a complete characterization of this nonuniqueness. This is effected by building a symbolic calculus for deep ReLU networks, equivalence and simplification of networks becoming derivation of formulae, in close parallel to Shannon's analysis of switching circuits through Boolean logic. Inspired by Shannon, who turned circuit synthesis into the manipulation of Boolean formulae by the axioms of Boolean algebra, we turn ReLU n
Key takeaways
- arXiv:2602.00266v2 Announce Type: replace Abstract: Two deep ReLU networks can have entirely different architectures and parameters, yet realize the same function.
- We provide a complete characterization of this nonuniqueness.
- This is effected by building a symbolic calculus for deep ReLU networks, equivalence and simplification of networks becoming derivation of formulae, in close parallel to Shannon's analysis of switching circuits through Boolean logic.
Why it matters
The importance of “Complete Identification of Deep ReLU Networks through {\L}ukasiewicz Logic” will be measured by what changes in practice. User behavior, access conditions, verifiable performance and responsible-use outcomes are the signals worth following.
Member comments