Journal article · 2026 · Open access

Optimal Estimation of Shared Singular Subspaces Across Multiple Noisy Matrices

Zhihua Ma, Rong Ma

IEEE Transactions on Information Theory, 72(5), 3277–3300 · Published 24 February 2026 · DOI 10.1109/tit.2026.3667733

Open PDFView at the publisherCite this paper

In brief

“Optimal Estimation of Shared Singular Subspaces Across Multiple Noisy Matrices” is a 2026 journal article by Zhihua Ma and Rong Ma, published in IEEE Transactions on Information Theory. OpenAlex counts 18 citations as of 18 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at arXiv (Cornell University).

Citations
18
Most cited in
2026 (13)
Field-weighted impact
19.32
References
76
Authors
2

Abstract

Estimating singular subspaces from noisy matrices is a fundamental problem with wide-ranging applications across various fields. Driven by the challenges of data integration and multi-view analysis, this study focuses on estimating shared singular subspaces across multiple matrices within a low-rank matrix denoising framework. A common approach for this task is to perform singular value decomposition on the stacked matrix (Stack-SVD), which concatenates all the matrices. We establish that Stack-SVD achieves minimax rate-optimality when the true singular subspaces of the noisy matrices are identical, whereas a popular alternative approach based on SVD of concatenated singular vector matrices (Average-SVD) can be sub-optimal. We then tackle the more complex scenario where the true singular subspaces are only partially shared across matrices. For various cases of partial sharing, we rigorously characterize the conditions under which Stack-SVD remains effective, achieves minimax optimality, or fails to deliver consistent estimates, offering theoretical insights into its practical applicability. To address the limitations of Stack-SVD in scenarios with partial sharing, we propose novel estimators and an efficient algorithm designed to identify both shared and unshared singular vectors. We further prove that these methods attain minimax rate-optimality under partial sharing. Extensive simulations and real-world data applications demonstrate the advantages of our proposed approach.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Ma, Z., & Ma, R. (2026). Optimal Estimation of Shared Singular Subspaces Across Multiple Noisy Matrices. IEEE Transactions on Information Theory, 72(5), 3277–3300. https://doi.org/10.1109/tit.2026.3667733

MLA 9

Ma, Zhihua, and Rong Ma. “Optimal Estimation of Shared Singular Subspaces Across Multiple Noisy Matrices.” IEEE Transactions on Information Theory, vol. 72, no. 5, 2026, pp. 3277–3300. https://doi.org/10.1109/tit.2026.3667733.

Chicago

Ma, Zhihua and Rong Ma. 2026. “Optimal Estimation of Shared Singular Subspaces Across Multiple Noisy Matrices.” IEEE Transactions on Information Theory 72 (5): 3277–3300. https://doi.org/10.1109/tit.2026.3667733.

Harvard

Ma, Z. and Ma, R. (2026) ‘Optimal Estimation of Shared Singular Subspaces Across Multiple Noisy Matrices’, IEEE Transactions on Information Theory, 72(5), pp. 3277–3300. doi:10.1109/tit.2026.3667733.

IEEE

Z. Ma and R. Ma, “Optimal Estimation of Shared Singular Subspaces Across Multiple Noisy Matrices,” IEEE Transactions on Information Theory, vol. 72, no. 5, pp. 3277–3300, 2026, doi: 10.1109/tit.2026.3667733.

BibTeX

@article{ma2026optimal,
  title     = {{Optimal Estimation of Shared Singular Subspaces Across Multiple Noisy Matrices}},
  author    = {Ma, Zhihua and Ma, Rong},
  journal   = {IEEE Transactions on Information Theory},
  year      = {2026},
  volume    = {72},
  number    = {5},
  pages     = {3277--3300},
  doi       = {10.1109/tit.2026.3667733},
  url       = {https://doi.org/10.1109/tit.2026.3667733}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202211
202544
20261313

Its field-weighted citation impact is 19.32: it has been cited 19.32 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques

  • minimax rate optimality
  • multi-view analysis
  • data integration
  • singular value decomposition

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Ma, Z., & Ma, R. (2026). Optimal Estimation of Shared Singular Subspaces Across Multiple Noisy Matrices. IEEE Transactions on Information Theory, 72(5), 3277–3300. https://doi.org/10.1109/tit.2026.3667733

How many times has this paper been cited?

18 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Zhihua Ma, Rong Ma.

What is the DOI of this paper?

10.1109/tit.2026.3667733, permanently at https://doi.org/10.1109/tit.2026.3667733. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.