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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.