Submitted:
21 July 2026
Posted:
21 July 2026
You are already at the latest version
Abstract
Keywords:
MSC: 15A69; 15A18; 62H25; 65F55
1. Introduction
2. Fourth-Order Z-Eigenvectors and Residual Recovery
- 1.
- Fix an integer . Let the matrixhave orthonormal columns consisting of eigenvectors associated with the s largest eigenvalues of . We define
- 2.
-
We also define the residual data vectors byand form the residual fourth-order tensorSince each belongs to , we have that
- 3.
-
If , then no residual direction is added.If , then we select a unit vectorIt follows immediately corresponds to a residual direction attaining the largest fourth-order response. Since for every , applying the Lagrange multiplier argument for the maximization problem on the unit sphere in givesThus, is a Z-eigenvector of .
- 4.
-
In the case , let be a target vector to which the constructed projection is applied. The PCA plus residual-recovery estimator is then defined byThe second equality follows from . Thus, is an orthogonal projector of rank . The first term retains the component of y in the leading covariance subspace, while the second term restores its component along the dominant fourth-order residual direction.
3. A Fourth-Order-Dominant Regime in Which Z-Eigenvector Recovery Outperforms PCA
- 1.
- The leading k covariance eigenvectors of are nuisance directions in N, whereas the successive orthogonal maximizers of , in (3), coincide with the structural directions , up to signs and ordering.
- 2.
-
Let denote the orthogonal projector onto S and let denote an orthogonal projector onto a leading k-dimensional eigenspace of . Let where and is an arbitrary error vector. ThenwhereasConsequently,Thus, the fourth-order structural projection has smaller squared reconstruction error wheneverIn particular, the sufficient conditionguarantees strict improvement. In the noiseless case , the improvement is exactly .
4. Stable Residual Recovery Under Tensor Perturbations
- 1.
- 2.
5. A Three-Dimensional Example
6. Conclusion
References
- Pearson, K. On lines and planes of closest fit to systems of points in space. Philosophical Mag.>, 6th Ser. 1901, 2, 559–572. [Google Scholar] [CrossRef]
- Hotelling, H. Hotelling, Analysis of a complex of statistical variables into principal components. J. Educ. Psychol. 1933, 24, 417–441; 498–520. [Google Scholar] [CrossRef]
- Jolliffe, I. T. Principal Component Analysis, 2nd ed.; Springer: New York, 2002. [Google Scholar]
- Friedman, J. H.; Tukey, J. W. A projection pursuit algorithm for exploratory data analysis. IEEE Trans. Comput.> C-23 1974, 881–890. [Google Scholar] [CrossRef]
- Huber, P. J. Projection pursuit. Ann. Stat. 1985, 13, 435–475. [Google Scholar] [CrossRef]
- Comon, P. Comon, Independent component analysis, a new concept? Signal Process. 1994, 36, 287–314. [Google Scholar] [CrossRef]
- Hyvärinen, A.; Oja, E. Independent component analysis: algorithms and applications. Neural Netw. 2000, 13, 411–430. [Google Scholar] [CrossRef] [PubMed]
- Kolda, T. G.; Bader, B. W. Tensor decompositions and applications. SIAM Rev. 2009, 51, 455–500. [Google Scholar] [CrossRef]
- Qi, L. Eigenvalues of a real supersymmetric tensor. J. Symb. Comput. 2005, 40, 1302–1324. [Google Scholar] [CrossRef]
- Lim, L.-H. Singular values and eigenvalues of tensors: a variational approach. In Proceedings of the First IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP 2005); IEEE, 2005; pp. 129–132. [Google Scholar]
- Chang, K. C.; Pearson, K.; Zhang, T. On eigenvalue problems of real symmetric tensors. J. Math. Anal. Appl. 2009, 350, 416–422. [Google Scholar] [CrossRef]
- Kofidis, E.; Regalia, P. A. On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Anal. Appl. 2002, 23, 863–884. [Google Scholar] [CrossRef]
- Kolda, T. G.; Mayo, J. R. Shifted power method for computing tensor eigenpairs. SIAM J. Matrix Anal. Appl. 2011, 32, 1095–1124. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).