Abstract
Many ICA algorithms use prewhitening (second order decorrelation) as a preprocessing tool. This preprocessing can be shown to be valid when all hidden sources have fintie second moments, which is not required for the identifiability issue[9]. One would conjecture that if one or more sources do not have finite second moments then prewhitening would cause a breakdown. But we discover that this conjecture is not right. We provide some theories for this phenomenon as well as some simulation studies. © Springer-Verlag 2004.
Cite
CITATION STYLE
Chen, A., & Bickel, P. J. (2004). Robustness of prewhitening against heavy-tailed sources. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 225–232. https://doi.org/10.1007/978-3-540-30110-3_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.