{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T10:31:27Z","timestamp":1781605887696,"version":"3.54.5"},"reference-count":25,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2015,2,15]],"date-time":"2015-02-15T00:00:00Z","timestamp":1423958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-13-1-0043"],"award-info":[{"award-number":["FA9550-13-1-0043"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["YFAN66001-111-4131"],"award-info":[{"award-number":["YFAN66001-111-4131"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Science Foundation","award":["Grant Nos. DMS-0906392, DMS-CMG 1025465, AGS-1003823, DMS-1106642, DMS-CAREER-1352656"],"award-info":[{"award-number":["Grant Nos. DMS-0906392, DMS-CMG 1025465, AGS-1003823, DMS-1106642, DMS-CAREER-1352656"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,1,1]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>The application of the lasso is espoused in high dimensional settings where only a small number of the regression coefficients are believed to be non-zero (i.e. the solution is sparse). Moreover, statistical properties of high dimensional lasso estimators are often proved under the assumption that the correlation between the predictors is bounded. In this vein, co-ordinatewise methods, which are the most common means of computing the lasso solution, naturally work well in the presence of low-to-moderate multicollinearity. The computational speed of co-ordinatewise algorithms, although excellent for sparse and low-to-moderate multicollinearity settings, degrades as sparsity decreases and multicollinearity increases. Though lack of sparsity and high multicollinearity can be quite common in contemporary applications, model selection is still a necessity in such settings. Motivated by the limitations of co-ordinatewise algorithms in such \u2018non-sparse\u2019 and \u2018high multicollinearity\u2019 settings, we propose the novel \u2018deterministic Bayesian lasso\u2019 algorithm for computing the lasso solution. This algorithm is developed by considering a limiting version of the Bayesian lasso. In contrast with co-ordinatewise algorithms, the performance of the deterministic Bayesian lasso improves as sparsity decreases and multicollinearity increases. Importantly, in non-sparse and high multicollinearity settings the algorithm proposed can offer substantial increases in computational speed over co-ordinatewise algorithms. A rigorous theoretical analysis demonstrates that the deterministic Bayesian lasso algorithm converges to the lasso solution and it leads to a representation of the lasso estimator which shows how it achieves both l1- and l2-types of shrinkage simultaneously. Connections between the deterministic Bayesian lasso and other algorithms are also provided. The benefits of the deterministic Bayesian lasso algorithm are then illustrated on simulated and real data.<\/jats:p>","DOI":"10.1111\/rssb.12106","type":"journal-article","created":{"date-parts":[[2015,2,16]],"date-time":"2015-02-16T04:55:00Z","timestamp":1424062500000},"page":"153-174","source":"Crossref","is-referenced-by-count":41,"title":["Lasso Regression: Estimation and Shrinkage via the Limit of Gibbs Sampling"],"prefix":"10.1093","volume":"78","author":[{"given":"Bala","family":"Rajaratnam","sequence":"first","affiliation":[{"name":"Stanford University , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven","family":"Roberts","sequence":"additional","affiliation":[{"name":"Australian National University , Canberra , Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Doug","family":"Sparks","sequence":"additional","affiliation":[{"name":"Stanford University , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Onkar","family":"Dalal","sequence":"additional","affiliation":[{"name":"Stanford University , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2015,2,15]]},"reference":[{"key":"2023021709314144200_rssb12106-cit-0001","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1111\/j.2517-6161.1974.tb00989.x","article-title":"Scale mixtures of normal distributions","volume":"36","author":"Andrews","year":"1974","journal-title":"J. R. Statist. Soc. B"},{"key":"2023021709314144200_rssb12106-cit-0002","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s00365-007-9003-x","article-title":"A simple proof of the restricted isometry property for random matrices","volume":"28","author":"Baraniuk","year":"2008","journal-title":"Constr. Approximn"},{"key":"2023021709314144200_rssb12106-cit-0003","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","article-title":"Decoding by linear programming","volume":"51","author":"Cand\u00e8s","year":"2005","journal-title":"IEEE Trans. Inform. Theor."},{"key":"2023021709314144200_rssb12106-cit-0004","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","article-title":"Enhancing sparsity by reweighted l 1 minimization","volume":"14","author":"Cand\u00e8s","year":"2008","journal-title":"J. Four. Anal. Appl."},{"key":"2023021709314144200_rssb12106-cit-0005","first-page":"3869","volume-title":"Proc. Int. Conf. Acoustics, Speech and Signal Processing","author":"Chartrand","year":"2008"},{"key":"2023021709314144200_rssb12106-cit-0006","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s10463-011-0333-x","article-title":"Space alternating penalized Kullback proximal point algorithms for maximizing likelihood with nondifferentiable penalty","volume":"64","author":"Chr\u00e9tien","year":"2012","journal-title":"Ann. Inst. Statist. Math."},{"key":"2023021709314144200_rssb12106-cit-0007","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symblc Computn"},{"key":"2023021709314144200_rssb12106-cit-0008","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/cpa.20303","article-title":"Iteratively reweighted least squares minimization for sparse recovery","volume":"63","author":"Daubechies","year":"2010","journal-title":"Communs Pure Appl. Math."},{"key":"2023021709314144200_rssb12106-cit-0009","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm (with discussion)","volume":"39","author":"Dempster","year":"1977","journal-title":"J. R. Statist. Soc. B"},{"key":"2023021709314144200_rssb12106-cit-0010","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/j.acha.2009.05.001","article-title":"Instance-optimality in probability with an l1-minimization decoder","volume":"27","author":"DeVore","year":"2009","journal-title":"Appl. Computnl Harm. Anal."},{"key":"2023021709314144200_rssb12106-cit-0011","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","article-title":"Least angle regression","volume":"32","author":"Efron","year":"2004","journal-title":"Ann. Statist."},{"key":"2023021709314144200_rssb12106-cit-0012","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1214\/07-AOAS131","article-title":"Pathwise coordinate optimization","volume":"1","author":"Friedman","year":"2007","journal-title":"Ann. Appl. Statist."},{"key":"2023021709314144200_rssb12106-cit-0013","first-page":"1","article-title":"Regularisation paths for generalized linear models via coordinate descent","volume":"33","author":"Friedman","year":"2010","journal-title":"J. Statist. Softwr."},{"key":"2023021709314144200_rssb12106-cit-0014","volume-title":"LARS: least angle regression, lasso and forward stagewise. R Package Version 1.2","author":"Hastie","year":"2013"},{"key":"2023021709314144200_rssb12106-cit-0015","volume-title":"ppls: penalized partial least squares. R Package Version 1.05","author":"Kraemer","year":"2012"},{"key":"2023021709314144200_rssb12106-cit-0016","first-page":"369","article-title":"Penalized regression, standard errors, and Bayesian lassos","volume":"5","author":"Kyung","year":"2010","journal-title":"Bayesn Anal."},{"key":"2023021709314144200_rssb12106-cit-0017","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","article-title":"Improved iteratively reweighted least squares for unconstrained smoothed lq minimization","volume":"51","author":"Lai","year":"2013","journal-title":"SIAM J. Numer. Anal."},{"key":"2023021709314144200_rssb12106-cit-0019","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jsfa.2740350116","article-title":"Application of near infrared reflectance spectroscopy to the compositional analysis of biscuits and biscuit doughs","volume":"35","author":"Osborne","year":"1984","journal-title":"J. Sci. Food Agric."},{"key":"2023021709314144200_rssb12106-cit-0020","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/10618600.2000.10474883","article-title":"On the lasso and its dual","volume":"9","author":"Osborne","year":"2000","journal-title":"J. Computnl Graph. Statist."},{"key":"2023021709314144200_rssb12106-cit-0021","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1198\/016214508000000337","article-title":"The Bayesian lasso","volume":"103","author":"Park","year":"2008","journal-title":"J. Am. Statist. Ass."},{"key":"2023021709314144200_rssb12106-cit-0022","volume-title":"R: a Language and Environment for Statistical Computing","author":"R Development Core Team","year":"2011"},{"key":"2023021709314144200_rssb12106-cit-0023","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"J. R. Statist. Soc. B"},{"key":"2023021709314144200_rssb12106-cit-0024","doi-asserted-by":"crossref","first-page":"1456","DOI":"10.1214\/13-EJS815","article-title":"The lasso problem and uniqueness","volume":"7","author":"Tibshirani","year":"2013","journal-title":"Electron. J. Statist."},{"key":"2023021709314144200_rssb12106-cit-0025","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1214\/aos\/1176346060","article-title":"On the convergence properties of the EM algorithm","volume":"11","author":"Wu","year":"1983","journal-title":"Ann. Statist."},{"key":"2023021709314144200_rssb12106-cit-0027","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","article-title":"Regularization and variable selection via the elastic net","volume":"67","author":"Zou","year":"2005","journal-title":"J. R. Statist. Soc. B"}],"container-title":["Journal of the Royal Statistical Society Series B: Statistical Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Frssb.12106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/78\/1\/153\/49235787\/jrsssb_78_1_153.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/78\/1\/153\/49235787\/jrsssb_78_1_153.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T06:27:14Z","timestamp":1717741634000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jrsssb\/article\/78\/1\/153\/7040683"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,15]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2015,2,15]]},"published-print":{"date-parts":[[2016,1,1]]}},"URL":"https:\/\/doi.org\/10.1111\/rssb.12106","relation":{},"ISSN":["1369-7412","1467-9868"],"issn-type":[{"value":"1369-7412","type":"print"},{"value":"1467-9868","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2016,1]]},"published":{"date-parts":[[2015,2,15]]}}}