{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:46:04Z","timestamp":1725705964426},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/ssp.2016.7551783","type":"proceedings-article","created":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T18:15:37Z","timestamp":1473790537000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Bilevel feature selection in nearly-linear time"],"prefix":"10.1109","author":[{"given":"Chinmay","family":"Hegde","sequence":"first","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/j.acha.2008.07.002"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TIT.2009.2016006"},{"key":"ref12","first-page":"685","article-title":"On iterative hard thresholding methods for high-dimensional m-estimation","author":"jain","year":"2014","journal-title":"Proc Adv Neu Inf Proc Sys"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TIT.2010.2040894"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1137\/1.9781611973402.113"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/ISIT.2014.6875152"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1007\/978-3-662-43948-7_49"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TIT.2015.2457939"},{"key":"ref18","article-title":"Bilevel feature selection in nearly-linear time","author":"hegde","year":"2016","journal-title":"Iowa State University Technical Report"},{"key":"ref19","article-title":"A nearly linear-time framework for graph-structured sparsity","author":"hegde","year":"2015","journal-title":"Proc Int Conf Machine Learning"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.4310\/SII.2009.v2.n3.a10"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1093\/biomet\/asp020"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/2623330.2623662"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1214\/12-STS392"},{"key":"ref8","article-title":"Classification with sparse overlapping groups","author":"rao","year":"2014","journal-title":"arXiv preprint arXiv 1402 4512"},{"key":"ref7","first-page":"2202","article-title":"Sparse overlapping sets lasso for multitask learning and its application to FMRI analysis","author":"rao","year":"2013","journal-title":"Proc Adv Neu Inf Proc Sys"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1093\/bib\/bbn027"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1080\/10618600.2012.681250"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1111\/biom.12300"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/j.neuroimage.2012.03.059"}],"event":{"name":"2016 IEEE Statistical Signal Processing Workshop (SSP)","start":{"date-parts":[[2016,6,26]]},"location":"Palma de Mallorca, Spain","end":{"date-parts":[[2016,6,29]]}},"container-title":["2016 IEEE Statistical Signal Processing Workshop (SSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7542733\/7551701\/07551783.pdf?arnumber=7551783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,10,13]],"date-time":"2016-10-13T12:08:54Z","timestamp":1476360534000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7551783\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/ssp.2016.7551783","relation":{},"subject":[],"published":{"date-parts":[[2016,6]]}}}