Kou, Yiwen, Chen, Zixiang, Gu, Quanquan, and Kakade, Sham M. Matching the Statistical Query Lower Bound for k-Sparse Parity Problems with Sign Stochastic Gradient Descent. Retrieved from https://par.nsf.gov/biblio/10556238.
Kou, Yiwen, Chen, Zixiang, Gu, Quanquan, and Kakade, Sham M.
"Matching the Statistical Query Lower Bound for k-Sparse Parity Problems with Sign Stochastic Gradient Descent". Country unknown/Code not available: Advances in Neural Information Processing Systems (NeurIPS). https://par.nsf.gov/biblio/10556238.
@article{osti_10556238,
place = {Country unknown/Code not available},
title = {Matching the Statistical Query Lower Bound for k-Sparse Parity Problems with Sign Stochastic Gradient Descent},
url = {https://par.nsf.gov/biblio/10556238},
abstractNote = {},
journal = {},
publisher = {Advances in Neural Information Processing Systems (NeurIPS)},
author = {Kou, Yiwen and Chen, Zixiang and Gu, Quanquan and Kakade, Sham M},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.