Unimodality conjecture for minimal filling neural-network architectures
Fix the depth , the endpoint widths and , and the activation degree . Let be a width vector, and let mean coordinatewise comparison. An architecture is filling when its neurovariety has the full expected ambient dimension; is minimal when no smaller width vector with the same fixed endpoints has this property.
Unimodality conjecture. Every minimal width vector whose architecture is filling is unimodal: there exists such that is weakly increasing and is weakly decreasing.
The conjecture formalizes the architectural heuristic that a network should first expand its feature capacity and then contract it. The supplied text gives motivation but no proof or resolution.
References
Primary source
Kaie Kubjas, Jiayi Li and Maximilian Wiesmann, “Geometry of Polynomial Neural Networks”, arXiv:2402.00949 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.