From the 1 of 6 linked papers with an AI index.
6 papers
Optimal partial plank coverings
Egor Bakaev, Alexander Polyanskii
The paper investigates how to place planks of a fixed total width to cover the largest possible volume of a convex body, proving that for a Euclidean ball and for any planar convex…
A simplex-based measure of symmetry
Egor Bakaev, Amir Yehudayoff
For compact convex sets , denote by the smallest size of a homothet of that contains . We define a measure of symmetry based on the -s…
A note on the affine plank conjecture
Egor Bakaev, Amir Yehudayoff
In 1951, Bang posed the affine plank conjecture, which remains open: If a convex body in is covered by planks, then the total relative width of the planks is at leas…
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…
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…
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…