Fetching the paper…
Reading the bibliography…
The completion of tensors, or high-order arrays, attracts significant attention in recent research.
Das asymptotische verteilungsgesetz der eigenwerte linearer partieller differentialgleichungen (mit einer anwendung auf die theorie der hohlraumstrahlung)
Weyl, H. (1912) · 1912
Earlier work this paper cites.
Some mathematical notes on three-mode factor analysis
Tucker, L. R. (1966) · 1966
Earlier work this paper cites.
A statistical multiscale framework for poisson inverse problems
Nowak, R. D. and Kolaczyk, E. D. (2000) · 2000
Earlier work this paper cites.
Rank, trace-norm and max-norm
Srebro, N. and Shraibman, A. (2005) · 2005
Earlier work this paper cites.
Sampling from large matrices: An approach through geometric functional analysis
Rudelson, M. and Vershynin, R. (2007) · 2007
Earlier work this paper cites.
Tensor-cur decompositions for tensor-based data
Mahoney, M. W., Maggioni, M., and Drineas, P. (2008) · 2008
Earlier work this paper cites.
Tucker dimensionality reduction of three-dimensional arrays in linear time
Oseledets, I. V., Savostianov, D., and Tyrtyshnikov, E. E. (2008) · 2008
Earlier work this paper cites.
Matrix completion from a few entries
Keshavan, R. H., Oh, S., and Montanari, A. (2009) · 2009
Earlier work this paper cites.
Tensor decompositions and applications
Kolda, T. G. and Bader, B. W. (2009) · 2009
Earlier work this paper cites.
Breaking the curse of dimensionality, or how to use svd in many dimensions
Oseledets, I. V. and Tyrtyshnikov, E. E. (2009) · 2009
Earlier work this paper cites.
Generalizing the column–row matrix decomposition to multi-way arrays
Caiafa, C. F. and Cichocki, A. (2010) · 2010
Earlier work this paper cites.
Note on sampling without replacing from a finite collection of matrices
Gross, D. and Nesme, V. (2010) · 2010
Earlier work this paper cites.
Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering
Karatzoglou, A., Amatriain, X., Baltrunas, L., and Oliver, N. (2010) · 2010
Earlier work this paper cites.
Tensor completion for on-board compression of hyperspectral images
Li, N. and Li, B. (2010) · 2010
Earlier work this paper cites.
Pairwise interaction tensor factorization for personalized tag recommendation
Rendle, S. and Schmidt-Thieme, L. (2010) · 2010
Earlier work this paper cites.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements
Candes, E. J. and Plan, Y. (2011) · 2011
Earlier work this paper cites.
Tensor completion and low-n-rank tensor recovery via convex optimization
Gandy, S., Recht, B., and Yamada, I. (2011) · 2011
Earlier work this paper cites.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Koltchinskii, V., Lounici, K., and Tsybakov, A. B. (2011) · 2011
Earlier work this paper cites.
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
Negahban, S. and Wainwright, M. J. (2011) · 2011
Earlier work this paper cites.
A simpler approach to matrix completion
Recht, B. (2011) · 2011
Earlier work this paper cites.
Estimation of high-dimensional low-rank matrices
Rohde, A., Tsybakov, A. B., et al. (2011) · 2011
Earlier work this paper cites.
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
Agarwal, A., Negahban, S., and Wainwright, M. J. (2012) · 2012
Cited alongside, same era.
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Negahban, S. and Wainwright, M. J. (2012) · 2012
Cited alongside, same era.
Tensor displays: compressive light field synthesis using multilayer displays with directional backlighting
Wetzstein, G., Lanman, D., Hirsch, M., and Raskar, R. (2012) · 2012
Cited alongside, same era.
Most tensor problems are np-hard
Hillar, C. J. and Lim, L.-H. (2013) · 2013
Cited alongside, same era.
Low-rank matrix and tensor completion via adaptive sampling
Krishnamurthy, A. and Singh, A. (2013) · 2013
Cited alongside, same era.
Provable sparse tensor decomposition
Sun, W. W., Lu, J., Liu, H., and Cheng, G. (2015) · 2015
Later among the works it cites.
Provably correct algorithms for matrix column subset selection with selectively sampled data
Wang, Y. and Singh, A. (2015) · 2015
Later among the works it cites.
Noisy tensor completion via the sum-of-squares hierarchy
Barak, B. and Moitra, A. (2016) · 2016
Closest in time.
Structured matrix completion with applications to genomic data integration
Cai, T., Cai, T. T., and Zhang, A. (2016) · 2016
Closest in time.
Matrix completion via max-norm constrained optimization
Cai, T. T. and Zhou, W.-X. (2016) · 2016
Closest in time.
Poisson matrix recovery and completion
Cao, Y. and Xie, Y. (2016) · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Li, X., Zhou, H., and Li, L. (2013) · 2013
Cited alongside, same era.
Tensor completion for estimating missing values in visual data
Liu, J., Musialski, P., Wonka, P., and Ye, J. (2013) · 2013
Cited alongside, same era.
Tensor regression with applications in neuroimaging data analysis
Zhou, H., Li, L., and Zhu, H. (2013) · 2013
Cited alongside, same era.
Provable tensor factorization with missing data
Jain, P. and Oh, S. (2014) · 2014
Cited alongside, same era.
Noisy low-rank matrix completion with general sampling distribution
Klopp, O. (2014) · 2014
Cited alongside, same era.
Low-rank tensor completion by riemannian optimization
Kressner, D., Steinlechner, M., and Vandereycken, B. (2014) · 2014
Cited alongside, same era.
A tensor prism algorithm for multi-energy ct reconstruction and comparative studies
Li, L., Chen, Z., Wang, G., Chu, J., and Gao, H. (2014) · 2014
Cited alongside, same era.
Parsimonious tensor response regression
Li, L. and Zhang, X. (2016) · 2016
Closest in time.
A characterization of deterministic sampling patterns for low-rank matrix completion
Pimentel-Alarcón, D. L., Boston, N., and Nowak, R. D. (2016) · 2016
Closest in time.
Low rank tensor recovery via iterative hard thresholding
Rauhut, H., Schneider, R., and Stojanac, Z. (2016) · 2016
Closest in time.
Sparse low-rank tensor response regression
Sun, W. W. and Li, L. (2016) · 2016
Closest in time.
Incoherent tensor norms and their applications in higher order tensor completion
Yuan, M. and Zhang, C.-H. (2016) · 2016
Closest in time.
Microbial composition estimation from sparse count data
Cao, Y., Zhang, A., and Li, H. (2017) · 2017
Closest in time.
Bayesian tensor regression
Guhaniyogi, R., Qamar, S., and Dunson, D. B. (2017) · 2017
Closest in time.
Tensor decompositions and sparse log-linear models
Johndrow, J. E., Bhattacharya, A., Dunson, D. B., et al. (2017) · 2017
Closest in time.
Convex regularization for high-dimensional multi-response tensor regression
Raskutti, G., Yuan, M., and Chen, H. (2017) · 2017
Closest in time.
Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
Cai, T. T. and Zhang, A. (2018) · 2018
Closest in time.
Semi-supervised inference: General theory and estimation of means
Zhang, A., Brown, L. D., and Cai, T. T. (2018) · 2018
Closest in time.
Tensor svd: statistical and computational limits
Zhang, A. and Xia, D. (2018) · 2018
Closest in time.
Low-rank matrix recovery from row-and-column affine measurements
Wagner, A. and Zuk, O. (2015) · 2020
Closest in time.
The power of convex relaxation: Near-optimal matrix completion
Candès, E. J. and Tao, T. (2010) · 2080
Closest in time.