A counterexample disproves the conjecture that minimal filling architectures of polynomial neural networks always have unimodal hidden layer widths.
Proceedings of the 42nd International Conference on Machine Learning , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimal Filling Architectures of Polynomial Neural Networks: Counterexamples, Frontier Search, and Defects
A counterexample disproves the conjecture that minimal filling architectures of polynomial neural networks always have unimodal hidden layer widths.