pages/index.md

Reproduction: Networked Information Aggregation for Binary Classification

Pages

Page
Executive summary
Claim 1: Depth upper bound
Claim 2: Depth lower bound
Claim 3: Residual orthogonality
Claim 4: BCE/KL decomposition
Claim 5: Logit-passing protocol
Conclusion