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$.
Vincent Froese, Moritz Grillo, Christoph Hertrich et al.· arXiv.org· 9 citations· ⚡2
It is proved that $\max_n(x)$ is exactly representable with two hidden layers for every $n\leq 12$, and these results improve upon [Bakaev, Brunck, Hertrich, Stade, Yehudayoff, STOC'26], who proved analogous logarithmic bounds with base three.
Kilian Ruess, G. Averkov, Florestan Brunck et al.· arXiv.org· 2 citations· ⚡1
These results resolve the corresponding questions regarding the parameterized complexity status for zonotope norm maximization and two-layer ICNN Lipschitz constants.
Aritra Das, Vincent Froese, Moritz Grillo et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.