{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:27:40Z","timestamp":1772296060113,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,14]],"date-time":"2009-06-14T00:00:00Z","timestamp":1244937600000},"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","doi-asserted-by":"publisher","award":["347631"],"award-info":[{"award-number":["347631"]}],"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":[[2009,6,14]]},"DOI":"10.1145\/1553374.1553484","type":"proceedings-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T13:34:36Z","timestamp":1245159276000},"page":"857-864","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["An efficient projection for\n            <i>l<\/i>\n            <sub>1<\/sub>\n            ,\n            <sub>\u221e<\/sub>\n            regularization"],"prefix":"10.1145","author":[{"given":"Ariadna","family":"Quattoni","sequence":"first","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA and UC Berkeley EECS and ICSI, Berkeley, CA"}]},{"given":"Xavier","family":"Carreras","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA"}]},{"given":"Michael","family":"Collins","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA"}]},{"given":"Trevor","family":"Darrell","sequence":"additional","affiliation":[{"name":"UC Berkeley EECS and ICSI, Berkeley, CA"}]}],"member":"320","published-online":{"date-parts":[[2009,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1088686"},{"key":"e_1_3_2_1_2_1","volume-title":"Multi-task feature learning. Advances in Neural Information Processing Systems 19 (pp. 41--48)","author":"Argyriou A.","year":"2007","unstructured":"Argyriou , A. , Evgeniou , T. , &amp; Pontil , M. ( 2007 ). Multi-task feature learning. Advances in Neural Information Processing Systems 19 (pp. 41--48) . Argyriou, A., Evgeniou, T., &amp; Pontil, M. (2007). Multi-task feature learning. Advances in Neural Information Processing Systems 19 (pp. 41--48)."},{"key":"e_1_3_2_1_3_1","volume-title":"Nonlinear programming","author":"Bertsekas D.","year":"1999","unstructured":"Bertsekas , D. ( 1999 ). Nonlinear programming . Athena Scientific . Bertsekas, D. (1999). Nonlinear programming. Athena Scientific."},{"key":"e_1_3_2_1_4_1","volume-title":"echnical Report). Statistics Dept.","author":"Donoho D.","year":"2004","unstructured":"Donoho , D. ( 2004 ). For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution. ( T echnical Report). Statistics Dept. , Stanford University . Donoho, D. (2004). For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution. (Technical Report). Statistics Dept., Stanford University."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390191"},{"key":"e_1_3_2_1_6_1","first-page":"725","article-title":"The pyramid match kernel: Efficient learning with sets of features","volume":"8","author":"Grauman K.","year":"2008","unstructured":"Grauman , K. , &amp; Darrell , T. ( 2008 ). The pyramid match kernel: Efficient learning with sets of features . Journal of Machine Learning Research , 8 , 725 -- 760 . Grauman, K., &amp; Darrell, T. (2008). The pyramid match kernel: Efficient learning with sets of features. Journal of Machine Learning Research, 8, 725--760.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_7_1","volume-title":"Effcient structure learning of markov networks using l1-regularization. Advances in Neural Information Processing Systems 19 (pp. 817--824)","author":"Lee S. I.","year":"2007","unstructured":"Lee , S. I. , Ganapathi , V. , &amp; Koller , D. ( 2007 ). Effcient structure learning of markov networks using l1-regularization. Advances in Neural Information Processing Systems 19 (pp. 817--824) . Lee, S. I., Ganapathi, V., &amp; Koller, D. (2007). Effcient structure learning of markov networks using l1-regularization. Advances in Neural Information Processing Systems 19 (pp. 817--824)."},{"key":"e_1_3_2_1_8_1","volume-title":"echnical Report). ETH Seminar fur Statistik.","author":"Meier L.","year":"2006","unstructured":"Meier , L. , van de Geer , S. , &amp; Buhlmann , P. ( 2006 ). The group lasso for logistic regression ( T echnical Report). ETH Seminar fur Statistik. Meier, L., van de Geer, S., &amp; Buhlmann, P. (2006). The group lasso for logistic regression (Technical Report). ETH Seminar fur Statistik."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015435"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"e_1_3_2_1_11_1","volume-title":"echnical Report). Statistics Dept.","author":"Obozinski G.","year":"2006","unstructured":"Obozinski , G. , Taskar , B. , &amp; Jordan , M. ( 2006 ). Multitask feature selection ( T echnical Report). Statistics Dept. , University of California , Berkeley. Obozinski, G., Taskar, B., &amp; Jordan, M. (2006). Multitask feature selection (Technical Report). Statistics Dept., University of California, Berkeley."},{"key":"e_1_3_2_1_12_1","volume-title":"echnical Report)","author":"Park M. Y.","year":"2006","unstructured":"Park , M. Y. , &amp; Hastie , T. ( 2006 ). Regularization path algorithms for detecting gene interactions ( T echnical Report) . Stanford University . Park, M. Y., &amp; Hastie, T. (2006). Regularization path algorithms for detecting gene interactions (Technical Report). Stanford University."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1835044"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587367"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of Conf. on Artificial Intelligence and Statistics (pp. 456--463)","author":"Schmidt M.","year":"2009","unstructured":"Schmidt , M. , van den Berg , E. , Friedlander , M. , &amp; Murphy , K. ( 2009 ). Optimizing costly functions with simple constraints: A limited-memory projected quasi-newton algorithm . Proc. of Conf. on Artificial Intelligence and Statistics (pp. 456--463) . Schmidt, M., van den Berg, E., Friedlander, M., &amp; Murphy, K. (2009). Optimizing costly functions with simple constraints: A limited-memory projected quasi-newton algorithm. Proc. of Conf. on Artificial Intelligence and Statistics (pp. 456--463)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273598"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2007.01.025"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.05.031"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1198\/004017005000000139"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. of Intl. Conf. on Machine Learning (pp. 928--936)","author":"Zinkevich M.","year":"2003","unstructured":"Zinkevich , M. ( 2003 ). Online convex programming and generalized infinitesimal gradient ascent . Proc. of Intl. Conf. on Machine Learning (pp. 928--936) . Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. Proc. of Intl. Conf. on Machine Learning (pp. 928--936)."}],"event":{"name":"ICML '09: The 26th Annual International Conference on Machine Learning held in conjunction with the 2007 International Conference on Inductive Logic Programming","location":"Montreal Quebec Canada","acronym":"ICML '09","sponsor":["NSF","Microsoft Research Microsoft Research","MITACS"]},"container-title":["Proceedings of the 26th Annual International Conference on Machine Learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1553374.1553484","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1553374.1553484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:38Z","timestamp":1750253378000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1553374.1553484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,14]]},"references-count":21,"alternative-id":["10.1145\/1553374.1553484","10.1145\/1553374"],"URL":"https:\/\/doi.org\/10.1145\/1553374.1553484","relation":{},"subject":[],"published":{"date-parts":[[2009,6,14]]},"assertion":[{"value":"2009-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}