Determining Principal Component Cardinality through the Principle of Minimum Description Length

2018-12-31 · Ami Tavory

PCA (Principal Component Analysis) and its variants areubiquitous techniques for matrix dimension reduction and reduced-dimensionlatent-factor extraction. One significant challenge in using PCA, is thechoice of the number of principal components. The information-theoreticMDL (Minimum Description Length) principle gives objective compression-based criteria for model selection, but it is difficult to analytically applyits modern definition - NML (Normalized Maximum Likelihood) - to theproblem of PCA. This work shows a general reduction of NML prob-lems to lower-dimension problems. Applying this reduction, it boundsthe NML of PCA, by terms of the NML of linear regression, which areknown.

📄 PDF Abstract BibTeX arXiv:1901.00059

Code (0)

등록된 구현이 없습니다.

Tasks

Dimensionality ReductionModel Selectionregression

Methods 이 논문이 사용한 방법론

PCA Principle Components Analysis (PCA) is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value…

Principal Component Analysis versus Factor Analysis

2021-10-21 · Zenon Gniazdowski

The article discusses selected problems related to both principal component analysis (PCA) and factor analysis (FA). In particular, both types of analysis were compared. A vector interpretation for both PCA and FA has al…

Robust Principal Component Completion

2026-03-26 · Yinjian Wang, Wei Li, Yuanyuan Gui, James E. Fowler 외 arxiv

Robust principal component analysis (RPCA) seeks a low-rank component and a sparse component from their summation. Yet, in many applications of interest, the sparse foreground actually replaces, or occludes, elements fro…

Bayesian Inference

Sparse Principal Component Analysis for High Dimensional Vector Autoregressive Models

2013-06-30 · Zhaoran Wang, Fang Han, Han Liu

We study sparse principal component analysis for high dimensional vector autoregressive time series under a doubly asymptotic framework, which allows the dimension $d$ to scale with the series length $T$. We treat the tr…

Time Series Time Series Analysis Vocal Bursts Intensity Prediction

Solving clustering as ill-posed problem: experiments with K-Means algorithm

2022-11-15 · Alberto Arturo Vergani

In this contribution, the clustering procedure based on K-Means algorithm is studied as an inverse problem, which is a special case of the illposed problems. The attempts to improve the quality of the clustering inverse …

Clustering

Sparse Bayesian Methods for Low-Rank Matrix Estimation

2011-02-25 · S. Derin Babacan, Martin Luessi, Rafael Molina, Aggelos K. Katsaggelos

Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by recent theoretical results for exact reconstruction guarantees and interesting practical applica…

Matrix Completion