{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T23:07:26Z","timestamp":1697756846320},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T00:00:00Z","timestamp":1570406400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T00:00:00Z","timestamp":1570406400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10994-019-05847-6","type":"journal-article","created":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T20:18:06Z","timestamp":1570479486000},"page":"569-601","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Communication-efficient distributed multi-task learning with matrix sparsity regularization"],"prefix":"10.1007","volume":"109","author":[{"given":"Qiang","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sinno Jialin","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,7]]},"reference":[{"key":"5847_CR1","unstructured":"Arjevani, Y., & Shamir, O. (2015). Communication complexity of distributed convex learning and optimization. In Proceedings of NIPS."},{"key":"5847_CR2","doi-asserted-by":"crossref","unstructured":"Baytas, I. M., Yan, M., Jain, A. K., & Zhou, J. (2016). Asynchronous multi-task learning. In Proceedings of ICDM.","DOI":"10.1109\/ICDM.2016.0012"},{"key":"5847_CR3","unstructured":"Bellet, A., Guerraoui, R., Taziki, M., & Tommasi, M. (2018). Personalized and private peer-to-peer machine learning. In: Proceedings of AISTATS."},{"key":"5847_CR4","unstructured":"Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., & Wortman, J. (2007). Learning bounds for domain adaptation. In Proceedings of NIPS."},{"issue":"19","key":"5847_CR5","doi-asserted-by":"publisher","first-page":"5121","DOI":"10.1109\/TSP.2015.2447503","volume":"63","author":"A Bonnefoy","year":"2015","unstructured":"Bonnefoy, A., Emiya, V., Ralaivola, L., & Gribonval, R. (2015). Dynamic screening: Accelerating first-order algorithms for the lasso and group-lasso. IEEE Transactions on Signal Processing, 63(19), 5121\u20135132.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"5847_CR6","first-page":"499","volume":"2","author":"O Bousquet","year":"2002","unstructured":"Bousquet, O., & Elisseeff, A. (2002). Stability and generalization. Journal of Machine Learning Research, 2, 499\u2013526.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"5847_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"SP Boyd","year":"2011","unstructured":"Boyd, S. P., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1), 1\u2013122.","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"1","key":"5847_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1007379606734","volume":"28","author":"R Caruana","year":"1997","unstructured":"Caruana, R. (1997). Multitask learning. Machine Learning, 28(1), 41\u201375.","journal-title":"Machine Learning"},{"key":"5847_CR9","unstructured":"D\u00fcnner, C., Forte, S., Tak\u00e1c, M., & Jaggi, M. (2016). Primal\u2013dual rates and certificates. In Proceedings of ICML (pp 783\u2013792)."},{"key":"5847_CR10","unstructured":"Fercoq, O., Gramfort, A., & Salmon, J. (2015). Mind the duality gap: Safer rules for the lasso. In Proceedings of ICML."},{"issue":"2","key":"5847_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0902016","volume":"2","author":"D Gay","year":"1981","unstructured":"Gay, D. (1981). Computing optimal locally constrained steps. SIAM Journal on Scientific and Statistical Computing, 2(2), 186\u2013197.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"5847_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex analysis and minimization algorithms II: Advanced theory and bundle methods","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J. B., & Lemar\u00e9chal, C. (1993). Convex analysis and minimization algorithms II: Advanced theory and bundle methods. Berlin: Springer."},{"key":"5847_CR13","unstructured":"Jaggi, M., Smith, V., Tak\u00e1c, M., Terhorst, J., Krishnan, S., Hofmann, T., et al. (2014). Communication-efficient distributed dual coordinate ascent. In Proceedings of NIPS."},{"key":"5847_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/B978-1-55860-377-6.50048-7","volume-title":"Machine Learning Proceedings 1995","author":"Ken Lang","year":"1995","unstructured":"Lang, K. (1995). Newsweeder: Learning to filter netnews. In Proceedings of ICML."},{"key":"5847_CR15","unstructured":"Lee, S., Zhu, J., & Xing, E. P. (2010). Adaptive multi-task lasso: With application to eQTL detection. In Proceedings of NIPS."},{"key":"5847_CR16","unstructured":"Li, M., Andersen, D. G., Smola, A. J., & Yu, K. (2014). Communication efficient distributed machine learning with the parameter server. In Proceedings of NIPS."},{"key":"5847_CR17","doi-asserted-by":"crossref","unstructured":"Liu, S., Pan, S. J., & Ho, Q. (2017). Distributed multi-task relationship learning. In Proceedings of SIGKDD","DOI":"10.1145\/3097983.3098136"},{"key":"5847_CR18","unstructured":"Ma, C., Jaggi, M., Curtis, F. E., Srebro, N., & Tak\u00e1\u010d, M. (2017). An accelerated communication-efficient primal\u2013dual optimization framework for structured machine learning. arXiv preprint \narXiv:1711.05305\n\n."},{"key":"5847_CR19","unstructured":"Ma, C., Smith, V., Jaggi, M., Jordan, M. I., Richt\u00e1rik, P., & Tak\u00e1c, M. (2015). Adding vs. averaging in distributed primal\u2013dual optimization. In Proceedings of ICML."},{"key":"5847_CR20","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., & Salmon, J. (2015). Gap safe screening rules for sparse multi-task and multi-class models. In Proceedings of NIPS."},{"key":"5847_CR21","first-page":"128:1","volume":"18","author":"E Ndiaye","year":"2017","unstructured":"Ndiaye, E., Fercoq, O., Gramfort, A., & Salmon, J. (2017). Gap safe screening rules for sparsity enforcing penalties. Journal of Machine Learning Research, 18, 128:1\u2013128:33.","journal-title":"Journal of Machine Learning Research"},{"key":"5847_CR22","volume-title":"Introductory lectures on convex optimization: A basic course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y. (2013). Introductory lectures on convex optimization: A basic course. Berlin: Springer."},{"issue":"2","key":"5847_CR23","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s11222-008-9111-x","volume":"20","author":"G Obozinski","year":"2010","unstructured":"Obozinski, G., Taskar, B., & Jordan, M. (2010). Joint covariate selection and joint subspace selection for multiple classification problems. Statistics and Computing, 20(2), 231\u2013252.","journal-title":"Statistics and Computing"},{"issue":"1","key":"5847_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/09-AOS776","volume":"39","author":"G Obozinski","year":"2011","unstructured":"Obozinski, G., Wainwright, M. J., & Jordan, M. I. (2011). Support union recovery in high-dimensional multivariate regression. The Annals of Statistics, 39(1), 1\u201347.","journal-title":"The Annals of Statistics"},{"issue":"1","key":"5847_CR25","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., & Zhang, T. (2013). Stochastic dual coordinate ascent methods for regularized loss. Journal of Machine Learning Research, 14(1), 567\u2013599.","journal-title":"Journal of Machine Learning Research"},{"key":"5847_CR26","unstructured":"Smith, V., Chiang, C., Sanjabi, M., & Talwalkar, A. S. (2017a). Federated multi-task learning. In Proceedings of NIPS."},{"key":"5847_CR27","unstructured":"Smith, V., Forte, S., Jordan, M. I., & Jaggi, M. (2015). L1-regularized distributed optimization: A communication-efficient primal\u2013dual framework. CoRR \narXiv:1512.04011\n\n."},{"key":"5847_CR28","first-page":"230:1","volume":"18","author":"V Smith","year":"2017","unstructured":"Smith, V., Forte, S., Ma, C., Tak\u00e1\u010d, M., Jordan, M. I., & Jaggi, M. (2017b). Cocoa: A general framework for communication-efficient distributed optimization. Journal of Machine Learning Research, 18, 230:1\u2013230:49.","journal-title":"Journal of Machine Learning Research"},{"key":"5847_CR29","unstructured":"Vanhaesebrouck, P., Bellet, A., & Tommasi, M. (2017). Decentralized collaborative learning of personalized models over networks. In Proceedings of AISTATS."},{"key":"5847_CR30","unstructured":"Wang, J., Kolar, M., & Srebro, N. (2016). Distributed multi-task learning. In Proceedings of AISTATS."},{"key":"5847_CR31","unstructured":"Wang, J., & Ye, J. (2015). Safe screening for multi-task feature learning with multiple data matrices. In Proceedings of ICML."},{"key":"5847_CR32","unstructured":"Wang, W., Wang, J., Kolar, M., & Srebro, N. (2018). Distributed stochastic multi-task learning with graph regularization. arXiv preprint \narXiv:1802.03830\n\n."},{"key":"5847_CR33","doi-asserted-by":"crossref","unstructured":"Xie, L., Baytas, I. M., Lin, K., & Zhou, J. (2017). Privacy-preserving distributed multi-task learning with asynchronous updates. In Proceedings of SIGKDD.","DOI":"10.1145\/3097983.3098152"},{"issue":"2","key":"5847_CR34","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/TBDATA.2015.2472014","volume":"1","author":"EP Xing","year":"2015","unstructured":"Xing, E. P., Ho, Q., Dai, W., Kim, J. K., Wei, J., Lee, S., et al. (2015). Petuum: A new platform for distributed machine learning on big data. IEEE Transactions on Big Data, 1(2), 49\u201367.","journal-title":"IEEE Transactions on Big Data"},{"issue":"1","key":"5847_CR35","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Ekici, A., Lu, Z., & Monteiro, R. (2006). Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B, 68(1), 49\u201367.","journal-title":"Journal of the Royal Statistical Society: Series B"},{"issue":"4","key":"5847_CR36","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s10994-017-5676-y","volume":"107","author":"C Zhang","year":"2018","unstructured":"Zhang, C., Zhao, P., Hao, S., Soh, Y. C., Lee, B., Miao, C., et al. (2018). Distributed multi-task classification: A decentralized online learning approach. Machine Learning, 107(4), 727\u2013747.","journal-title":"Machine Learning"},{"key":"5847_CR37","first-page":"18:1","volume":"18","author":"Y Zhang","year":"2017","unstructured":"Zhang, Y., & Xiao, L. (2017). Stochastic primal\u2013dual coordinate method for regularized empirical risk minimization. Journal of Machine Learning Research, 18, 18:1\u201318:42.","journal-title":"Journal of Machine Learning Research"},{"key":"5847_CR38","unstructured":"Zhang, Y., & Yang, Q. (2017). A survey on multi-task learning. CoRR \narXiv:1707.08114\n\n."},{"key":"5847_CR39","unstructured":"Zhang, Y., & Yeung, D. Y. (2010). A convex formulation for learning task relationships in multi-task learning. In Proceedings of UAI."},{"key":"5847_CR40","first-page":"115:1","volume":"18","author":"S Zheng","year":"2017","unstructured":"Zheng, S., Wang, J., Xia, F., Xu, W., & Zhang, T. (2017). A general distributed dual coordinate optimization framework for regularized loss minimization. Journal of Machine Learning Research, 18, 115:1\u2013115:52.","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"5847_CR41","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., & Hastie, T. (2005). Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B, 67(2), 301\u2013320.","journal-title":"Journal of the Royal Statistical Society: Series B"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05847-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05847-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05847-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T00:20:40Z","timestamp":1602030040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05847-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,7]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["5847"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05847-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,7]]},"assertion":[{"value":"3 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}