On the estimation of entropy in the fastICA algorithm
From MaRDI portal
Publication:2657196
DOI10.1016/j.jmva.2020.104689zbMath1461.62086arXiv1805.10206OpenAlexW3092341819MaRDI QIDQ2657196
Publication date: 12 March 2021
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.10206
projectionsconvergenceblind source separationindependent component analysisapproximationcounterexampleprojection pursuit
Computational methods for problems pertaining to statistics (62-08) Factor analysis and principal components; correspondence analysis (62H25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fourth moments and independent component analysis
- Sudakov's typical marginals, random linear functionals and a conditional central limit theorem
- Asymptotics of graphical projection pursuit
- 10.1162/153244303768966085
- Deflation-Based FastICA With Adaptive Choices of Nonlinearities
- 10.1162/jmlr.2003.4.7-8.1271
- Limit theorems for sums of general functions of m-spacings
- Large‐scale super‐Gaussian sources separation using Fast‐ICA with rational nonlinearities
This page was built for publication: On the estimation of entropy in the fastICA algorithm