33 citations · 62 across the 20 of their papers we have counts for
26 papers
Two Linear Programs are Better than One
Alexander E. Black, Christoph Hertrich, Stefan Kober +1
The extension complexity of a polytope is the minimum number of facets of a polytope that projects onto it. Motivated by the complexity of neural network…
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…
Parameterized Complexity of -Lipschitz Constants for Input Convex Neural Networks and -Norm Maximization over Zonotopes
Aritra Das, Vincent Froese, Moritz Grillo +6
Lipschitz constants are a standard way to quantify the sensitivity of neural networks to small input perturbations, but computing them is difficult even for shallow ReLU networks.…
Arithmetic Circuits and Neural Networks for Regular Matroids
Christoph Hertrich, Stefan Kober, Georg Loho
We prove that there exist uniform -circuits of size to compute the basis generating polynomial of regular matroids on elements. By tropicalization, this…
Exact Characterization of Aggregate Flexibility via Generalized Polymatroids
Karan Mukhi, Georg Loho, Alessandro Abate
It is well established that the aggregate flexibility inherent in populations of distributed energy resources (DERs) can be leveraged to mitigate the intermittency and uncertainty…
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…