Search Results for author:
Found 3 papers, 0 papers with code
Does a sparse ReLU network training problem always admit an optimum?
Then, the existence of a global optimum is proved for every concrete optimization problem involving a shallow sparse ReLU neural network of output dimension one.
Sparsity in neural networks can improve their privacy
This article measures how sparsity can make neural networks more robust to membership inference attacks.
Sparsity in neural networks can increase their privacy
This article measures how sparsity can make neural networks more robust to membership inference attacks.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
