Metraipolis › archive › dc_8a8bdc047596

An Exact Tail Condition for the Largest Error in Estimating a Rank-One Direction — arXiv:2609.05244

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05244
License (as archived)
CC0-1.0
Archived
2026-10-16T23:15:39.182Z
SHA-256 of the archived text
088e6b7d2b3d0e739d4f55aed78db16f756c01787de66612fb780661b56694f6
Stable URL of this page
https://metraipolis.com/documento/dc_8a8bdc047596

How to cite

An Exact Tail Condition for the Largest Error in Estimating a Rank-One Direction — arXiv:2609.05244 — arXiv (en), https://arxiv.org/abs/2609.05244 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8a8bdc047596 (Metraipolis archive dc_8a8bdc047596, sha256 088e6b7d2b3d0e739d4f55aed78db16f756c01787de66612fb780661b56694f6)
BibTeX
@misc{dc8a8bdc047596,
  title = {An Exact Tail Condition for the Largest Error in Estimating a Rank-One Direction — arXiv:2609.05244},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05244},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8a8bdc047596; sha256 088e6b7d2b3d0e739d4f55aed78db16f756c01787de66612fb780661b56694f6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05244. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider a rectangular random matrix formed by adding a rank-one term to a matrix with independent entries. The direction on the left side of that term is estimated by the leading left singular vector, and the error is multiplied by the square of the size of the added term. For entries with mean zero and variance one, we identify the exact tail condition for the following statement to hold for every deterministic sequence of directions: the largest error over all sizes of the added term converges to the same fixed value determined by the limiting ratio of rows to columns. This condition (weaker than the existence of fourth moments) requires that the tail probability, multiplied by the fourth power of the threshold, to tend to zero. If it fails, convergence to this value already fails when both directions are coordinate vectors, even at a size fixed before the matrix is drawn. For regularly varying tails of order between two and four, the largest error tends to infinity.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.ST).
Categorie arXiv: Probability (math.PR) ; Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2609.05244 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T23:02:26.789Z dalla pagina https://arxiv.org/catchup/math.ST/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).