Estimation of low-rank tensors via convex optimization

Details Estimation of low-rank tensors via convex optimization Estimation of low-rank tensors via convex optimization

2010-10-05

arxiv.org/abs/1010.0789v2

Statistics

Machine Learning

19 pages, 7 figures

Scientific paper

In this paper, we propose three approaches for the estimation of the Tucker decomposition of multi-way arrays (tensors) from partial observations. All approaches are formulated as convex minimization problems. Therefore, the minimum is guaranteed to be unique. The proposed approaches can automatically estimate the number of factors (rank) through the optimization. Thus, there is no need to specify the rank beforehand. The key technique we employ is the trace norm regularization, which is a popular approach for the estimation of low-rank matrices. In addition, we propose a simple heuristic to improve the interpretability of the obtained factorization. The advantages and disadvantages of three proposed approaches are demonstrated through numerical experiments on both synthetic and real world datasets. We show that the proposed convex optimization based approaches are more accurate in predictive performance, faster, and more reliable in recovering a known multilinear structure than conventional approaches.

Affiliated with

Also associated with

No associations

Rating

Estimation of low-rank tensors via convex optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Estimation of low-rank tensors via convex optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimation of low-rank tensors via convex optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-86227