b98d5883da07b3b3b8afd3fd654dc57a-Paper-Conference.pdf

For such neural networks, we prove a non-constant lower bound of that are compatible with certain polyhedral complexes, more precisely with the the best known lower bound in general is still 2. We focus on neural networks linear functions on R .