{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T20:56:12Z","timestamp":1764276972197,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation (NSF)","doi-asserted-by":"publisher","award":["1816227","1815696","1750911"],"award-info":[{"award-number":["1816227","1815696","1750911"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330915","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"436-446","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Dual Averaging Method for Online Graph-structured Sparsity"],"prefix":"10.1145","author":[{"given":"Baojian","family":"Zhou","sequence":"first","affiliation":[{"name":"University at Albany, SUNY, ALBANY, NY, USA"}]},{"given":"Feng","family":"Chen","sequence":"additional","affiliation":[{"name":"University at Albany, SUNY, ALBANY, NY, USA"}]},{"given":"Yiming","family":"Ying","sequence":"additional","affiliation":[{"name":"University at Albany, SUNY, Albany, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Cem Aksoylar Lorenzo Orecchia and Venkatesh Saligrama. 2017. Connected Subgraph Detection with Mirror Descent on SDPs. In ICML. PMLR 51--59.   Cem Aksoylar Lorenzo Orecchia and Venkatesh Saligrama. 2017. Connected Subgraph Detection with Mirror Descent on SDPs. In ICML. PMLR 51--59."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS839"},{"key":"e_1_3_2_1_3_1","volume-title":"JMLR","volume":"14","author":"Bahmani Sohail","year":"2013"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040894"},{"volume-title":"Online learning and stochastic approximations. On-line learning in neural networks","year":"1998","author":"Bottou L\u00e9on","key":"e_1_3_2_1_5_1"},{"volume-title":"Advances in neural information processing systems","author":"Bottou L\u00e9on","key":"e_1_3_2_1_6_1"},{"volume-title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence . AAAI Press, 1389--1395","year":"2016","author":"Chen Feng","key":"e_1_3_2_1_7_1"},{"volume-title":"Online Continuous Submodular Maximization. In International Conference on Artificial Intelligence and Statistics. PMLR","year":"2018","author":"Chen Lin","key":"e_1_3_2_1_8_1"},{"volume-title":"Network-based classification of breast cancer metastasis. Molecular systems biology","year":"2007","author":"Chuang Han-Yu","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190095.1190160"},{"key":"e_1_3_2_1_11_1","volume-title":"JMLR","volume":"12","author":"Duchi John","year":"2011"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390191"},{"key":"e_1_3_2_1_13_1","volume-title":"JMLR","volume":"10","author":"Duchi John","year":"2009"},{"volume-title":"Online Learning with Non-Convex Losses and Non-Stationary Regret. In International Conference on Artificial Intelligence and Statistics. PMLR, 235--243","year":"2018","author":"Gao Xiand","key":"e_1_3_2_1_14_1"},{"volume-title":"Learning in Non-convex Games with an Optimization Oracle. arXiv preprint arXiv:1810.07362","year":"2018","author":"Gonen Alon","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000013"},{"key":"e_1_3_2_1_18_1","unstructured":"Elad Hazan Karan Singh and Cyril Zhang. 2017. Efficient Regret Minimization in Non-Convex Games. In ICML. PMLR 1433--1441.   Elad Hazan Karan Singh and Cyril Zhang. 2017. Efficient Regret Minimization in Non-Convex Games. In ICML. PMLR 1433--1441."},{"volume-title":"Workshop of the 11th DIMACS Implementation Challenge .","year":"2014","author":"Hegde Chinmay","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875152"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457939"},{"key":"e_1_3_2_1_22_1","unstructured":"Chinmay Hegde Piotr Indyk and Ludwig Schmidt. 2015b. A nearly-linear time framework for graph-structured sparsity. In ICML. PMLR 928--937.   Chinmay Hegde Piotr Indyk and Ludwig Schmidt. 2015b. A nearly-linear time framework for graph-structured sparsity. In ICML. PMLR 928--937."},{"key":"e_1_3_2_1_23_1","unstructured":"Chinmay Hegde Piotr Indyk and Ludwig Schmidt. 2016. Fast recovery from a union of subspaces. In NIPS. 4394--4402.   Chinmay Hegde Piotr Indyk and Ludwig Schmidt. 2016. Fast recovery from a union of subspaces. In NIPS. 4394--4402."},{"key":"e_1_3_2_1_24_1","unstructured":"Bo-Jian Hou Lijun Zhang and Zhi-Hua Zhou. 2017. Learning with Feature Evolvable Streams. In NIPS. 1416--1426.   Bo-Jian Hou Lijun Zhang and Zhi-Hua Zhou. 2017. Learning with Feature Evolvable Streams. In NIPS. 1416--1426."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"},{"volume-title":"SODA","author":"Johnson David S","key":"e_1_3_2_1_26_1"},{"volume-title":"KEGG: new perspectives on genomes, pathways, diseases and drugs. Nucleic acids research","year":"2016","author":"Kanehisa Minoru","key":"e_1_3_2_1_27_1"},{"volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","year":"2014","author":"Kingma Diederik P","key":"e_1_3_2_1_28_1"},{"volume-title":"On the online Frank-Wolfe algorithms for convex and non-convex optimizations. arXiv:1510.01171","year":"2015","author":"Lafond Jean","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","volume-title":"JMLR","volume":"10","author":"Langford John","year":"2009"},{"key":"e_1_3_2_1_31_1","unstructured":"Yann LeCun. 1998. The MNIST database of handwritten digits. http:\/\/yann. lecun. com\/exdb\/mnist\/ (1998).  Yann LeCun. 1998. The MNIST database of handwritten digits. http:\/\/yann. lecun. com\/exdb\/mnist\/ (1998)."},{"volume-title":"Graph-Sparse Logistic Regression. arXiv preprint arXiv:1712.05510","year":"2017","author":"LeNail Alexander","key":"e_1_3_2_1_32_1"},{"volume-title":"et almbox","year":"2017","author":"Li Taibo","key":"e_1_3_2_1_33_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2749330"},{"key":"e_1_3_2_1_36_1","first-page":"22","article-title":"Connected Sub-graph Detection","volume":"14","author":"Qian Jing","year":"2014","journal-title":"AISTATS"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623674"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"e_1_3_2_1_39_1","series-title":"Series B (Methodological)","volume-title":"Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society","author":"Tibshirani Robert","year":"1996"},{"key":"e_1_3_2_1_40_1","volume-title":"JMLR","volume":"11","author":"Xiao Lin","year":"2010"},{"key":"e_1_3_2_1_41_1","unstructured":"Haiqin Yang Zenglin Xu Irwin King and Michael R Lyu. 2010. Online learning for group lasso. In ICML. PMLR 1191--1198.   Haiqin Yang Zenglin Xu Irwin King and Michael R Lyu. 2010. Online learning for group lasso. In ICML. PMLR 1191--1198."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3224420"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/3115443.3115592"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883632"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.08.007"},{"key":"e_1_3_2_1_46_1","unstructured":"Xiaotong Yuan Ping Li and Tong Zhang. 2014. Gradient hard thresholding pursuit for sparsity-constrained optimization. In ICML . PMLR 127--135.   Xiaotong Yuan Ping Li and Tong Zhang. 2014. Gradient hard thresholding pursuit for sparsity-constrained optimization. In ICML . PMLR 127--135."},{"volume-title":"NIPS. Curran Associates","year":"1985","author":"Zhou Pan","key":"e_1_3_2_1_47_1"},{"key":"e_1_3_2_1_48_1","unstructured":"Martin Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent. In ICML . PMLR 928--936.   Martin Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent. In ICML . PMLR 928--936."}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330915","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330915","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:03Z","timestamp":1750206363000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":48,"alternative-id":["10.1145\/3292500.3330915","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330915","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}