{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:03Z","timestamp":1750220883293,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,3]]},"DOI":"10.1145\/3357384.3358021","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"881-890","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Loopless Semi-Stochastic Gradient Descent with Less Hard Thresholding for Sparse Learning"],"prefix":"10.1145","author":[{"given":"Xiangyang","family":"Liu","sequence":"first","affiliation":[{"name":"Xidian University, Xi'an, China"}]},{"given":"Bingkun","family":"Wei","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}]},{"given":"Fanhua","family":"Shang","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}]},{"given":"Hongying","family":"Liu","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502607"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"e_1_3_2_1_3_1","unstructured":"Jinghui Chen and Quanquan Gu. 2016. Accelerated Stochastic Block Coordinate Gradient Descent for Sparsity Constrained Nonconvex Optimization. In UAI. 132--141.  Jinghui Chen and Quanquan Gu. 2016. Accelerated Stochastic Block Coordinate Gradient Descent for Sparsity Constrained Nonconvex Optimization. In UAI. 132--141."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Jinghui Chen and Quanquan Gu. 2017. Fast Newton Hard Thresholding Pursuit for Sparsity Constrained Nonconvex Optimization. In SIGKDD. 757--766.  Jinghui Chen and Quanquan Gu. 2017. Fast Newton Hard Thresholding Pursuit for Sparsity Constrained Nonconvex Optimization. In SIGKDD. 757--766.","DOI":"10.1145\/3097983.3098165"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/100806278"},{"key":"e_1_3_2_1_7_1","unstructured":"Hongchang Gao and Heng Huang. 2018. Stochastic Second-Order Method for Large-Scale Nonconvex Sparse Learning Models. In IJCAI. 2128--2134.  Hongchang Gao and Heng Huang. 2018. Stochastic Second-Order Method for Large-Scale Nonconvex Sparse Learning Models. In IJCAI. 2128--2134."},{"key":"e_1_3_2_1_8_1","unstructured":"Prateek Jain Ambuj Tewari and Purushottam Kar. 2014. On iterative hard thresholding methods for high-dimensional mestimation. In NIPS. 685--693.  Prateek Jain Ambuj Tewari and Purushottam Kar. 2014. On iterative hard thresholding methods for high-dimensional mestimation. In NIPS. 685--693."},{"key":"e_1_3_2_1_9_1","unstructured":"Ali Jalali Christopher C Johnson and Pradeep K Ravikumar. 2011. On learning discrete graphical models using greedy methods. In NIPS. 1935--1943.  Ali Jalali Christopher C Johnson and Pradeep K Ravikumar. 2011. On learning discrete graphical models using greedy methods. In NIPS. 1935--1943."},{"key":"e_1_3_2_1_10_1","unstructured":"Rie Johnson and Tong Zhang. 2013. Accelerating stochastic gradient descent using predictive variance reduction. In NIPS. 315--323.  Rie Johnson and Tong Zhang. 2013. Accelerating stochastic gradient descent using predictive variance reduction. In NIPS. 315--323."},{"key":"e_1_3_2_1_11_1","unstructured":"Jakub Konecn  Jakub Konecn"},{"key":"e_1_3_2_1_12_1","first-page":"1","article-title":"Semi-stochastic gradient descent methods","volume":"3","author":"Richt\u00b4arik Peter","year":"2017","journal-title":"Front. Appl. Math. Stat."},{"volume-title":"Don't Jump Through Hoops and Remove Those Loops: SVRG and Katyusha are Better Without the Outer Loop. arXiv:1901.08689","year":"2019","author":"Kovalev Dmitry","key":"e_1_3_2_1_13_1"},{"volume-title":"ASAGA: Asynchronous Parallel SAGA. In AISTATS. 46--54.","year":"2017","author":"Leblond Remi","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","unstructured":"Xingguo Li Tuo Zhao Raman Arora Han Liu and Jarvis Haupt. 2016. Stochastic variance reduced optimization for nonconvex sparse learning. In ICML. 917--925.  Xingguo Li Tuo Zhao Raman Arora Han Liu and Jarvis Haupt. 2016. Stochastic variance reduced optimization for nonconvex sparse learning. In ICML. 917--925."},{"key":"e_1_3_2_1_16_1","unstructured":"Qihang Lin Zhaosong Lu and Lin Xiao. 2014. An accelerated proximal coordinate gradient method. In NIPS. 3059--3067.  Qihang Lin Zhaosong Lu and Lin Xiao. 2014. An accelerated proximal coordinate gradient method. In NIPS. 3059--3067."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1057000"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2886471"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2017.8023462"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2749330"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1859929"},{"volume-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent. In NIPS. 693--701.","year":"2011","author":"Recht Benjamin","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","unstructured":"Sashank Reddi Ahmed Hefny Suvrit Sra Barnabas Poczos and Alexander Smola. 2015. On variance reduction in stochastic gradient descent and its asynchronous variants. In NIPS. 2647-- 2655.  Sashank Reddi Ahmed Hefny Suvrit Sra Barnabas Poczos and Alexander Smola. 2015. On variance reduction in stochastic gradient descent and its asynchronous variants. In NIPS. 2647-- 2655."},{"key":"e_1_3_2_1_26_1","first-page":"1","article-title":"A Tight Bound of Hard Thresholding","volume":"18","author":"Shen Jie","year":"2018","journal-title":"JMLR"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909108"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2880454"},{"key":"e_1_3_2_1_29_1","unstructured":"Xiaotong Yuan Ping Li and Tong Zhang. 2014. Gradient hard thresholding pursuit for sparsity-constrained optimization. In ICML. 127--135.  Xiaotong Yuan Ping Li and Tong Zhang. 2014. Gradient hard thresholding pursuit for sparsity-constrained optimization. In ICML. 127--135."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3176828"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2015.2430359"},{"key":"e_1_3_2_1_32_1","unstructured":"Baojian Zhou Feng Chen and Yiming Ying. 2019. Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization. In ICML. 7563--7573.  Baojian Zhou Feng Chen and Yiming Ying. 2019. Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization. In ICML. 7563--7573."},{"key":"e_1_3_2_1_33_1","unstructured":"Kaiwen Zhou Fanhua Shang and James Cheng. 2018. A Simple Stochastic Variance Reduced Algorithm with Fast Convergence Rates. In ICML. 5975--5984.  Kaiwen Zhou Fanhua Shang and James Cheng. 2018. A Simple Stochastic Variance Reduced Algorithm with Fast Convergence Rates. In ICML. 5975--5984."},{"key":"e_1_3_2_1_34_1","unstructured":"Pan Zhou Xiaotong Yuan and Jiashi Feng. 2018. Efficient stochastic gradient hard thresholding. In NeurIPS. 1984--1993.  Pan Zhou Xiaotong Yuan and Jiashi Feng. 2018. Efficient stochastic gradient hard thresholding. In NeurIPS. 1984--1993."}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Beijing China","acronym":"CIKM '19"},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3358021","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3358021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:18Z","timestamp":1750203858000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3358021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":34,"alternative-id":["10.1145\/3357384.3358021","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3358021","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}