35 citations · 114 across the 25 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LG2020
Tight Hardness Results for Training Depth-2 ReLU Networks
Surbhi Goel, Adam Klivans, Pasin Manurangsi +1
We prove several hardness results for training depth-2 neural networks with the ReLU activation function; these networks are simply weighted sums (that may include negative coeffic…
math.CO2020
A note on the largest induced matching in graphs avoiding a fixed bipartite graph
Ben Lund, Daniel Reichman
We give a simple proof that every -vertex graph -regular graph that does not contain a fixed bipartite graph as a subgraph has an induced matching of size .