1 paper
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…