Generalized higher-order orthogonal iteration for tensor decomposition and completion

Advances in Neural Information Processing Systems

Volumn 2, Issue January, 2014, Pages 1763-1771

  Liu, Yuanyuan ^a   Shang, Fanhua ^a   Fan, Wei ^b   Cheng, James ^a   Cheng, Hong ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HUAWEI NOAH S ARK LAB   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION SCIENCE; ITERATIVE METHODS; PROBLEM SOLVING;

1-NORM MINIMIZATIONS; EQUIVALENCE RELATIONS; LARGE-SCALE PROBLEM; ORDERS OF MAGNITUDE; ORTHOGONAL ITERATION; REAL-WORLD PROBLEM; STATE-OF-THE-ART METHODS; TENSOR DECOMPOSITION;

TENSORS;

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

References (29)

1. E. Acar, D. Dunlavy, T. Kolda, and M. Mørup. Scalable tensor factorizations with missing data. In SDM, pages 701-711, 2010.
2. A. Anandkumar, D. Hsu, M. Janzamin, and S. Kakade. When are overcomplete topic models identifiable? uniqueness of tensor Tucker decompositions with structured sparsity. In NIPS, pages 1986-1994, 2013.
3. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn., 3(1): 1-122, 2011.
4. J. Cai, E. Candès, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM J. Optim., 20(4): 1956-1982, 2010.
5. E. Candès and B. Recht. Exact matrix completion via convex optimization. Found. Comput. Math., 9(6): 717-772, 2009.
6. E. Candès, J. Romberg, and T. Tao. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory, 52(2): 489-509, 2006.
7. M. Fazel. Matrix Rank Minimization with Applications. PhD thesis, Stanford University, 2002.
8. M. Filipovic and A. Jukic. Tucker factorization with missing data with application to low-n-rank tensor completion. Multidim. Syst. Sign. Process., 2014.
9. S. Gandy, B. Recht, and I. Yamada. Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Problem, 27(2), 2011.
10. D. Goldfarb and Z. Qin. Robust low-rank tesnor recovery: Models and algorithms. SIAM J. Matrix Anal. Appl., 35(1): 225-253, 2014.
11. B. Huang, C. Mu, D. Goldfarb, and J. Wright. Provable low-rank tensor recovery. In Optimization-Online: 4252, 2014.
12. R. Keshavan, A. Montanari, and S. Oh. Matrix completion from a few entries. IEEE Trans. Inform. Theory, 56(6): 2980-2998, 2010.
13. T. Kolda and B. Bader. Tensor decompositions and applications. SIAM Review, 51(3): 455-500, 2009.
14. L. Lathauwer, B. Moor, and J. Vandewalle. On the best rank-1 and rank-(r1,r2,...,rn) approximation of high-order tensors. SIAM J. Matrix Anal. Appl., 21(4): 1324-1342, 2000.
15. Z. Lin, R. Liu, and Z. Su. Linearized alternating direction method with adaptive penalty for low-rank representation. In NIPS, pages 612-620, 2011.
16. J. Liu, P. Musialski, P. Wonka, and J. Ye. Tensor completion for estimating missing values in visual data. In ICCV, pages 2114-2121, 2009.
17. J. Liu, P. Musialski, P. Wonka, and J. Ye. Tensor completion for estimating missing values in visual data. IEEE Trans. Pattern Anal. Mach. Intell., 35(1): 208-220, 2013.
18. C. Mu, B. Huang, J. Wright, and D. Goldfarb. Square deal: lower bounds and improved relaxations for tensor recovery. In ICML, pages 73-81, 2014.
19. H. Nick. Matrix procrustes problems. 1995.
20. B. Romera-Paredes and M. Pontil. A new convex relaxation for tensor completion. In NIPS, pages 2967-2975, 2013.
21. F. Shang, Y. Liu, and J. Cheng. Generalized higher-order tensor decomposition via parallel ADMM. In AAAI, pages 1279-1285, 2014.
22. M. Signoretto, Q. Dinh, L. Lathauwer, and J. Suykens. Learning with tensors: A framework based on covex optimization and spectral regularization. Mach. Learn., 94(3): 303-351, 2014.
23. M. Signoretto, L. Lathauwer, and J. Suykens. Nuclear norms for tensors and their use for convex multilinear estimation. Technical Report 10-186, ESATSISTA, K. U. Leuven, 2010.
24. R. Tomioka and T. Suzuki. Convex tensor decomposition via structured Schatten norm regularization. In NIPS, pages 1331-1339, 2013.
25. R. Tomioka, T. Suzuki, K. Hayashi, and H. Kashima. Statistical performance of convex tensor decomposition. In NIPS, pages 972-980, 2011.
26. Y. Wang and H. Xu. Stability of matrix factorization for collaborative filtering. In ICML, 2012.
27. Z. Wen, W. Yin, and Y. Zhang. Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Prog. Comp., 4(4): 333-361, 2012.
28. Y. Xu, R. Hao, W. Yin, and Z. Su. Parallel matrix factorization for low-rank tensor completion. In arXiv: 1312.1254, 2013.
29. Y. Yilmaz, A. Cemgil, and U. Simsekli. Generalised coupled tensor factorisation. In NIPS, pages 2151-2159, 2011.