activity
20192026
most citedSuperpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient Descent

9 citations · 9 across the 8 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2019

Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler

Zhengfeng Ji, Zhihan Jin, Pinyan Lu

The algorithm and complexity of approximating the permanent of a matrix is an extensively studied topic. Recently, its connection with quantum supremacy and more specifically Boson…