On the Geometry and Optimization of Polynomial Convolutional Networks

Vahid Shahverdi, Giovanni Luca Marchetti, Kathlén Kohn
10/1/2024
cs.LGmath.AG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{shahverdi2024geometry,
  title  = {On the Geometry and Optimization of Polynomial Convolutional Networks},
  author = {Vahid Shahverdi and Giovanni Luca Marchetti and Kathlén Kohn},
  year   = {2024},
  eprint = {2410.00722},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.00722v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.00722.svg)](https://codeofpaper.com/paper/2410.00722)

Discussion