Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2006.03177
Cited By
Hardness of Learning Neural Networks with Natural Weights
5 June 2020
Amit Daniely
Gal Vardi
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Hardness of Learning Neural Networks with Natural Weights"
8 / 8 papers shown
Title
Quadratic Suffices for Over-parametrization via Matrix Chernoff Bound
Zhao Song
Xin Yang
57
91
0
09 Jun 2019
Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networks
Yuan Cao
Quanquan Gu
MLT
AI4CE
80
389
0
30 May 2019
A Comparative Analysis of the Optimization and Generalization Property of Two-layer Neural Network and Random Feature Models Under Gradient Descent Dynamics
E. Weinan
Chao Ma
Lei Wu
MLT
55
123
0
08 Apr 2019
Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layers
Zeyuan Allen-Zhu
Yuanzhi Li
Yingyu Liang
MLT
183
769
0
12 Nov 2018
Gradient Descent Provably Optimizes Over-parameterized Neural Networks
S. Du
Xiyu Zhai
Barnabás Póczós
Aarti Singh
MLT
ODL
214
1,270
0
04 Oct 2018
Improved Learning of One-hidden-layer Convolutional Neural Networks with Overlaps
S. Du
Surbhi Goel
MLT
53
17
0
20 May 2018
From average case complexity to improper learning complexity
Amit Daniely
N. Linial
Shai Shalev-Shwartz
115
120
0
10 Nov 2013
Provable Bounds for Learning Some Deep Representations
Sanjeev Arora
Aditya Bhaskara
Rong Ge
Tengyu Ma
BDL
92
335
0
23 Oct 2013
1