Similar Items: On the Architectural Complexity of Neural Networks
- A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes
- Efficient Reconstruction of Arboreal Networks
- Approximating the Network Design Problem for Potential-Based Flows
- Most ReLU Networks Admit Identifiable Parameters
- Inferring Phylogenetic Networks from Allowed and Forbidden LCA-Constraints
- A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput