Fetching the paper…
Reading the bibliography…
In this paper, we investigate the sample size requirement for a general class of nuclear norm minimization methods for higher order tensor completion.
Giné, E. and Zinn, J. (1984), Some limit theorems for empirical processes, The Annals of Probability
1984
Earlier work this paper cites.
Kruskal, J. B. (1989), Rank, decomposition, and uniqueness for 3-way and N-way arrays, in “Multiway data analysis”
1989
Earlier work this paper cites.
Watson, G. A. (1992), Characterization of the subdifferential of some matrix norms, Linear Algebra Appl
1992
Earlier work this paper cites.
Candès, E.J. and Recht, B. (2008), Exact matrix completion via convex optimization, Foundations of Computational Mathematics
2008
Earlier work this paper cites.
Kolda, T.G. and Bader, B.W. (2009), Tensor decompositions and applications, SIAM Review
2009
Earlier work this paper cites.
Liu, J., Musialski, P., Wonka, P. and Ye, J. (2009), Tensor completion for estimating missing values in visual data, In ICCV
2009
Earlier work this paper cites.
Li, N. and Li, B. (2010), Tensor completion for on-board compression of hyperspectral images, In Image Processing (ICIP), 2010 17th IEEE International Conference on
2010
Earlier work this paper cites.
Sidiropoulos N.D. and Nion, N. (2010), Tensor algebra and multi-dimensional harmonic retrieval in signal processing for mimo radar, IEEE Trans. on Signal Processing
2010
Earlier work this paper cites.
Signoretto, M., De Lathauwer, L. and Suykens, J. (2010), Nuclear norms for tensors and their use for convex multilinear estimation
2010
Cited alongside, same era.
2010
Cited alongside, same era.
Gandy, S., Recht, B. and Yamada, I. (2011), Tensor completion and low-n-rank tensor recovery via convex optimization, Inverse Problems
2011
Cited alongside, same era.
Gross, D. (2011), Recovering low-rank matrices from few coefficients in any basis, IEEE Transaction on Information Theory
2011
Cited alongside, same era.
Recht, B. (2011), A simpler approach to matrix completion, Journal of Machine Learning Research
2011
Cited alongside, same era.
Hillar, C. and Lim, L.H. (2013), Most tensor problems are NP-hard, Journal of the ACM
2013
Later among the works it cites.
Mu, C., Huang, B., Wright, J. and Goldfarb, D. (2013), Square deal: lower bounds and improved relaxations for tensor recovery, arXiv: 1307.5870
2013
Later among the works it cites.
Semerci, O., Hao, N., Kilmer, M. and Miller, E. (2013), Tensor based formulation and nuclear norm regularizatin for multienergy computed tomography, to appear in IEEE Transactions on Image Processing
2013
Later among the works it cites.
Nie, W. and Wang L. (2014), Semidefinite relaxations for best rank-1 tensor approximations, SIAM Jounral on Matrix Analysis and Applications
2014
Later among the works it cites.
Yuan, M. and Zhang, C-H. (2014), On tensor completion via nuclear norm minimization, to appear in Foundation of Computational Mathematics
2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Signoretto, M., Van de Plas, R., De Moor, B. and Suykens, J. (2011), Tensor versus matrix completion: A comparison with application to spectral data, IEEE SPL
2011
Cited alongside, same era.
Tomioka, R., Suzuki, T., Hayashi, K. and Kashima, H. (2011), Statistical performance of convex tensor decomposition, Advances in Neural Information Processing Systems (NIPS)
2011
Cited alongside, same era.
Tropp, J. (2012), User-friendly tail bounds for sums of random matrices, Foundations of Computational Mathematics
2012
Cited alongside, same era.
Later among the works it cites.
Jiang, B., Ma, S. and Zhang, S. (2015), Tensor principal component analysis via convex optimization, Mathematical Programming Series A
2015
Later among the works it cites.
Nguyen, N., Drineas, P. and Tran, T. (2015), Tensor sparsification via a bound on the spectral norm of random tensors, Information and Inference
2015
Later among the works it cites.
Candès, E.J. and Tao, T. (2009), The power of convex relaxation: Near-optimal matrix completion, IEEE Transactions on Information Theory
2080
Closest in time.