Any ReLU network can be exactly simulated with two hidden layers
The authors give a homological-algebra proof using fillings and a separate direct combinatorial proof.
3 stories, newest first · one card per story
The authors give a homological-algebra proof using fillings and a separate direct combinatorial proof.
The nonrecursive construction uses hidden-layer widths O(N squared) and 2 to the O(N log N).
A paper proves ReLU architectures can realize prescribed Betti numbers, with tighter bounds for products of spheres.
Today 1.4K readers · 1.6K views · 308 reads · all time 110K views