pith. sign in

arxiv: 1102.3176 · v3 · pith:5QPLIIY7new · submitted 2011-02-15 · 💻 cs.IT · cs.LG· math.IT· stat.ML

Selecting the rank of truncated SVD by Maximum Approximation Capacity

classification 💻 cs.IT cs.LGmath.ITstat.ML
keywords approximationrankappropriatecapacitychannelmodeloptimalproblem
0
0 comments X
read the original abstract

Truncated Singular Value Decomposition (SVD) calculates the closest rank-$k$ approximation of a given input matrix. Selecting the appropriate rank $k$ defines a critical model order choice in most applications of SVD. To obtain a principled cut-off criterion for the spectrum, we convert the underlying optimization problem into a noisy channel coding problem. The optimal approximation capacity of this channel controls the appropriate strength of regularization to suppress noise. In simulation experiments, this information theoretic method to determine the optimal rank competes with state-of-the art model selection techniques.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.