- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
The submission studies a specific problem in the theory of neural networks (single-hidden-layer, ReLU activation, scalar outputs): if two parameter configurations produce identical outputs on a datasets is there a path connecting them in parameter space that preserves all outputs? Adopting an algebraic approach, it establishes that even if two linear regions produce the same outputs, the intersection set between them might be lower-dimensional and therefore contain an obstruction to moving between the regions. Furthermore, the submission also studies how many ReLU activation patterns can result in identical predictions.
Critical strengths
-
The findings, in particular the observation of rank-1 barriers between identically-valued output cells of ReLU networks, are interesting and original.
-
The analysis described in the submission provides a new approach for analyzing the path connectedness of ReLU networks in parameter space on finite datasets. I expect several of the arguments and techniques to carry over to related problems. The tractable (6,2,1)-example for multiplicity counting might serve as a benchmark for future works, too.
-
The submission does a decent job presented the (algebraic and therefore rather abstract) results in a measured way and putting them into the context of prior work. While the work is nevertheless quite dense, and I cannot claim that I fully understood all aspects, I applaud the authors for trying to give concrete examples, and making explicit the relation between otherwise overly abstract quantities (e.g. Section 3.2).
Critical weaknesses
-
The scope is quite limited, even for a theoretical study: ReLU networks with a single hidden layer scalar output, connecting path are exactly output preserving. The provided insights from concrete examples are limited to a handful of points and typically 1 or 2 hidden neurons.
-
The work makes no connection to real training. For ICLR, it would have been nice to see some quantities characterized for real training runs, e.g. on Gaussian or even real data, such the emergence of ghost walls and the barrier height from the appendix.
-
The fully characterized six-point planar case appears disconnected from the earlier ghost-wall analysis, which do not emerge for .
Questions for authors
- Theorem 3 makes statements about true walls, where all preactivations except the changing one are strictly signed. Is it obvious that these (always) exist?