Lower bounds on neural networks and slicing the hypercube

Abstract: 

What is the size of the smallest neural network that computes the parity function? How many hyperplanes are needed to slice the Boolean hypercube? In this talk we will discuss the connection between the problems as well as lower bounds, using methods from convex geometry, probability and combinatorics.