Asymptotic expected-dimension conjecture for polynomial neural network neurovarieties

Let d53d=(d0,d55fd53,dL)d53d=(d_0,d55fd53\dots,d_L) be a fixed vector of widths, with di>1d_i>1 for i=1,d55fd53,L1i=1,d55fd53\dots,L-1, and let rr denote the activation degree. The neurovariety d4b1d53d,rd4b1_{d53d,r} is the image variety associated with this architecture, and its expected dimension is the dimension predicted by the parameter count and ambient dimension.

Asymptotic expected-dimension conjecture. There exists a threshold d53fdd53f(d53d)d53fdd53f(d53d) such that, whenever r>d53fr>d53f, the neurovariety d4b1d53d,rd4b1_{d53d,r} attains the expected dimension.

The claim concerns eventual non-defectivity as the activation degree grows. It was previously asserted as a theorem, but the proof contained a mistake; the statement has subsequently been proved in the cited work on activation functions.

Sources & referencesView supporting material

Primary source

Kaie Kubjas, Jiayi Li and Maximilian Wiesmann, “Geometry of Polynomial Neural Networks”, arXiv:2402.00949 (2024).

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.