{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T17:08:56Z","timestamp":1779901736986,"version":"3.53.1"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/globalsip.2018.8646618","type":"proceedings-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T20:33:06Z","timestamp":1552941186000},"page":"1179-1183","source":"Crossref","is-referenced-by-count":33,"title":["ZEROTH-ORDER STOCHASTIC PROJECTED GRADIENT DESCENT FOR NONCONVEX OPTIMIZATION"],"prefix":"10.1109","author":[{"given":"Sijia","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xingguo","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pin-Yu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jarvis","family":"Haupt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lisa","family":"Amini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"3054","article-title":"A comprehensive linear speedup analysis for asynchronous stochastic parallel optimization from zeroth-order to first-order","author":"lian","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref11","first-page":"288","article-title":"Zeroth-order online ADMM: Convergence analysis and applications","volume":"84","author":"liu","year":"2018","journal-title":"Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics"},{"key":"ref12","article-title":"Zeroth-order stochastic variance reduction for nonconvex optimization","author":"liu","year":"2018","journal-title":"arXiv preprint arXiv 1805 10367"},{"key":"ref13","article-title":"Stochastic zeroth-order optimization via variance reduction method","author":"liu","year":"2018","journal-title":"arXiv preprint arXiv 1805 11811"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3052973.3053009"},{"key":"ref15","article-title":"Towards deep learning models resistant to adversarial attacks","author":"madry","year":"2017","journal-title":"arXiv preprint arXiv 1706 06083"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3128572.3140448"},{"key":"ref17","article-title":"Autozoom: Autoencoder-based zeroth order optimization method for attacking black-box neural networks","author":"tu","year":"2018","journal-title":"arXiv preprint arXiv 1805 11770"},{"key":"ref18","article-title":"Zeroth order nonconvex multi-agent optimization over networks","author":"hajinezhad","year":"2017","journal-title":"arXiv preprint arXiv 1710 09997"},{"key":"ref19","first-page":"1145","article-title":"Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization","author":"reddi","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref6","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"2010","journal-title":"COLT"},{"key":"ref5","article-title":"On the information-adaptive variants of the ADMM: an iteration complexity perspective","volume":"12","author":"gao","year":"2014","journal-title":"Optimization Online"},{"key":"ref8","author":"hajinezhad","year":"2017","journal-title":"Zenith A zeroth-order distributed algorithm for multi-agent non-convex optimization"},{"key":"ref7","first-page":"1","article-title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","volume":"18","author":"shamir","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref2","first-page":"527","article-title":"Random gradient-free minimization of convex functions","volume":"2","author":"nesterov","year":"2015","journal-title":"Foundations of Computational Mathematics"},{"key":"ref1","first-page":"2672","article-title":"Query complexity of derivative-free optimization","author":"jamieson","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0846-1"},{"key":"ref20","article-title":"Efficient regret minimization in non-convex games","author":"hazan","year":"2017","journal-title":"arXiv preprint arXiv 1708 05227"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1561\/2200000058"}],"event":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","location":"Anaheim, CA, USA","start":{"date-parts":[[2018,11,26]]},"end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8637665\/8645964\/08646618.pdf?arnumber=8646618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:02:10Z","timestamp":1598227330000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8646618\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/globalsip.2018.8646618","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}