{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:13:33Z","timestamp":1774595613138,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"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":[[2025,10,26]]},"DOI":"10.1109\/ieeeconf67917.2025.11443946","type":"proceedings-article","created":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:47:37Z","timestamp":1774554457000},"page":"1398-1402","source":"Crossref","is-referenced-by-count":0,"title":["Discovering Sparse Recovery Algorithms Using Neural Architecture Search"],"prefix":"10.1109","author":[{"given":"Patrick","family":"Yubeaton","sequence":"first","affiliation":[{"name":"New York University,Electrical and Computer Engineering,New York,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarthak","family":"Gupta","sequence":"additional","affiliation":[{"name":"New York University,Electrical and Computer Engineering,New York,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Salman","family":"Asif","sequence":"additional","affiliation":[{"name":"University of California, Riverside,Electrical and Computer Engineering,Riverside,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chinmay","family":"Hegde","sequence":"additional","affiliation":[{"name":"New York University,Tandon School of Engineering,New York,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/050626090"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref4","first-page":"399","article-title":"Learning fast approximations of sparse coding","volume-title":"Proceedings of the 27th International Conference on International Conference on Machine Learning","author":"Gregor"},{"key":"ref5","article-title":"Alista: Analytic weights are as good as learned weights in lista","volume-title":"International conference on learning representations","author":"Liu"},{"issue":"189","key":"ref6","first-page":"1","article-title":"Learning to optimize: A primer and a benchmark","volume":"23","author":"Chen","year":"2022","journal-title":"Journal of Machine Learning Research"},{"key":"ref7","article-title":"Neural architecture search with reinforcement learning","volume-title":"Proc. Int. Conf. Learning Representations","author":"Zoph"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00907"},{"key":"ref9","article-title":"Darts: Differentiable architecture search","volume-title":"Proc. Int. Conf. Machine Learning","author":"Liu"},{"key":"ref10","first-page":"543","article-title":"A method for unconstrained convex minimization problem with the rate of convergence o (1\/k2)","volume-title":"Dokl. Akad. Nauk. SSSR","volume":"269","author":"Nesterov","year":"1983"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref12","article-title":"Theoretical linear convergence of unfolded ista and its practical weights and thresholds","volume":"31","author":"Chen","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014780"},{"key":"ref14","article-title":"Learnable embedding space for efficient neural architecture compression","volume-title":"Proc. Int. Conf. Learning Representations","author":"Cao"},{"key":"ref15","article-title":"Neural architecture search with bayesian optimisation and optimal transport","volume-title":"Adv. Neural Inf. Proc. Sys. (NeurIPS)","author":"Kandasamy"},{"key":"ref16","article-title":"One-shot neural architecture search via compressive sensing","author":"Cho","year":"2019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682434"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682811"}],"event":{"name":"2025 59th Asilomar Conference on Signals, Systems, and Computers","location":"Pacific Grove, CA, USA","start":{"date-parts":[[2025,10,26]]},"end":{"date-parts":[[2025,10,29]]}},"container-title":["2025 59th Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11443114\/11443296\/11443946.pdf?arnumber=11443946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:41:21Z","timestamp":1774590081000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11443946\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,26]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf67917.2025.11443946","relation":{},"subject":[],"published":{"date-parts":[[2025,10,26]]}}}