{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:07Z","timestamp":1750309507218,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T00:00:00Z","timestamp":1733443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF-REU","award":["2349369"],"award-info":[{"award-number":["2349369"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,6]]},"DOI":"10.1145\/3709026.3709040","type":"proceedings-article","created":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T10:05:41Z","timestamp":1739613941000},"page":"75-82","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic Variance-Reduced Iterative Hard Thresholding in Graph Sparsity Optimization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5837-3112","authenticated-orcid":false,"given":"Derek","family":"Fox","sequence":"first","affiliation":[{"name":"UNCG, Greensboro, North Carolina, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9123-2045","authenticated-orcid":false,"given":"Samuel","family":"Hernandez","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, Texas, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0215-8488","authenticated-orcid":false,"given":"Qianqian","family":"Tong","sequence":"additional","affiliation":[{"name":"UNCG, Greensboro, North Carolina, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,15]]},"reference":[{"key":"e_1_3_3_2_2_2","first-page":"51","volume-title":"International Conference on Machine Learning","author":"Aksoylar Cem","year":"2017","unstructured":"Cem Aksoylar, Lorenzo Orecchia, and Venkatesh Saligrama. 2017. Connected subgraph detection with mirror descent on SDPs. In International Conference on Machine Learning. PMLR, 51\u201359."},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"crossref","unstructured":"Ery Arias-Castro Emmanuel\u00a0J Candes and Arnaud Durand. 2011. Detection of an anomalous cluster in a network. The Annals of Statistics (2011) 278\u2013304.","DOI":"10.1214\/10-AOS839"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Francis Bach Rodolphe Jenatton Julien Mairal and Guillaume Obozinski. 2012. Structured sparsity through convex optimization. Statist. Sci. 27 4 (2012) 450\u2013468.","DOI":"10.1214\/12-STS394"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Francis Bach Rodolphe Jenatton Julien Mairal Guillaume Obozinski et\u00a0al. 2012. Optimization with sparsity-inducing penalties. Foundations and Trends\u00ae in Machine Learning 4 1 (2012) 1\u2013106.","DOI":"10.1561\/2200000015"},{"key":"e_1_3_3_2_6_2","unstructured":"Sohail Bahmani Bhiksha Raj and Petros\u00a0T Boufounos. 2013. Greedy sparsity-constrained optimization. Journal of Machine Learning Research 14 Mar (2013) 807\u2013841."},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Richard\u00a0G Baraniuk Volkan Cevher Marco\u00a0F Duarte and Chinmay Hegde. 2010. Model-based compressive sensing. IEEE Transactions on information theory 56 4 (2010) 1982\u20132001.","DOI":"10.1109\/TIT.2010.2040894"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Thomas Blumensath and Mike\u00a0E Davies. 2009. Iterative hard thresholding for compressed sensing. Applied and computational harmonic analysis 27 3 (2009) 265\u2013274.","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Scott\u00a0Shaobing Chen David\u00a0L Donoho and Michael\u00a0A Saunders. 2001. Atomic decomposition by basis pursuit. SIAM review 43 1 (2001) 129\u2013159.","DOI":"10.1137\/S003614450037906X"},{"key":"e_1_3_3_2_10_2","first-page":"1646","volume-title":"Advances in neural information processing systems","author":"Defazio Aaron","year":"2014","unstructured":"Aaron Defazio, Francis Bach, and Simon Lacoste-Julien. 2014. SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In Advances in neural information processing systems. 1646\u20131654."},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Simon Foucart. 2011. Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal. 49 6 (2011) 2543\u20132563.","DOI":"10.1137\/100806278"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875152"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Chinmay Hegde Piotr Indyk and Ludwig Schmidt. 2015. Approximation algorithms for model-based compressive sensing. IEEE Transactions on Information Theory 61 9 (2015) 5129\u20135147.","DOI":"10.1109\/TIT.2015.2457939"},{"key":"e_1_3_3_2_14_2","first-page":"928","volume-title":"International Conference on Machine Learning","author":"Hegde Chinmay","year":"2015","unstructured":"Chinmay Hegde, Piotr Indyk, and Ludwig Schmidt. 2015. A nearly-linear time framework for graph-structured sparsity. In International Conference on Machine Learning. PMLR, 928\u2013937."},{"key":"e_1_3_3_2_15_2","unstructured":"Chinmay Hegde Piotr Indyk and Ludwig Schmidt. 2016. Fast recovery from a union of subspaces. Advances in Neural Information Processing Systems 29 (2016)."},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"},{"key":"e_1_3_3_2_17_2","first-page":"685","volume-title":"Advances in Neural Information Processing Systems","author":"Jain Prateek","year":"2014","unstructured":"Prateek Jain, Ambuj Tewari, and Purushottam Kar. 2014. On iterative hard thresholding methods for high-dimensional m-estimation. In Advances in Neural Information Processing Systems. 685\u2013693."},{"key":"e_1_3_3_2_18_2","first-page":"315","volume-title":"Advances in neural information processing systems","author":"Johnson Rie","year":"2013","unstructured":"Rie Johnson and Tong Zhang. 2013. Accelerating stochastic gradient descent using predictive variance reduction. In Advances in neural information processing systems. 315\u2013323."},{"key":"e_1_3_3_2_19_2","first-page":"148","volume-title":"Artificial Intelligence and Statistics","author":"Lei Lihua","year":"2017","unstructured":"Lihua Lei and Michael Jordan. 2017. Less than a single pass: Stochastically controlled stochastic gradient. In Artificial Intelligence and Statistics. 148\u2013156."},{"key":"e_1_3_3_2_20_2","first-page":"917","volume-title":"International Conference on Machine Learning","author":"Li Xingguo","year":"2016","unstructured":"Xingguo Li, Tuo Zhao, Raman Arora, Han Liu, and Jarvis Haupt. 2016. Stochastic variance reduced optimization for nonconvex sparse learning. In International Conference on Machine Learning. 917\u2013925."},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i02.5519"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Nam Nguyen Deanna Needell and Tina Woolf. 2017. Linear convergence of stochastic iterative greedy algorithms with sparse constraints. IEEE Transactions on Information Theory 63 11 (2017) 6869\u20136895.","DOI":"10.1109\/TIT.2017.2749330"},{"key":"e_1_3_3_2_23_2","first-page":"796","volume-title":"Artificial Intelligence and Statistics","author":"Qian Jing","year":"2014","unstructured":"Jing Qian, Venkatesh Saligrama, and Yuting Chen. 2014. Connected sub-graph detection. In Artificial Intelligence and Statistics. PMLR, 796\u2013804."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623674"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"crossref","unstructured":"Robert Tibshirani. 1996. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B (Methodological) 58 1 (1996) 267\u2013288.","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"crossref","unstructured":"Berwin\u00a0A Turlach William\u00a0N Venables and Stephen\u00a0J Wright. 2005. Simultaneous variable selection. Technometrics 47 3 (2005) 349\u2013363.","DOI":"10.1198\/004017005000000139"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","unstructured":"Sara\u00a0A Van\u00a0de Geer et\u00a0al. 2008. High-dimensional generalized linear models and the lasso. The Annals of Statistics 36 2 (2008) 614\u2013645.","DOI":"10.1214\/009053607000000929"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Marc\u00a0J Van De\u00a0Vijver Yudong\u00a0D He Laura\u00a0J Van\u2019t\u00a0Veer Hongyue Dai Augustinus\u00a0AM Hart Dorien\u00a0W Voskuil George\u00a0J Schreiber Johannes\u00a0L Peterse Chris Roberts Matthew\u00a0J Marton et\u00a0al. 2002. A gene-expression signature as a predictor of survival in breast cancer. New England Journal of Medicine 347 25 (2002) 1999\u20132009.","DOI":"10.1056\/NEJMoa021967"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Ming Yuan and Yi Lin. 2006. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society Series B: Statistical Methodology 68 1 (2006) 49\u201367.","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"e_1_3_3_2_30_2","first-page":"127","volume-title":"International Conference on Machine Learning","author":"Yuan Xiaotong","year":"2014","unstructured":"Xiaotong Yuan, Ping Li, and Tong Zhang. 2014. Gradient hard thresholding pursuit for sparsity-constrained optimization. In International Conference on Machine Learning. 127\u2013135."},{"key":"e_1_3_3_2_31_2","first-page":"7563","volume-title":"International Conference on Machine Learning","author":"Zhou Baojian","year":"2019","unstructured":"Baojian Zhou, Feng Chen, and Yiming Ying. 2019. Stochastic iterative hard thresholding for graph-structured sparsity optimization. In International Conference on Machine Learning. PMLR, 7563\u20137573."},{"key":"e_1_3_3_2_32_2","first-page":"1988","volume-title":"Advances in Neural Information Processing Systems","author":"Zhou Pan","year":"2018","unstructured":"Pan Zhou, Xiaotong Yuan, and Jiashi Feng. 2018. Efficient stochastic gradient hard thresholding. In Advances in Neural Information Processing Systems. 1988\u20131997."}],"event":{"name":"CSAI 2024: 2024 8th International Conference on Computer Science and Artificial Intelligence (CSAI)","acronym":"CSAI 2024","location":"Beijing China"},"container-title":["Proceedings of the 2024 8th International Conference on Computer Science and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709026.3709040","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3709026.3709040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:55Z","timestamp":1750295875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709026.3709040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,6]]},"references-count":31,"alternative-id":["10.1145\/3709026.3709040","10.1145\/3709026"],"URL":"https:\/\/doi.org\/10.1145\/3709026.3709040","relation":{},"subject":[],"published":{"date-parts":[[2024,12,6]]},"assertion":[{"value":"2025-02-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}