Showing 2025Show all
3 papers · 1 filter
math.MG2025
Approximation Depth of Convex Polytopes
Egor Bakaev, Florestan Brunck, Amir Yehudayoff
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approxim…
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.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…