The DOI matches its Crossref record.
Cramer-Rao lower bounds for low-rank decomposition of multidimensional arrays
Abstract
Unlike low-rank matrix decomposition, which is generically nonunique for rank greater than one, low-rank three-and higher dimensional array decomposition is unique, provided that the array rank is lower than a certain bound, and the correct number of components (equal to array rank) is sought in the decomposition. Parallel factor (PARAFAC) analysis is a common name for low-rank decomposition of higher dimensional arrays. This paper develops Cramer-Rao bound (CRB) results for low-rank decomposition of three- and four-dimensional (3-D and 4-D) arrays, illustrates the behavior of the resulting bounds, and compares alternating least squares algorithms that are commonly used to compute such decompositions with the respective CRBs. Simple-to-check necessary conditions for a unique low-rank decomposition are also provided.
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
Cited by
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Self-citationCichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384
Multimodal Data Fusion: An Overview of Methods, Challenges, and Prospects
Lahat, D., Adali, T., & Jutten, C. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2460697 · Cited by 1,296
“For example, a specific arrangement of a receive antenna array or other properties of a communication system may be imposed via a Vandermonde [72]–[75] or Toeplitz [76] structure.”
BackgroundInfluentialChannel Estimation for RIS-Empowered Multi-User MISO Wireless Communications
Wei, L., Huang, C., Alexandropoulos, G. C., Yuen, C., Zhang, Z., & Debbah, M. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3063236 · Cited by 704
Tensor Regression with Applications in Neuroimaging Data Analysis
Zhou, H., Li, L., & Zhu, H. (2013) · Journal of the American Statistical Association · doi:10.1080/01621459.2013.776499 · Cited by 556
Non-negative tensor factorization with applications to statistics and computer vision
Shashua, A., & Hazan, T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102451 · Cited by 490
De Lathauwer, L. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040608830 · Cited by 419
Analytical Figures of Merit: From Univariate to Multiway Calibration
Olivieri, A. C. (2014) · Chemical Reviews · doi:10.1021/cr400455s · Cited by 385
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
Low-Rank Tensor Decomposition-Aided Channel Estimation for Millimeter Wave MIMO-OFDM Systems
Zhou, Z., Fang, J., Yang, L., Li, H., Chen, Z., & Blum, R. S. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2699338 · Cited by 309
Metadata
- Authors
- Liu, X., & Sidiropoulos, N. D.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2001
- Volume
- 49
- Issue
- 9
- Pages
- 2074-2086
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2138996475
- Cited by
- 206
- References
- 0
- FWCI
- 2.71
- Type
- journal article
- Language
- en
- Open access
- closed
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.