Parameterized Hardness of Zonotope Containment and Neural Network Verification
It is proved that, for all $\ell\ge 2$, deciding positivity (and thus surjectivity) of a function computed by an $\ell$-layer ReLU network is W[$\ell-1$]-hard when parameterized by the input dimension $d$.