Multitask learning meets tensor factorization: Task imputation via convex optimization

Advances in Neural Information Processing Systems

Volumn 4, Issue January, 2014, Pages 2825-2833

  Wimalawarne, Kishan ^a   Sugiyama, Masashi ^b   Tomioka, Ryota ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

^c TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; INFORMATION SCIENCE; RELAXATION PROCESSES;

CONVEX RELAXATION; MULTITASK LEARNING; TENSOR COMPLETION; TENSOR FACTORIZATION; TRACE-NORMS; WEIGHT VECTOR;

TENSORS;

EID: 84937847816     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. R. K. Ando and T. Zhang. A framework for learning predictive structures from multiple tasks and unla-beled data. J. Mach. Learn. Res., 6: 1817-1853, 2005.
2. A. Argyriou, T. Evgeniou, and M. Pontil. Multi-task feature learning. In B. Schölkopf, J. Platt, and T. Hoffman, editors, Adv. Neural. Inf. Process. Syst. 19, pages 41-48. MIT Press, Cambridge, MA, 2007.
3. A. Argyriou, M. Pontil, Y. Ying, and C. A. Micchelli. A spectral regularization framework for multi-task structure learning. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Adv. Neural. Inf. Process. Syst. 20, pages 25-32. Curran Associates, Inc., 2008.
4. B. Bakker and T. Heskes. Task clustering and gating for bayesian multitask learning. J. Mach. Learn. Res., 4: 83-99, 2003.
5. P. L. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. J. Mach. Learn. Res., 3: 463-482, 2002.
6. J. Baxter. A model of inductive bias learning. J. Artif. Intell. Res., 12: 149-198, 2000.
7. R. Caruana. Multitask learning. Machine learning, 28(1): 41-75, 1997.
8. L. De Lathauwer, B. De Moor, and J. Vandewalle. A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl., 21(4): 1253-1278, 2000.
9. L. De Lathauwer, B. De Moor, and J. Vandewalle. On the best rank-1 and rank-(R1,R2,...,RN) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl., 21(4): 1324-1342, 2000.
10. M. Fazel, H. Hindi, and S. P. Boyd. A Rank Minimization Heuristic with Application to Minimum Order System Approximation. In Proc. of the American Control Conference, 2001.
11. R. Foygel and N. Srebro. Concentration-based guarantees for low-rank matrix reconstruction. arXiv preprint arXiv: 1102.3923, 2011.
12. S. Gandy, B. Recht, and I. Yamada. Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Problems, 27: 025010, 2011.
13. S. M. Kakade, S. Shalev-Shwartz, and A. Tewari. Regularization techniques for learning with matrices. J. Mach. Learn. Res., 13(1): 1865-1890, 2012.
14. T. G. Kolda and B. W. Bader. Tensor decompositions and applications. SIAM Review, 51(3): 455-500, 2009.
15. J. Liu, P. Musialski, P. Wonka, and J. Ye. Tensor completion for estimating missing values in visual data. In Proc. ICCV, 2009.
16. A. Maurer and M. Pontil. Excess risk bounds for multitask learning with trace norm regularization. In JMLR W&CP 30 (COLT2013), pages 55-76. MIT Press, 2013.
17. B. Romera-Paredes, H. Aung, N. Bianchi-Berthouze, and M. Pontil. Multilinear multitask learning. In Proceedings of the 30th International Conference on Machine Learning, pages 1444-1452, 2013.
18. M. Signoretto, L. De Lathauwer, and J. Suykens. Nuclear norms for tensors and their use for convex multilinear estimation. Technical Report 10-186, ESAT-SISTA, K.U. Leuven, 2010.
19. M. Signoretto, L. De Lathauwer, and J. A. K. Suykens. Learning tensors in reproducing kernel hilbert spaces with multilinear spectral penalties. Technical report, arXiv: 1310.4977, 2013.
20. N. Srebro, J. D. M. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. In L. K. Saul, Y. Weiss, and L. Bottou, editors, Adv. Neural. Inf. Process. Syst. 17, pages 1329-1336. MIT Press, Cambridge, MA, 2005.
21. R. Tomioka and T. Suzuki. Convex tensor decomposition via structured Schatten norm regularization. In C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Weinberger, editors, Adv. Neural. Inf. Process. Syst. 26, pages 1331-1339. 2013.
22. R. Tomioka, K. Hayashi, and H. Kashima. Estimation of low-rank tensors via convex optimization. Technical report, arXiv: 1010.0789, 2011.
23. R. Tomioka, T. Suzuki, K. Hayashi, and H. Kashima. Statistical performance of convex tensor decomposition. In Adv. Neural. Inf. Process. Syst. 24, pages 972-980. 2011.
24. J. A. Tropp. User-friendly tail bounds for sums of random matrices. Found. Comput. Math., 12(4): 389-434, 2012.
25. L. R. Tucker. Some mathematical notes on three-mode factor analysis. Psychometrika, 31(3): 279-311, 1966.
26. B. Vargas-Govea, G. González-Serna, and R. Ponce-Medellin. Effects of relevant contextual features in the performance of a restaurant recommender system. In Proceedings of 3rd Workshop on Context-Aware Recommender Systems. 2011.