{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:35:32Z","timestamp":1759206932173},"reference-count":51,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Technometrics"],"published-print":{"date-parts":[[2019,7,3]]},"DOI":"10.1080\/00401706.2018.1537897","type":"journal-article","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T14:08:06Z","timestamp":1545314886000},"page":"409-421","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":7,"title":["An Interactive Greedy Approach to Group Sparsity in High Dimensions"],"prefix":"10.1080","volume":"61","author":[{"given":"Wei","family":"Qian","sequence":"first","affiliation":[{"name":"Department of Applied Economics and Statistics, University of Delaware"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wending","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Rochester"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuhiro","family":"Sogawa","sequence":"additional","affiliation":[{"name":"Knowledge Discovery Research Laboratories, NEC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryohei","family":"Fujimaki","sequence":"additional","affiliation":[{"name":"Knowledge Discovery Research Laboratories, NEC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xitong","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Rochester"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Rochester"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2019,3,22]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","unstructured":"Beck, A. and Teboulle, M. (2009), \u2018A fast iterative shrinkage-thresholding algorithm for linear inverse problems\u2019,SIAM Journal on Imaging Sciences2(1), 183\u2013202.","DOI":"10.1137\/080716542"},{"key":"CIT0002","doi-asserted-by":"crossref","unstructured":"Ben-Haim, Z. and Eldar, Y. C. (2011), \u2018Near-oracle performance of greedy block-sparse estimation techniques from noisy measurements\u2019,IEEE Journal of Selected Topics in Signal Processing5(5), 1032\u20131047.","DOI":"10.1109\/JSTSP.2011.2160250"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"Bickel, P. J., Ritov, Y. and Tsybakov, A. B. (2009), \u2018Simultaneous analysis of lasso and Dantzig selector\u2019,The Annals of Statistics37(4), 1705\u20131732.","DOI":"10.1214\/08-AOS620"},{"key":"CIT0004","doi-asserted-by":"crossref","unstructured":"Candes, E. J. and Tao, T. (2005), \u2018Decoding by linear programming\u2019,IEEE Transactions on Information Theory51(12), 4203\u20134215.","DOI":"10.1109\/TIT.2005.858979"},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"Candes, E. J. and Tao, T. (2007), \u2018The Dantzig selector: Statistical estimation whenpis much larger thann\u2019,The Annals of Statistics35(6), 2313\u20132351.","DOI":"10.1214\/009053606000001523"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"Culp, M. V., Ryan, K. J., Banerjee, P. and Morehead, M. (2018), \u2018On data integration problems with manifolds\u2019,Technometrics, to appear.","DOI":"10.1080\/00401706.2018.1482788"},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"Ding, S. and Cook, R. D. (2018), \u2018Matrix variate regressions and envelope models\u2019,Journal of the Royal Statistical Society: Series B (Statistical Methodology)80(2), 387\u2013408.","DOI":"10.1111\/rssb.12247"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"Fan, J. and Li, R. (2001), \u2018Variable selection via nonconcave penalized likelihood and its oracle properties\u2019,Journal of the American Statistical Association96(456), 1348\u20131360.","DOI":"10.1198\/016214501753382273"},{"key":"CIT0009","doi-asserted-by":"crossref","unstructured":"Fan, J., Xue, L. and Zou, H. (2014), \u2018Strong oracle optimality of folded concave penalized estimation\u2019,Annals of Statistics42(3), 819.","DOI":"10.1214\/13-AOS1198"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"Friedman, J., Hastie, T. and Tibshirani, R. (2010), \u2018Regularization paths for generalized linear models via coordinate descent\u2019,Journal of Statistical Software33(1), 1.","DOI":"10.18637\/jss.v033.i01"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"Gu, Y., Fan, J., Kong, L., Ma, S. and Zou, H. (2018), \u2018ADMM for high-dimensional sparse penalized quantile regression\u2019,Technometrics60(3), 319\u2013331.","DOI":"10.1080\/00401706.2017.1345703"},{"key":"CIT0012","doi-asserted-by":"crossref","unstructured":"Hsu, D., Kakade, S. and Zhang, T. (2012), \u2018A tail inequality for quadratic forms of subgaussian random vectors\u2019,Electronic Communications in Probability17(52), 1\u20136.","DOI":"10.1214\/ECP.v17-2079"},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"Huang, J., Breheny, P. and Ma, S. (2012), \u2018A selective review of group selection in high-dimensional models\u2019,Statistical Science27(4).","DOI":"10.1214\/12-STS392"},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"Huang, J. and Zhang, T. (2010), \u2018The benefit of group sparsity\u2019,The Annals of Statistics38(4), 1978\u20132004.","DOI":"10.1214\/09-AOS778"},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"Huang, Y. and Liu, J. (2018), \u2018Exclusive sparsity norm minimization with random groups via cone projection\u2019,IEEE Transactions on Neural Networks and Learning Systems.","DOI":"10.1109\/TNNLS.2018.2819958"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"Ing, C.K. and Lai, T. L. (2011), \u2018A stepwise regression method and consistent model selection for high-dimensional sparse linear models\u2019,Statistica Sinica21(4), 1473\u20131513.","DOI":"10.5705\/ss.2010.081"},{"key":"CIT0017","doi-asserted-by":"crossref","unstructured":"Jenatton, R., Gramfort, A., Michel, V., Obozinski, G., Eger, E., Bach, F. and Thirion, B. (2012), \u2018Multiscale mining of fmri data with hierarchical structured sparsity\u2019,SIAM Journal on Imaging Sciences5(3), 835\u2013856.","DOI":"10.1137\/110832380"},{"key":"CIT0018","doi-asserted-by":"crossref","unstructured":"Jiao, Y., Jin, B. and Lu, X. (2017), \u2018Group sparse recovery via thel0(l2) penalty: Theory and algorithm\u2019,IEEE Transactions on Signal Processing65(4), 998\u20131012.","DOI":"10.1109\/TSP.2016.2630028"},{"key":"CIT0019","unstructured":"Kim, Y., Kim, J. and Kim, Y. (2006), \u2018Blockwise sparse regression\u2019,Statistica Sinica16(2), 375."},{"key":"CIT0020","unstructured":"Kong, D., Fujimaki, R., Liu, J., Nie, F. and Ding, C. (2014), \u2018Exclusive feature learning on arbitrary structures via l12-norm\u2019,Advances in Neural Information Processing Systemspp. 1655\u20131663."},{"key":"CIT0021","unstructured":"Lafferty, J., McCallum, A., Pereira, F. et al. (2001), Conditional random fields: Probabilistic models for segmenting and labeling sequence data,in\u2018International Conference on Machine Learning\u2019, pp. 282\u2013289."},{"key":"CIT0022","unstructured":"Liu, J., Fujimaki, R. and Ye, J. (2013), \u2018Forward-backward greedy algorithms for general convex smooth functions over a cardinality constraint\u2019,International Conference on Machine Learning."},{"key":"CIT0023","unstructured":"Liu, J., Wonka, P. and Ye, J. (2012), \u2018A multi-stage framework for Dantzig selector and lasso\u2019,Journal of Machine Learning Research13(1), 1189\u20131219."},{"key":"CIT0024","doi-asserted-by":"crossref","unstructured":"Lounici, K., Pontil, M., Van De Geer, S. and Tsybakov, A. B. (2011), \u2018Oracle inequalities and optimal inference under group sparsity\u2019,The Annals of Statistics39(4), 2164\u20132204.","DOI":"10.1214\/11-AOS896"},{"key":"CIT0025","unstructured":"Lozano, A. C., Swirszcz, G. and Abe, N. (2011), Group orthogonal matching pursuit for logistic regression,in\u2018International Conference on Artificial Intelligence and Statistics\u2019, pp. 452\u2013460."},{"key":"CIT0026","doi-asserted-by":"crossref","unstructured":"Mallat, S. G. and Zhang, Z. (1993), \u2018Matching pursuits with time-frequency dictionaries\u2019,IEEE Transactions on Signal Processing41(12), 3397\u20133415.","DOI":"10.1109\/78.258082"},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"McCullagh, P. and Nelder, J. A. (1989),Generalized Linear Models, Chapman and Hall.","DOI":"10.1007\/978-1-4899-3242-6"},{"key":"CIT0028","doi-asserted-by":"crossref","unstructured":"Meier, L., Van De Geer, S. and B\u00fchlmann, P. (2008), \u2018The group lasso for logistic regression\u2019,Journal of the Royal Statistical Society, Series B70(1), 53\u201371.","DOI":"10.1111\/j.1467-9868.2007.00627.x"},{"key":"CIT0029","doi-asserted-by":"crossref","unstructured":"Mitra, R., Zhang, C.H. et al. (2016), \u2018The benefit of group sparsity in group inference with de-biased scaled group lasso\u2019,Electronic Journal of Statistics10(2), 1829\u20131873.","DOI":"10.1214\/16-EJS1120"},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"Nardi, Y. and Rinaldo, A. (2008), \u2018On the asymptotic properties of the group lasso estimator for linear models\u2019,Electronic Journal of Statistics2, 605\u2013633.","DOI":"10.1214\/08-EJS200"},{"key":"CIT0031","doi-asserted-by":"crossref","unstructured":"Qian, W., Ding, S. and Cook, R. D. (2018), \u2018Sparse minimum discrepancy approach to sufficient dimension reduction with simultaneous variable selection in ultrahigh dimension\u2019,Journal of the American Statistical Association, to appear.","DOI":"10.1080\/01621459.2018.1497498"},{"key":"CIT0032","doi-asserted-by":"crossref","unstructured":"Qian, W. and Yang, Y. (2013), \u2018Model selection via standard error adjusted adaptive lasso\u2019,Annals of the Institute of Statistical Mathematics65(2), 295\u2013318.","DOI":"10.1007\/s10463-012-0370-0"},{"key":"CIT0033","unstructured":"Qian, W. and Yang, Y. (2016), \u2018Kernel estimation and model combination in a bandit problem with covariates\u2019,Journal of Machine Learning Research17(1), 5181\u20135217."},{"key":"CIT0034","doi-asserted-by":"crossref","unstructured":"Qian, W., Yang, Y. and Zou, H. (2016), \u2018Tweedie's compound Poisson model with grouped elastic net\u2019,Journal of Computational and Graphical Statistics25(2), 606\u2013625.","DOI":"10.1080\/10618600.2015.1005213"},{"key":"CIT0035","doi-asserted-by":"crossref","unstructured":"Sutton, C., McCallum, A. et al. (2012), \u2018An introduction to conditional random fields\u2019,Foundations and Trends[textregistered] in Machine Learning4(4), 267\u2013373.","DOI":"10.1561\/2200000013"},{"key":"CIT0036","unstructured":"Swirszcz, G., Abe, N. and Lozano, A. C. (2009), Grouped orthogonal matching pursuit for variable selection and prediction,in\u2018Advances in Neural Information Processing Systems\u2019, pp. 1150\u20131158."},{"key":"CIT0037","doi-asserted-by":"crossref","unstructured":"Tibshirani, R. (1996), \u2018Regression shrinkage and selection via the lasso\u2019,Journal of the Royal Statistical Society: Series B (Methodological)58(1), 267\u2013288.","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"CIT0038","doi-asserted-by":"crossref","unstructured":"Tropp, J. A. (2004), \u2018Greed is good: Algorithmic results for sparse approximation\u2019,IEEE Transactions on Information Theory50(10), 2231\u20132242.","DOI":"10.1109\/TIT.2004.834793"},{"key":"CIT0039","doi-asserted-by":"crossref","unstructured":"van de Geer, S., B\u00fchlmann, P. and Zhou, S. (2011), \u2018The adaptive and the thresholded lasso for potentially misspecified models (and a lower bound for the lasso)\u2019,Electronic Journal of Statistics5, 688\u2013749.","DOI":"10.1214\/11-EJS624"},{"key":"CIT0040","unstructured":"Vershynin, R. (2010), \u2018Introduction to the non-asymptotic analysis of random matrices\u2019,arXiv preprint:1011.3027."},{"key":"CIT0041","doi-asserted-by":"crossref","unstructured":"Wei, F. and Huang, J. (2010), \u2018Consistent group selection in high-dimensional linear regression\u2019,Bernoulli16(4), 1369.","DOI":"10.3150\/10-BEJ252"},{"key":"CIT0042","unstructured":"Yang, H., Huang, Y., Tran, L., Liu, J. and Huang, S. (2016), \u2018On benefits of selection diversity via bilevel exclusive sparsity\u2019,Proceedings of the IEEE Conference on Computer Vision and Pattern Recognitionpp. 5945\u20135954."},{"key":"CIT0043","doi-asserted-by":"crossref","unstructured":"Yuan, M. and Lin, Y. (2006), \u2018Model selection and estimation in regression with grouped variables\u2019,Journal of the Royal Statistical Society: Series B (Statistical Methodology)68(1), 49\u201367.","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"CIT0044","doi-asserted-by":"crossref","unstructured":"Zhang, C.H. et al. (2010), \u2018Nearly unbiased variable selection under minimax concave penalty\u2019,The Annals of Statistics38(2), 894\u2013942.","DOI":"10.1214\/09-AOS729"},{"key":"CIT0045","unstructured":"Zhang, T. (2009), \u2018On the consistency of feature selection using greedy least squares regression\u2019,Journal of Machine Learning Research10, 555\u2013568."},{"key":"CIT0046","doi-asserted-by":"crossref","unstructured":"Zhang, T. (2011a), \u2018Adaptive forward-backward greedy algorithm for learning sparse representations\u2019,IEEE Transactions on Information Theory57(7), 4689\u20134708.","DOI":"10.1109\/TIT.2011.2146690"},{"key":"CIT0047","doi-asserted-by":"crossref","unstructured":"Zhang, T. (2011b), \u2018Sparse recovery with orthogonal matching pursuit under RIP\u2019,IEEE Transactions on Information Theory57(9), 6215\u20136221.","DOI":"10.1109\/TIT.2011.2162263"},{"key":"CIT0048","doi-asserted-by":"crossref","unstructured":"Zhao, T., Liu, H. and Zhang, T. (2017), \u2018Pathwise coordinate optimization for sparse learning: algorithm and theory\u2019,The Annals of Statistics46(1), 180\u2013218.","DOI":"10.1214\/17-AOS1547"},{"key":"CIT0049","doi-asserted-by":"crossref","unstructured":"Zhou, H., Sehl, M. E., Sinsheimer, J. S. and Lange, K. (2010), \u2018Association screening of common and rare genetic variants by penalized regression\u2019,Bioinformatics26(19), 2375\u20132382.","DOI":"10.1093\/bioinformatics\/btq448"},{"key":"CIT0050","doi-asserted-by":"crossref","unstructured":"Zou, H. (2006), \u2018The adaptive lasso and its oracle properties\u2019,Journal of the American Statistical Association101(476), 1418\u20131429.","DOI":"10.1198\/016214506000000735"},{"key":"CIT0051","doi-asserted-by":"crossref","unstructured":"Zou, H. and Zhang, H. H. (2009), \u2018On the adaptive elastic-net with a diverging number of parameters\u2019,The Annals of Statistics37(4), 1733.","DOI":"10.1214\/08-AOS625"}],"container-title":["Technometrics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00401706.2018.1537897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T14:23:10Z","timestamp":1720880590000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00401706.2018.1537897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,22]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7,3]]}},"alternative-id":["10.1080\/00401706.2018.1537897"],"URL":"https:\/\/doi.org\/10.1080\/00401706.2018.1537897","relation":{},"ISSN":["0040-1706","1537-2723"],"issn-type":[{"value":"0040-1706","type":"print"},{"value":"1537-2723","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,22]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=utch20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=utch20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2017-07-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-27","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-03-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}