{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T06:33:59Z","timestamp":1724135639948},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T00:00:00Z","timestamp":1548288000000},"content-version":"tdm","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":[[2019,10]]},"DOI":"10.1007\/s10994-018-05775-x","type":"journal-article","created":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T02:21:23Z","timestamp":1548382883000},"page":"1783-1803","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Riemannian gossip approach to subspace learning on Grassmann manifold"],"prefix":"10.1007","volume":"108","author":[{"given":"Bamdev","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Hiroyuki","family":"Kasai","sequence":"additional","affiliation":[]},{"given":"Pratik","family":"Jawanpuria","sequence":"additional","affiliation":[]},{"given":"Atul","family":"Saroop","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,24]]},"reference":[{"key":"5775_CR1","first-page":"803","volume":"10","author":"J Abernethy","year":"2009","unstructured":"Abernethy, J., Bach, F., Evgeniou, T., & Vert, J.-P. (2009). A new approach to collaborative filtering: Operator estimation with spectral regularization. Journal of Machine Learning Research, 10, 803\u2013826.","journal-title":"Journal of Machine Learning Research"},{"key":"5775_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization algorithms on matrix manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., & Sepulchre, R. (2008). Optimization algorithms on matrix manifolds. Princeton, NJ: Princeton University Press."},{"key":"5775_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1561\/2200000036","volume":"4","author":"MA \u00c1lvarez","year":"2012","unstructured":"\u00c1lvarez, M. A., Rosasco, L., & Lawrence, N. D. (2012). Kernels for vector-valued functions: A review. Foundations and Trends in Machine Learning, 4, 195\u2013266.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"5775_CR4","doi-asserted-by":"crossref","unstructured":"Amit, Y., Fink, M., Srebro, N., & Ullman, S. (2007). Uncovering shared structures in multiclass classification. In Proceedings of the 24th international conference on machine learning (pp. 17\u201324).","DOI":"10.1145\/1273496.1273499"},{"issue":"May","key":"5775_CR5","first-page":"1817","volume":"6","author":"RK Ando","year":"2005","unstructured":"Ando, R. K., & Zhang, T. (2005). A framework for learning predictive structures from multiple tasks and unlabeled data. Journal of Machine Learning Research, 6(May), 1817\u20131853.","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"5775_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou, A., Evgeniou, T., & Pontil, M. (2008). Convex multi-task feature learning. Machine Learning, 73(3), 243\u2013272.","journal-title":"Machine Learning"},{"key":"5775_CR7","doi-asserted-by":"crossref","unstructured":"Balzano, L., Nowak, R., & Recht, B. (2010). Online identification and tracking of subspaces from highly incomplete information. In The 48th annual Allerton conference on communication, control, and computing (Allerton) (pp. 704\u2013711).","DOI":"10.1109\/ALLERTON.2010.5706976"},{"key":"5775_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1007327622663","volume":"28","author":"JJ Baxter","year":"1997","unstructured":"Baxter, J. J. (1997). A Bayesian\/information theoretic model of learning to learn via multiple task sampling. Machine Learning, 28, 7\u201339.","journal-title":"Machine Learning"},{"key":"5775_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1613\/jair.731","volume":"12","author":"JJ Baxter","year":"2000","unstructured":"Baxter, J. J. (2000). A model of inductive bias learning. Journal of Artificial Intelligence Research, 12, 149\u2013198.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5775_CR10","volume-title":"Pattern recognition and machine learning","author":"C\u00a0M Bishop","year":"2006","unstructured":"Bishop, C\u00a0. M. (2006). Pattern recognition and machine learning. Berlin: Springer."},{"key":"5775_CR11","unstructured":"Blot, M., Picard, D., Cord, M., & Thome, N. (2016). Gossip training for deep learning. Technical report, arXiv preprint \n arXiv:1611.04581\n \n ."},{"issue":"9","key":"5775_CR12","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1109\/TAC.2013.2254619","volume":"58","author":"S Bonnabel","year":"2013","unstructured":"Bonnabel, S. (2013). Stochastic gradient descent on Riemannian manifolds. IEEE Transactions on Automatic Control, 58(9), 2217\u20132229.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5775_CR13","unstructured":"Boumal, N., & Absil, P. -A. (2011). RTRMC: A Riemannian trust-region method for low-rank matrix completion. In Advances in neural information processing systems 24 (NIPS) (pp. 406\u2013414)."},{"key":"5775_CR14","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.laa.2015.02.027","volume":"475","author":"N Boumal","year":"2015","unstructured":"Boumal, N., & Absil, P.-A. (2015). Low-rank matrix completion via preconditioned optimization on the Grassmann manifold. Linear Algebra and its Applications, 475, 200\u2013239.","journal-title":"Linear Algebra and its Applications"},{"key":"5775_CR15","first-page":"1455","volume":"15","author":"N Boumal","year":"2014","unstructured":"Boumal, N., Mishra, B., Absil, P.-A., & Sepulchre, R. (2014). Manopt: A Matlab toolbox for optimization on manifolds. Journal of Machine Learning Research, 15, 1455\u20131459.","journal-title":"Journal of Machine Learning Research"},{"issue":"6","key":"5775_CR16","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006). Randomized gossip algorithms. IEEE Transaction on Information Theory, 52(6), 2508\u20132530.","journal-title":"IEEE Transaction on Information Theory"},{"issue":"4","key":"5775_CR17","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J. F., Cand\u00e8s, E. J., & Shen, Z. (2010). A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4), 1956\u20131982.","journal-title":"SIAM Journal on Optimization"},{"issue":"6","key":"5775_CR18","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717\u2013772.","journal-title":"Foundations of Computational Mathematics"},{"issue":"1","key":"5775_CR19","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":"5775_CR20","doi-asserted-by":"crossref","unstructured":"Cetingul, H. E., & Vidal, R. (2009). Intrinsic mean shift for clustering on Stiefel and Grassmann manifolds. In IEEE conference on computer vision and pattern recognition (CVPR).","DOI":"10.1109\/CVPR.2009.5206806"},{"key":"5775_CR21","doi-asserted-by":"crossref","unstructured":"Chen, J., Zhou, J., & Jieping, Y. (2011). Integrating low-rank and group-sparse structures for robust multi-task learning. In ACM SIGKDD international conference on knowledge discovery and data mining (pp. 42\u201350).","DOI":"10.1145\/2020408.2020423"},{"key":"5775_CR22","unstructured":"Colin, I., Bellet, A., Salmon, J., & Cl\u00e9men\u00e7on, S. (2016). Gossip dual averaging for decentralized optimization of pairwise functions. In International conference on machine learning (ICML) (pp. 1388\u20131396)."},{"issue":"1","key":"5775_CR23","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1109\/TIT.2011.2171521","volume":"58","author":"W Dai","year":"2012","unstructured":"Dai, W., Kerman, E., & Milenkovic, O. (2012). A geometric approach to low-rank matrix completion. IEEE Transactions on Information Theory, 58(1), 237\u2013247.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"5775_CR24","doi-asserted-by":"publisher","first-page":"3120","DOI":"10.1109\/TSP.2011.2144977","volume":"59","author":"W Dai","year":"2011","unstructured":"Dai, W., Milenkovic, O., & Kerman, E. (2011). Subspace evolution and transfer (SET) for low-rank matrix completion. IEEE Transactions on Signal Processing, 59(7), 3120\u20133132.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"2","key":"5775_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T. A., & Smith, S. T. (1998). The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications, 20(2), 303\u2013353.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"5775_CR26","doi-asserted-by":"crossref","unstructured":"Evgeniou, T., Pontil, M. (2004). Regularized multi-task learning. In ACM SIGKDD international conference on knowledge discovery and data mining (KDD) (pp. 109\u2013117).","DOI":"10.1145\/1014052.1014067"},{"key":"5775_CR27","first-page":"615","volume":"6","author":"T Evgeniou","year":"2005","unstructured":"Evgeniou, T., Micchelli, C. A., & Pontil, M. (2005). Learning multiple tasks with kernel methods. Journal of Machine Learning Research, 6, 615\u2013637.","journal-title":"Journal of Machine Learning Research"},{"key":"5775_CR28","unstructured":"Frank, A., & Asuncion, A. UCI machine learning repository. \n http:\/\/archive.ics.uci.edu\/ml\n \n . Accessed 4 Jan 2019."},{"issue":"2","key":"5775_CR29","first-page":"235","volume":"40","author":"H Goldstein","year":"1991","unstructured":"Goldstein, H. (1991). Multilevel modelling of survey data. Journal of the Royal Statistical Society. Series D (The Statistician), 40(2), 235\u2013244.","journal-title":"Journal of the Royal Statistical Society. Series D (The Statistician)"},{"key":"5775_CR30","doi-asserted-by":"crossref","unstructured":"Harandi, M., Hartley, R., Salzmann, M., & Trumpf, J. (2016). Dictionary learning on Grassmann manifolds. In Algorithmic advances in Riemannian geometry and applications (pp. 145\u2013172).","DOI":"10.1007\/978-3-319-45026-1_6"},{"key":"5775_CR31","unstructured":"Harandi, M., Salzmann, M., & Hartley, R. (2017). Joint dimensionality reduction and metric learning: A geometric take. In International conference on machine learning (ICML)."},{"issue":"1","key":"5775_CR32","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TPAMI.2017.2655048","volume":"40","author":"M Harandi","year":"2018","unstructured":"Harandi, M., Salzmann, M., & Hartley, R. (2018). Dimensionality reduction on SPD manifolds: The emergence of geometry-aware methods. IEEE Transactions on Pattern Analysis & Machine Intelligence, 40(1), 48\u201362.","journal-title":"IEEE Transactions on Pattern Analysis & Machine Intelligence"},{"key":"5775_CR33","unstructured":"He, J., Balzano, L., & Szlam, A. (2012). Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video. In IEEE conference on computer vision and pattern recognition (CVPR)."},{"key":"5775_CR34","unstructured":"Jacob, L., Bach, F., & Vert, J. P. (2008). Clustered multi-task learning: A convex formulation. In Advances in neural information processing systems 21 (NIPS)."},{"key":"5775_CR35","unstructured":"Jalali, A., Ravikumar, P., Sanghavi, S., & Ruan, C. (2010). A dirty model for multi-task learning. In Advances in neural information processing systems 23 (NIPS)."},{"key":"5775_CR36","doi-asserted-by":"crossref","unstructured":"Jawanpuria, P., & Nath, J. S. (2011). Multi-task multiple kernel learning. In SIAM international conference on data mining (SDM) (pp. 828\u2013830).","DOI":"10.1137\/1.9781611972818.71"},{"key":"5775_CR37","unstructured":"Jawanpuria, P., & Nath, J. S. (2012). A convex feature learning formulation for latent task structure discovery. In International conference on machine learning (ICML) (pp. 1531\u20131538)."},{"key":"5775_CR38","unstructured":"Jin, P. H., Yuan, Q., Iandola, F., & Keutzer, K. (2016). How to scale distributed deep learning? Technical report, arXiv preprint \n arXiv:1611.04581\n \n ."},{"key":"5775_CR39","unstructured":"Kang, Z., Grauman, K., & Sha, F. (2011). Learning with whom to share in multi-task feature learning. In International conference on machine learning (ICML) (pp. 521\u2013528)."},{"key":"5775_CR40","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1186\/s12859-016-1106-6","volume":"17","author":"A Kapur","year":"2016","unstructured":"Kapur, A., Marwah, K., & Alterovitz, G. (2016). Gene expression prediction using low-rank matrix completion. BMC Bioinformatics, 17, 243.","journal-title":"BMC Bioinformatics"},{"key":"5775_CR41","doi-asserted-by":"crossref","unstructured":"Keshavan, R. H., Montanari, A., & Oh, S. (2009). Low-rank matrix completion with noisy observations: A quantitative comparison. In Annual Allerton conference on communication, control, and computing (Allerton) (pp. 1216\u20131222).","DOI":"10.1109\/ALLERTON.2009.5394534"},{"issue":"6","key":"5775_CR42","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R. H., Montanari, A., & Oh, S. (2010). Matrix completion from a few entries. IEEE Transactions on Information Theory, 56(6), 2980\u20132998.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5775_CR43","unstructured":"Kumar, A., & Daume, H. (2012). Learning task grouping and overlap in multi-task learning. In International conference on machine learning (ICML)."},{"key":"5775_CR44","doi-asserted-by":"crossref","unstructured":"Lapin, M., Schiele, B., & Hein, M. (2014). Scalable multitask representation learning for scene classification. In Conference on computer vision and pattern recognition.","DOI":"10.1109\/CVPR.2014.186"},{"key":"5775_CR45","doi-asserted-by":"crossref","unstructured":"Ling, Q., Xu, Y., Yin, W., & Wen, Z. (2012). Decentralized low-rank matrix completion. In IEEE international conference on acoustics, speech and signal processing (ICASSP) (pp. 2925\u20132928).","DOI":"10.1109\/ICASSP.2012.6288528"},{"issue":"2","key":"5775_CR46","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s40305-015-0080-4","volume":"3","author":"A-Y Lin","year":"2015","unstructured":"Lin, A.-Y., & Ling, Q. (2015). Decentralized and privacy-preserving low-rank matrix completion. Journal of the Operations Research Society of China, 3(2), 189\u2013205.","journal-title":"Journal of the Operations Research Society of China"},{"issue":"2","key":"5775_CR47","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1137\/120883050","volume":"34","author":"I Markovsky","year":"2013","unstructured":"Markovsky, I., & Usevich, K. (2013). Structured low-rank approximation with missing data. SIAM Journal on Matrix Analysis and Applications, 34(2), 814\u2013830.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"5775_CR48","doi-asserted-by":"crossref","unstructured":"Meyer, G., Journ\u00e9e, M., Bonnabel, S., & Sepulchre, R. (2009). From subspace learning to distance learning: A geometrical optimization approach. In IEEE\/SP 15th workshop on statistical signal processing (pp. 385\u2013388).","DOI":"10.1109\/SSP.2009.5278557"},{"key":"5775_CR49","first-page":"593","volume":"11","author":"G Meyer","year":"2011","unstructured":"Meyer, G., Bonnabel, S., & Sepulchre, R. (2011). Regression on fixed-rank positive semidefinite matrices: A Riemannian approach. Journal of Machine Learning Research, 11, 593\u2013625.","journal-title":"Journal of Machine Learning Research"},{"key":"5775_CR50","doi-asserted-by":"crossref","unstructured":"Mishra, B., & Sepulchre, R. (2014). R3MC: A Riemannian three-factor algorithm for low-rank matrix completion. In Proceedings of the 53rd IEEE conference on decision and control (CDC) (pp. 1137\u20131142).","DOI":"10.1109\/CDC.2014.7039534"},{"key":"5775_CR51","unstructured":"Mishra, B., Kasai, H., & Saroop, A. (2016). A Riemannian gossip approach to decentralized matrix completion. Technical report, arXiv preprint \n arXiv:1605.06968\n \n , 2016. A shorter version appeared in the 9th NIPS Workshop on Optimization for Machine Learning."},{"issue":"3\u20134","key":"5775_CR52","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00180-013-0464-z","volume":"29","author":"B Mishra","year":"2014","unstructured":"Mishra, B., Meyer, G., Bonnabel, S., & Sepulchre, R. (2014). Fixed-rank matrix factorizations and Riemannian low-rank optimization. Computational Statistics, 29(3\u20134), 591\u2013621.","journal-title":"Computational Statistics"},{"key":"5775_CR53","unstructured":"MovieLens. MovieLens (1997). \n http:\/\/grouplens.org\/datasets\/movielens\/\n \n . Accessed 4 Jan 2019."},{"key":"5775_CR54","unstructured":"Muandet, K., Balduzzi, D., & Sch\u00f6lkopf, B. (2013). Domain generalization via invariant feature representation. In International conference on machine learning (ICML) (pp. 10\u201318)."},{"key":"5775_CR55","unstructured":"Ngo, T. T., & Saad, Y. (2012). Scaled gradients on Grassmann manifolds for matrix completion. In Advances in neural information processing systems 25 (NIPS) (pp. 1421\u20131429)."},{"issue":"4","key":"5775_CR56","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1002\/cpe.2858","volume":"25","author":"R Orm\u00e1ndi","year":"2013","unstructured":"Orm\u00e1ndi, R., Heged\u0171s, I., & Jelasity, M. (2013). Gossip learning with linear models on fully distributed data. Concurrency and Computation: Practice and Experience, 25(4), 556\u2013571.","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"2","key":"5775_CR57","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12532-013-0053-8","volume":"5","author":"B Recht","year":"2013","unstructured":"Recht, B., & R\u00e9, C. (2013). Parallel stochastic gradient algorithms for large-scale matrix completion. Mathematical Programming Computation, 5(2), 201\u2013226.","journal-title":"Mathematical Programming Computation"},{"key":"5775_CR58","doi-asserted-by":"crossref","unstructured":"Rennie, J., & Srebro, N. (2005). Fast maximum margin matrix factorization for collaborative prediction. In International conference on machine learning (ICML) (pp. 713\u2013719).","DOI":"10.1145\/1102351.1102441"},{"issue":"1","key":"5775_CR59","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/060673400","volume":"48","author":"A Sarlette","year":"2009","unstructured":"Sarlette, A., & Sepulchre, R. (2009). Consensus optimization on manifolds. SIAM Journal on Control and Optimization, 48(1), 56\u201376.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"5775_CR60","unstructured":"Sato, H., Kasai, H., & Mishra, B. (2017). Riemannian stochastic variance reduced gradient. Technical report, arXiv preprint \n arXiv:1702.05594\n \n ."},{"issue":"1","key":"5775_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1300000014","volume":"3","author":"D Shah","year":"2009","unstructured":"Shah, D. (2009). Gossip algorithms. Foundations and Trend in Networking, 3(1), 1\u2013125.","journal-title":"Foundations and Trend in Networking"},{"key":"5775_CR62","doi-asserted-by":"crossref","unstructured":"Tron, R., Afsari, B., & Vidal, R. (2011). Average consensus on Riemannian manifolds with bounded curvature. In IEEE conference on decision and control and European control conference (CDC-ECC) (pp. 7855\u20137862).","DOI":"10.1109\/CDC.2011.6160965"},{"issue":"4","key":"5775_CR63","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1109\/TAC.2012.2225533","volume":"58","author":"R Tron","year":"2013","unstructured":"Tron, R., Afsari, B., & Vidal, R. (2013). Riemannian consensus for manifolds with bounded curvature. IEEE Transactions on Automatic Control, 58(4), 921\u2013934.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5775_CR64","doi-asserted-by":"crossref","unstructured":"Turaga, P., Veeraraghavan, A., & Chellappa, R. (2008). Statistical analysis on Stiefel and Grassmann manifolds with applications in computer vision. In IEEE conference on computer vision and pattern recognition (CVPR).","DOI":"10.1109\/CVPR.2008.4587733"},{"issue":"4","key":"5775_CR65","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., & Zhang, Y. (2012). Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Mathematical Programming Computation, 4(4), 333\u2013361.","journal-title":"Mathematical Programming Computation"},{"key":"5775_CR66","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., & Lin, Y. (2006). Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society Series B, 68, 49\u201367.","journal-title":"Journal of the Royal Statistical Society Series B"},{"key":"5775_CR67","doi-asserted-by":"crossref","unstructured":"Zhang, Y. (2015). Parallel multi-task learning. In IEEE international conference on data mining (ICDM).","DOI":"10.1109\/ICDM.2015.130"},{"key":"5775_CR68","unstructured":"Zhang, Y., & Yang, Q. (2017). A survey on multi-task learning. Technical report, \n arXiv:1707.08114v1\n \n ."},{"key":"5775_CR69","unstructured":"Zhang, Y., & Yeung, D. Y. (2010). A convex formulation for learning task relationships in multi-task learning. In Uncertainty in artificial intelligence."},{"key":"5775_CR70","unstructured":"Zhang, H., Reddi, S. J., & Sra, S. (2016). Riemannian svrg: Fast stochastic optimization on Riemannian manifolds. In Advances in neural information processing systems (NIPS) (pp. 4592\u20134600)."},{"issue":"3","key":"5775_CR71","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10994-008-5050-1","volume":"73","author":"J Zhang","year":"2008","unstructured":"Zhang, J., Ghahramani, Z., & Yang, Y. (2008). Flexible latent variable models for multi-task learning. Machine Learning, 73(3), 221\u2013242.","journal-title":"Machine Learning"},{"key":"5775_CR72","unstructured":"Zhong, L. W., & Kwok, J. T. (2012). Convex multitask learning with flexible task clusters. In International conference on machine learning (ICML)."},{"key":"5775_CR73","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Wilkinson, D., Schreiber, R., & Pan, R. (2008). Large-scale parallel collaborative filtering for the Netflix prize. In International conference on algorithmic aspects in information and management (AAIM) (pp. 337\u2013348).","DOI":"10.1007\/978-3-540-68880-8_32"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-018-05775-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-05775-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-05775-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,23]],"date-time":"2020-01-23T20:05:41Z","timestamp":1579809941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-018-05775-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,24]]},"references-count":73,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["5775"],"URL":"https:\/\/doi.org\/10.1007\/s10994-018-05775-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,24]]},"assertion":[{"value":"28 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}