English

Selecting the rank of truncated SVD by Maximum Approximation Capacity

Information Theory 2013-01-08 v3 Machine Learning math.IT Machine Learning

Abstract

Truncated Singular Value Decomposition (SVD) calculates the closest rank-kk approximation of a given input matrix. Selecting the appropriate rank kk 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.

Keywords

Cite

@article{arxiv.1102.3176,
  title  = {Selecting the rank of truncated SVD by Maximum Approximation Capacity},
  author = {Mario Frank and Joachim M. Buhmann},
  journal= {arXiv preprint arXiv:1102.3176},
  year   = {2013}
}

Comments

7 pages, 5 figures; Will be presented at the IEEE International Symposium on Information Theory (ISIT) 2011. The conference version has only 5 pages. This version has an extended appendix

R2 v1 2026-06-21T17:26:48.322Z