3.7k citations · 3.7k across the 8 of their papers we have counts for
1 paper · 1 filter
Michael Matena, Colin Raffel
The NP-hard problem of optimizing a shallow ReLU network can be characterized as a combinatorial search over each training example's activation pattern followed by a constrained co…