The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determination
Open accessAbstract
CANDECOMP/PARAFAC (CP) tensor factorization of incomplete data is a powerful technique for tensor completion through explicitly capturing the multilinear latent factors. The existing CP algorithms require the tensor rank to be manually specified, however, the determination of tensor rank remains a challenging problem especially for CP rank . In addition, existing approaches do not take into account uncertainty information of latent factors, as well as missing entries. To address these issues, we formulate CP factorization using a hierarchical probabilistic model and employ a fully Bayesian treatment by incorporating a sparsity-inducing prior over multiple latent factors and the appropriate hyperpriors over all hyperparameters, resulting in automatic rank determination. To learn the model, we develop an efficient deterministic Bayesian inference algorithm, which scales linearly with data size. Our method is characterized as a tuning parameter-free approach, which can effectively infer underlying multilinear factors with a low-rank constraint, while also providing predictive distributions over missing entries. Extensive simulations on synthetic data illustrate the intrinsic capability of our method to recover the ground-truth of CP rank and prevent the overfitting problem, even when a large amount of entries are missing. Moreover, the results from real-world applications, including image inpainting and facial image synthesis, demonstrate that our method outperforms state-of-the-art approaches for both tensor factorization and tensor completion in terms of predictive performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Probabilistic Matrix Factorization
Mnih, A., & Salakhutdinov, R. (2007) · neural information processing systems · Cited by 3,798
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
PARAFAC. Tutorial and applications
Bro, R. (1997) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(97)00032-4 · Cited by 2,814
Harshman, R. A. (1970) · Cited by 2,255
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
Cichocki, A., Zdunek, R., Phan, A. H., & Amari, S. (2009) · doi:10.1002/9780470747278 · Cited by 1,540
Self-citationBayesian probabilistic matrix factorization using Markov chain Monte Carlo
Salakhutdinov, R., & Mnih, A. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390267 · Cited by 1,413
Pattern Recognition and Machine Learning
Maindonald, J. (2007) · Journal of Statistical Software · doi:10.18637/jss.v017.b05 · Cited by 1,349
A 3D Face Model for Pose and Illumination Invariant Face Recognition
Paysan, P., Knothe, R., Amberg, B., Romdhani, S., & Vetter, T. (2009) · 2009 Sixth IEEE International Conference on Advanced Video and Signal Based Surveillance · doi:10.1109/avss.2009.58 · Cited by 1,326
Probabilistic Matrix Factorization
Salakhutdinov, R., & Mnih, A. (2007) · Cited by 1,075
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
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
(2005) · Edinburgh Research Explorer (University of Edinburgh) · doi:10.5555/1046920.1088695 · Cited by 650
Scalable tensor factorizations for incomplete data
Acar, E., Dunlavy, D. M., Kolda, T. G., & Mørup, M. (2011) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2010.08.004 · Cited by 602
Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization
Xiong, L., Chen, X., Huang, T.-K., Schneider, J., & Carbonell, J. G. (2010) · Proceedings of the 2010 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.19 · Cited by 585
Håstad, J. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90014-6 · Cited by 584
Sparse Bayesian Methods for Low-Rank Matrix Estimation
Babacan, S. D., Luessi, M., Molina, R., & Katsaggelos, A. K. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2197748 · Cited by 327
Low-rank tensor completion by Riemannian optimization
Kressner, D., Steinlechner, M., & Vandereycken, B. (2014) · BIT Numerical Mathematics · doi:10.1007/s10543-013-0455-z · Cited by 290
Sorber, L., Van Barel, M., & De Lathauwer, L. (2013) · SIAM Journal on Optimization · doi:10.1137/120868323 · Cited by 273
Bishop, C. (1998) · neural information processing systems · Cited by 224
Non-linear matrix factorization with Gaussian processes
Lawrence, N. D., & Urtasun, R. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553452 · Cited by 215
Bayesian Methods for Backpropagation Networks
MacKay, D. J. C. (1996) · Physics of Neural Networks · doi:10.1007/978-1-4612-0723-8_6 · Cited by 213
Learning with tensors: a framework based on convex optimization and spectral regularization
Signoretto, M., Tran Dinh, Q., De Lathauwer, L., & Suykens, J. A. K. (2014) · Machine Learning · doi:10.1007/s10994-013-5366-3 · Cited by 204
Simultaneous Tensor Decomposition and Completion Using Factor Priors
Chen, Y., Hsu, C.-T., & Liao, H.-Y. M. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.164 · Cited by 183
Tensor factorization using auxiliary information
Narita, A., Hayashi, K., Tomioka, R., et al. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0280-z · Cited by 134
Håstad, J. (1989) · Lecture notes in computer science · doi:10.1007/bfb0035776 · Cited by 110
Probabilistic models for incomplete multi-dimensional arrays
Chu, W., & Ghahramani, Z. (2009) · Cited by 105
Composite splitting algorithms for convex optimization
Huang, J., Zhang, S., Li, H., & Metaxas, D. (2011) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2011.06.011 · Cited by 99
Reconstruction and Recognition of Tensor-Based Objects With Concurrent Subspaces Analysis
Xu, D., Yan, S., Zhang, L., Lin, S. C.-F., Zhang, H.-J., & Huang, T. S. (2008) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2007.903317 · Cited by 90
Self-citationTensor Rank: Some Lower and Upper Bounds
Alexeev, B., Forbes, M. A., & Tsimerman, J. (2011) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2011.28 · Cited by 58
Robust Bayesian Matrix Factorisation
Lakshminarayanan, B., Bouchard, G., & Archambeau, C. (2011) · Cited by 54
Geometric complexity theory and tensor rank
Bürgisser, P., & Ikenmeyer, C. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993704 · Cited by 49
Enhancing Bilinear Subspace Learning by Element Rearrangement
Xu, D., Yan, S., Lin, S. C.-F., Huang, T. S., & Chang, S. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.51 · Cited by 26
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
Large Margin Low Rank Tensor Analysis
Zhong, G., & Cheriet, M. (2014) · Neural Computation · doi:10.1162/neco_a_00570 · Cited by 20
Tensor completion throughmultiple Kronecker product decomposition
Phan, A. H., Cichocki, A. S., Tichavský, P., et al. (2013) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2013.6638255 · Cited by 18
Self-citation
Cited by
Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
Bengua, J. A., Phien, H. N., Tuan, H. D., & Do, M. N. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2672439 · Cited by 461
A Bayesian tensor decomposition approach for spatiotemporal traffic data imputation
Chen, X., He, Z., & Sun, L. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.11.003 · Cited by 373
Tensors for Data Mining and Data Fusion: Models, Applications, and Scalable Algorithms
Papalexakis, E. E., Faloutsos, C., & Sidiropoulos, N. D. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2915921 · Cited by 354
Sun, Y., Yang, J., & An, W. (2021) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2020.3022069 · Cited by 332
Hyperspectral Image Super-Resolution via Non-local Sparse Tensor Factorization
Dian, R., Fang, L., & Li, S. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.411 · Cited by 330
Metadata
- Authors
- Zhao, Q., Zhang, L., & Cichocki, A.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2015-09-01
- Volume
- 37
- Issue
- 9
- Pages
- 1751-1763
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W2147512299
- Cited by
- 587
- References
- 38
- FWCI
- 11.43
- 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.