Fetching the paper…
Reading the bibliography…
Recovery of low-rank matrices from a small number of linear measurements is now well-known to be possible under various model assumptions on the measurements.
No. 54, University Press, 1964
C. A. Rogers, Packing and covering · 1964
Earlier work this paper cites.
L. R. Tucker, “Some mathematical notes on three-mode factor analysis,” Psychometrika
1966
Earlier work this paper cites.
J. D. Carroll and J.-J. Chang, “Analysis of individual differences in multidimensional scaling via an n-way generalization of “eckart-young” decomposition,” Psychometrika
1970
Earlier work this paper cites.
R. A. Harshman et al
1970
Earlier work this paper cites.
M. H. Beck, A. Jäckle, G. A. Worth, and H.-D. Meyer, “The multiconfiguration time-dependent hartree (mctdh) method: a highly efficient algorithm for propagating wavepackets,” Physics reports
2000
Earlier work this paper cites.
L. De Lathauwer, B. De Moor, and J. Vandewalle, “A multilinear singular value decomposition,” SIAM journal on Matrix Analysis and Applications
2000
Earlier work this paper cites.
R. Basri and D. W. Jacobs, “Lambertian reflectance and linear subspaces,” IEEE Transactions on Pattern Analysis & Machine Intelligence
2003
Earlier work this paper cites.
E. J. Candès and T. Tao, “Decoding by linear programming,” IEEE T. Inform. Theory
2005
Earlier work this paper cites.
M. A. O. Vasilescu and D. Terzopoulos, “Multilinear independent components analysis,” in 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05)
2005
Earlier work this paper cites.
European Mathematical Society, 2008
C. Lubich, From quantum to classical molecular dynamics: reduced models and numerical analysis · 2008
Earlier work this paper cites.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational mathematics
2009
Earlier work this paper cites.
T. Blumensath and M. E. Davies, “Iterative hard thresholding for compressed sensing,” Appl. Comput. Harmon. A
2009
Earlier work this paper cites.
T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,” SIAM review
2009
Earlier work this paper cites.
D. Gross, Y.-K. Liu, S. T. Flammia, S. Becker, and J. Eisert, “Quantum state tomography via compressed sensing,” Physical review letters
2010
Cited alongside, same era.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM review
2010
Cited alongside, same era.
T. Blumensath and M. E. Davies, “Normalized iterative hard thresholding: Guaranteed stability and performance,” IEEE Journal of selected topics in signal processing
2010
Cited alongside, same era.
2010
Cited alongside, same era.
E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?,” Journal of the ACM (JACM)
2011
B. Romera-Paredes, H. Aung, N. Bianchi-Berthouze, and M. Pontil, “Multilinear multitask learning,” in International Conference on Machine Learning
2013
Later among the works it cites.
C. J. Hillar and L.-H. Lim, “Most tensor problems are np-hard,” Journal of the ACM (JACM)
2013
Later among the works it cites.
A. Ahmed and J. Romberg, “Compressive multiplexing of correlated signals,” IEEE Transactions on Information Theory
2014
Later among the works it cites.
Z. Zhang, G. Ely, S. Aeron, N. Hao, and M. Kilmer, “Novel methods for multilinear data completion and de-noising based on tensor-svd,” in Proceedings of the IEEE conference on computer vision and pattern recognition
2014
Later among the works it cites.
A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Telgarsky, “Tensor decompositions for learning latent variable models,” The Journal of Machine Learning Research
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
E. Candes and Y. Plan, “Tight oracle bounds for low-rank matrix recovery from a mininal number of noisy random measurements,” IEEE Trans. Inform. Theory
2011
Cited alongside, same era.
M. E. Kilmer and C. D. Martin, “Factorization strategies for third-order tensors,” Linear Algebra and its Applications
2011
Cited alongside, same era.
Cambridge University Press, 2012
Y. C. Eldar and G. Kutyniok, Compressed sensing: theory and applications · 2012
Cited alongside, same era.
Y. Eldar, D. Needell, and Y. Plan, “Uniqueness conditions for low-rank matrix recovery,” Applied and Computational Harmonic Analysis
2012
Cited alongside, same era.
J. Liu, P. Musialski, P. Wonka, and J. Ye, “Tensor completion for estimating missing values in visual data,” IEEE transactions on pattern analysis and machine intelligence
2012
Cited alongside, same era.
S. Foucart and H. Rauhut, “A mathematical introduction to compressive sensing,” Applied and Numerical Harmonic Analysis
2013
Cited alongside, same era.
H. Zhang, W. He, L. Zhang, H. Shen, and Q. Yuan, “Hyperspectral image restoration using low-rank matrix recovery,” IEEE Transactions on Geoscience and Remote Sensing
2013
Cited alongside, same era.
2014
Later among the works it cites.
A. Bhaskara, M. Charikar, and A. Vijayaraghavan, “Uniqueness of tensor decompositions with applications to polynomial identifiability,” in Conference on Learning Theory
2014
Later among the works it cites.
N. Vervliet, O. Debals, and L. De Lathauwer, “Tensorlab 3.0 – numerical optimization strategies for large-scale constrained and coupled matrix/tensor factorization,” in Asilomar Conference on Signals, Systems and Computers
2016
Later among the works it cites.
J. A. Bengua, H. N. Phien, H. D. Tuan, and M. N. Do, “Efficient tensor completion for color image and video recovery: Low-rank tensor train,” IEEE Transactions on Image Processing
2017
Later among the works it cites.
H. Rauhut, R. Schneider, and Ž. Stojanac, “Low rank tensor recovery via iterative hard thresholding,” Linear Algebra and its Applications
2017
Later among the works it cites.
N. Nguyen, D. Needell, and T. Woolf, “Linear convergence of stochastic iterative greedy algorithms with sparse constraints,” IEEE Transactions on Information Theory
2017
Later among the works it cites.
Z. Song, D. P. Woodruff, and P. Zhong, “Relative error tensor low rank approximation,” in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019
Closest in time.
I. Georgieva and C. Hofreither, “Greedy low-rank approximation in tucker format of solutions of tensor linear systems,” Journal of Computational and Applied Mathematics
2019
Closest in time.