Showing cs.LGShow all
3 papers · 1 filter
cs.LG2026
Shallower ReLU Network Representations via Exact Linear Algebra
Kilian Rueß, Gennadiy Averkov, Florestan Brunck +7
We study the depth required by ReLU networks to exactly represent piecewise linear functions, focusing specifically on the maximum function. This problem has recently received sign…
cs.LG2025
On the expressivity of sparse maxout networks
Moritz Grillo, Tobias Hofmann
We study the expressivity of sparse maxout networks, where each neuron takes a fixed number of inputs from the previous layer and employs a, possibly multi-argument, maxout activat…
cs.LG2025
Depth-Bounds for Neural Networks via the Braid Arrangement
Moritz Grillo, Christoph Hertrich, Georg Loho
We contribute towards resolving the open question of how many hidden layers are required in ReLU networks for exactly representing all continuous and piecewise linear functions on…