Nearly Tight Rademacher Bounds for Sparsely Activated Neural Networks
Theory paper derives nearly tight Rademacher complexity bounds for sparsely activated one-hidden-layer ReLU networks.
1 stories, newest first · one card per story
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