On the Geometry and Optimization of Polynomial Convolutional Networks
<|reference_start|>On the Geometry and Optimization of Polynomial Convolutional Networks: We study convolutional neural networks with monomial activation functions. Specifically, we prove that their parameterization map is regular and is an isomorphism almost everywhere, up to rescaling the filters. By leveraging on tools from algebraic geometry, we explore the geometric properties of the image in function space of this map -- typically referred to as neuromanifold. In particular, we compute the dimension and the degree of the neuromanifold, which measure the expressivity of the model, and describe its singularities. Moreover, for a generic large dataset, we derive an explicit formula that quantifies the number of critical points arising in the optimization of a regression loss.<|reference_end|>
@article{shahverdi2024on,
    title={On the Geometry and Optimization of Polynomial Convolutional Networks},
    author={Vahid Shahverdi, Giovanni Luca Marchetti, Kathl'en Kohn},
    journal={arXiv preprint arXiv:2410.00722},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.00722},
    primaryClass={cs.LG math.AG}
}