Block Khovanskii bound for multi-layer Pfaffian neural networks

Let f ⁣:RnRf\colon \mathbb{R}^n \to \mathbb{R} be the output of a fully connected neural network with \ell hidden layers of widths n1,,nn_1,\ldots,n_\ell and a Pfaffian activation function σ\sigma satisfying σ>0\sigma'>0. Let α\alpha and β\beta denote the Pfaffian degree parameters, and consider the Pfaffian system involving ff and its derivatives referred to in the source. Block Khovanskii bound. The number of regular solutions of this system is bounded by

2(1)2+i=1ni(ni1)2p(α,β,n,,n1,,n),2^{\frac{\ell(\ell-1)}{2}+\sum_{i=1}^{\ell}\frac{n_i(n_i-1)}{2}}\cdot p(\alpha,\beta,n,\ell,n_1,\ldots,n_\ell),

where pp is a polynomial in the indicated quantities. This conjecture seeks an exponential improvement over the generic Khovanskii bound by exploiting the layered structure of the neural-network Pfaffian chain; the multi-layer case is described as still open.

Sources & referencesView supporting material

Primary source

Paul Lezeau and Martin Lotz, “Tubular Neighbourhoods of Pfaffian Sets and Applications to Neural Networks”, arXiv:2607.08370 (2026).

Progress summary

Never refreshed

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.