pith. sign in

arxiv: 1609.06942 · v1 · pith:DJTLQHS6new · submitted 2016-09-22 · 📊 stat.ML · cs.LG· cs.SY· math.PR· math.ST· stat.TH

Randomized Independent Component Analysis

classification 📊 stat.ML cs.LGcs.SYmath.PRmath.STstat.TH
keywords randomizedindependentmeasuresanalysisapproximationscanonicalcomponentcomputational
0
0 comments X
read the original abstract

Independent component analysis (ICA) is a method for recovering statistically independent signals from observations of unknown linear combinations of the sources. Some of the most accurate ICA decomposition methods require searching for the inverse transformation which minimizes different approximations of the Mutual Information, a measure of statistical independence of random vectors. Two such approximations are the Kernel Generalized Variance or the Kernel Canonical Correlation which has been shown to reach the highest performance of ICA methods. However, the computational effort necessary just for computing these measures is cubic in the sample size. Hence, optimizing them becomes even more computationally demanding, in terms of both space and time. Here, we propose a couple of alternative novel measures based on randomized features of the samples - the Randomized Generalized Variance and the Randomized Canonical Correlation. The computational complexity of calculating the proposed alternatives is linear in the sample size and provide a controllable approximation of their Kernel-based non-random versions. We also show that optimization of the proposed statistical properties yields a comparable separation error at an order of magnitude faster compared to Kernel-based measures.

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.