activity
20192026
most citedThe Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality

19 citations · 67 across the 17 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

math.CO2025

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…

cs.LG2025

On the Depth of Monotone ReLU Neural Networks and ICNNs

Egor Bakaev, Florestan Brunck, Christoph Hertrich +2

We study two models of ReLU neural networks: monotone networks (ReLU) and input convex neural networks (ICNN). Our focus is on expressivity, mostly in terms of depth, and we pr…

cs.CC2025

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks

Moritz Stargalla, Christoph Hertrich, Daniel Reichman

An established measure of the expressive power of a given ReLU neural network is the number of linear regions into which it partitions the input space. There exist many different,…

cs.LG2025

Better Neural Network Expressivity: Subdividing the Simplex

Egor Bakaev, Florestan Brunck, Christoph Hertrich +2

This work studies the expressivity of ReLU neural networks with a focus on their depth. A sequence of previous works showed that hidden layers are suffi…

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…