Singular value decomposition for high dimensional data / Dan Yang.

Format:

Book

Manuscript

Thesis/Dissertation

Author/Creator:

Yang, Dan.

Contributor:

Buja, Andreas, advisor.

Ma, Zongming, advisor.

Small, Dylan, committee member.

Low, Mark, committee member.

University of Pennsylvania. Statistics.

Language:

English

Subjects (All):

Penn dissertations--Statistics.

Statistics--Penn dissertations.

Local Subjects:

Penn dissertations--Statistics.

Statistics--Penn dissertations.

Physical Description:

ix, 95 pages : illustrations ; 29 cm

Production:

2012.

Summary:

Singular value decomposition is a widely used tool for dimension reduction in multivariate analysis. However, when used for statistical estimation in high-dimensional low rank matrix models, singular vectors of the noise-corrupted matrix are inconsistent for their counterparts of the true mean matrix. We suppose the true singular vectors have sparse representations in a certain basis. We propose an iterative thresholding algorithm that can estimate the subspaces spanned by leading left and right singular vectors and also the true mean matrix optimally under Gaussian assumption. We further turn the algorithm into a practical methodology that is fast, data-driven and robust to heavy-tailed noises. Simulations and a real data example further show its competitive performance. The dissertation contains two chapters. For the ease of the delivery, Chapter 1 is dedicated to the description and the study of the practical methodology and Chapter 2 states and proves the theoretical property of the algorithm under Gaussian noise.

Notes:

Advisers: Andreas Buja; Zongming Ma.

Thesis (Ph.D. in Statistics) -- University of Pennsylvania, 2012.

Includes bibliographical references.

OCLC:

799154312