### Identifiability of overcomplete independent component analysis

- Series
- Algebra Seminar
- Time
- Monday, April 8, 2024 - 13:00 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Ada Wang – Harvard University

There will be a pre-seminar in Skiles 005 at 11 am.

Independent component analysis (ICA) is a classical data analysis method to study mixtures of independent sources. An ICA model is said to be identifiable if the mixing can be recovered uniquely. Identifiability is known to hold if and only if at most one of the sources is Gaussian, provided the number of sources is at most the number of observations. In this talk, I will discuss our work to generalize the identifiability of ICA to the overcomplete setting, where the number of sources can exceed the number of observations.The underlying problem is algebraic and the proof studies linear spaces of rank one symmetric matrices. Based on joint work with Anna Seigal https://arxiv.org/abs/2401.14709