Caterpillar Net represents maxima with two hidden layers
The nonrecursive construction uses hidden-layer widths O(N squared) and 2 to the O(N log N).
2 stories, newest first · one card per story
The nonrecursive construction uses hidden-layer widths O(N squared) and 2 to the O(N log N).
Theory paper derives nearly tight Rademacher complexity bounds for sparsely activated one-hidden-layer ReLU networks.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views