Identifiability of overcomplete independent component analysis
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929225164914688 |
|---|---|
| author | Wang, Kexin Seigal, Anna |
| author_facet | Wang, Kexin Seigal, Anna |
| contents | Independent component analysis (ICA) studies mixtures of independent latent sources. An ICA model is identifiable if the mixing can be recovered uniquely. It is well-known that ICA is identifiable if and only if at most one source is Gaussian. However, this applies only to the setting where the number of sources is at most the number of observations. In this paper, we generalize the identifiability of ICA to the overcomplete setting, where the number of sources exceeds the number of observations. We give an if and only if characterization of the identifiability of overcomplete ICA. The proof studies linear spaces of rank one symmetric matrices. For generic mixing, we present an identifiability condition in terms of the number of sources and the number of observations. We use our identifiability results to design an algorithm to recover the mixing matrix from data and apply it to synthetic data and two real datasets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_14709 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Identifiability of overcomplete independent component analysis Wang, Kexin Seigal, Anna Statistics Theory Algebraic Geometry 62R01, 62E10, 13P25, 14N07, 14P05, 15A69 Independent component analysis (ICA) studies mixtures of independent latent sources. An ICA model is identifiable if the mixing can be recovered uniquely. It is well-known that ICA is identifiable if and only if at most one source is Gaussian. However, this applies only to the setting where the number of sources is at most the number of observations. In this paper, we generalize the identifiability of ICA to the overcomplete setting, where the number of sources exceeds the number of observations. We give an if and only if characterization of the identifiability of overcomplete ICA. The proof studies linear spaces of rank one symmetric matrices. For generic mixing, we present an identifiability condition in terms of the number of sources and the number of observations. We use our identifiability results to design an algorithm to recover the mixing matrix from data and apply it to synthetic data and two real datasets. |
| title | Identifiability of overcomplete independent component analysis |
| topic | Statistics Theory Algebraic Geometry 62R01, 62E10, 13P25, 14N07, 14P05, 15A69 |
| url | https://arxiv.org/abs/2401.14709 |