The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Robust Low-Rank Tensor Recovery: Models and Algorithms
Open accessAbstract
Robust tensor recovery plays an instrumental role in robustifying tensor decompositions for multilinear data analysis against outliers, gross corruptions, and missing values and has a diverse array of applications. In this paper, we study the problem of robust low-rank tensor recovery in a convex optimization framework, drawing upon recent advances in robust principal component analysis and tensor completion. We propose tailored optimization algorithms with global convergence guarantees for solving both the constrained and the Lagrangian formulations of the problem. These algorithms are based on the highly efficient alternating direction augmented Lagrangian and accelerated proximal gradient methods. We also propose a nonconvex model that can often improve the recovery results from the convex models. We investigate the empirical recoverability properties of the convex and nonconvex formulations and compare the computational performance of the algorithms on simulated data. We demonstrate through a number of real applications the practical effectiveness of this convex optimization framework for robust low-rank tensor recovery.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
A Multilinear Singular Value Decomposition
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896305696 · Cited by 4,106
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Harshman, R. A. (1970) · Cited by 2,255
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
Tensor Completion for Estimating Missing Values in Visual Data
Liu, J., Musialski, P., Wonka, P., & Ye, J. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.39 · Cited by 2,063
On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898346995 · Cited by 1,567
Wright, J. N., Ganesh, A., Rao, S., Peng, Y., & Ma, Y. (2009) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 1,495
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Nesterov, Y. (2012) · SIAM Journal on Optimization · doi:10.1137/100802001 · Cited by 1,187
Glowinski, R., & Marroco, A. (1975) · Revue française d'automatique, informatique, recherche opérationnelle. Analyse numérique · doi:10.1051/m2an/197509r200411 · Cited by 1,105
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
Self-citationToh, K.-C., & Yun, S. (2009) · National University of Singapore · Cited by 923
Tensor completion and low-n-rank tensor recovery via convex optimization
Gandy, S., Recht, B., & Yamada, I. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/2/025010 · Cited by 738
Richtárik, P., & Takáč, M. (2014) · Mathematical Programming · doi:10.1007/s10107-012-0614-z · Cited by 654
Håstad, J. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90014-6 · Cited by 584
On the Convergence of Block Coordinate Descent Type Methods
Beck, A., & Tetruashvili, L. (2013) · SIAM Journal on Optimization · doi:10.1137/120887679 · Cited by 572
Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix
Lin, Z., Ganesh, A., Wright, J. N., Wu, L., Chen, M., & Ma, Y. (2009) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 462
Multilinear subspace analysis of image ensembles
Vasilescu, M. A. O., & Terzopoulos, D. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211457 · Cited by 375
A comparison of algorithms for fitting the PARAFAC model
Tomasi, G., & Bro, R. (2006) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.11.013 · Cited by 372
CubeSVD: a novel approach to personalized Web search
Sun, J.-T., Zeng, H.-J., Liu, H., Lu, Y., & Chen, Z. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060803 · Cited by 338
Shen, Y., Wen, Z., & Zhang, Y. (2014) · Optimization Methods and Software · doi:10.1080/10556788.2012.700713 · Cited by 299
TripleRank: Ranking Semantic Web Data by Tensor Decomposition
Franz, T., Schultz, A., Sizov, S., & Staab, S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04930-9_14 · Cited by 201
Robustness and Outlier Detection in Chemometrics
Rousseeuw, P. J., Debruyne, M., Engelen, S., & Hubert, M. (2006) · Critical Reviews in Analytical Chemistry · doi:10.1080/10408340600969403 · Cited by 164
Scalable Tensor Factorizations with Missing Data
Acar, E., Dunlavy, D., Kolda, T. G., & Mørup, M. (2010) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.61 · Cited by 143
Estimation of low-rank tensors via convex optimizationPreprint
Tomioka, R., Hayashi, K., & Kashima, H. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.0789 · Cited by 134
Statistical Performance of Convex Tensor Decomposition
Tomioka, R., Suzuki, T., Hayashi, K., & Kashima, H. (2011) · Cited by 118
Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
Ma, S., Xue, L., & Zou, H. (2013) · Neural Computation · doi:10.1162/neco_a_00379 · Cited by 99
Optimum Subspace Learning and Error Correction for Tensors
Li, Y., Yan, J., Zhou, Y., & Yang, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15558-1_57 · Cited by 59
MPEG Video Watermarking Using Tensor Singular Value Decomposition
Abdallah, E. E., Hamza, A. B., & Bhattacharya, P. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74260-9_69 · Cited by 44
Exponential Family Tensor Factorization for Missing-Values Prediction and Anomaly Detection
Hayashi, K., Takenouchi, T., Shibata, T., Kamiya, Y., Kato, D., Kunieda, K., Yamada, K., & Ikeda, K. (2010) · Proceedings · doi:10.1109/icdm.2010.39 · Cited by 22
Cited by
Infrared Small Target Detection Based on Partial Sum of the Tensor Nuclear Norm
Zhang, L., & Peng, Z. (2019) · Remote Sensing · doi:10.3390/rs11040382 · Cited by 759
Dai, Y., & Wu, Y. (2017) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2017.2700023 · Cited by 615
Kronecker-Basis-Representation Based Tensor Sparsity and Its Applications to Tensor Recovery
Xie, Q., Zhao, Q., Meng, D., & Xu, Z. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2734888 · Cited by 318
Metadata
- Authors
- Goldfarb, D., & Qin, Z. (.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2014-01
- Volume
- 35
- Issue
- 1
- Pages
- 225-253
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W1999136078
- Cited by
- 408
- References
- 41
- FWCI
- 8.54
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.