{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:23:42Z","timestamp":1762341822159,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,23]]},"DOI":"10.1109\/icassp43922.2022.9746483","type":"proceedings-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T19:50:34Z","timestamp":1651089034000},"page":"6002-6006","source":"Crossref","is-referenced-by-count":4,"title":["Zeroth-Order Randomized Subspace Newton Methods"],"prefix":"10.1109","author":[{"given":"Erik","family":"Berglund","sequence":"first","affiliation":[{"name":"KTH Royal Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarit","family":"Khirirat","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyu","family":"Wang","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Introduction to Optimization","year":"1987","author":"polyak","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref12","article-title":"Hessian-aware zeroth-order optimization for black-box adversarial attack","author":"ye","year":"2018","journal-title":"arXiv preprint arXiv 1812 11467"},{"key":"ref13","first-page":"3377","article-title":"Gradient projection iterative sketch for large-scale constrained least-squares","author":"tang","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref14","article-title":"RSN: randomized subspace Newton","volume":"32","author":"gower","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/15M1021106"},{"key":"ref16","article-title":"Global linear convergence of Newton’s method without strong-convexity or Lipschitz gradients","author":"karimireddy","year":"2018","journal-title":"arXiv preprint arXiv 1806 04102"},{"key":"ref17","first-page":"1842","article-title":"Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares","volume":"17","author":"pilanci","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9746483"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3052973.3053009"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3128572.3140448"},{"key":"ref6","first-page":"2137","article-title":"Black-box adversarial attacks with limited queries and information","author":"ilyas","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref5","article-title":"Generating adversarial malware examples for black-box attacks based on GAN","author":"hu","year":"2017","journal-title":"arXiv preprint arXiv 1702 05983"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2011.2167964"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2550005"},{"key":"ref2","article-title":"Algorithms for hyper-parameter optimization","volume":"24","author":"bergstra","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref1","article-title":"Practical bayesian optimization of machine learning algorithms","volume":"25","author":"snoek","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref9","first-page":"288","article-title":"Zeroth-order online alternating direction method of multipliers: Convergence analysis and applications","author":"liu","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.49"},{"journal-title":"Matrix Analysis ser Matrix Analysis","year":"2013","author":"horn","key":"ref22"},{"article-title":"CVXOPT: python software for convex optimization, version 1.2.6","year":"2021","author":"andersen","key":"ref21"}],"event":{"name":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2022,5,23]]},"location":"Singapore, Singapore","end":{"date-parts":[[2022,5,27]]}},"container-title":["ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9745891\/9746004\/09746483.pdf?arnumber=9746483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T20:11:32Z","timestamp":1661199092000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9746483\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/icassp43922.2022.9746483","relation":{},"subject":[],"published":{"date-parts":[[2022,5,23]]}}}