Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 52 min ago
PreprintarXiv licencearXiv

Identifiability from Moments in Independent Component Analysis Mixture Models

Abstract

We study Independent Component Analysis (ICA) mixture models. These models consist of mixtures of ICA densities. An ICA density is associated with a random vector whose coordinates become mutually independent after an invertible linear transformation. ICA mixture models are nonparametric extensions of the celebrated family of Gaussian mixtures. We show that in many cases the ICA mixtures are identifiable from the collection of the observed moment tensors, that is, the mixing coefficients, linear transformations, and source moments of order up to d can be identified from the moment tensors of order up to d for generic parameters. We address the problem by studying the corresponding secant varieties and their algebraic properties such as dimensions and Gauss maps. In particular, for n-variate distributions, we establish that generically and up to the trivial scaling and permutation symmetries, when d≥ 5, the parameters can be recovered uniquely for asymptotically up to nd−2/d! mixture components. For d=3,4, we show identifiability up to a finite equivalence class for asymptotically up to nd−2/d! and 0.5 nd−2/d! components respectively, where for d=4 the mixing coefficients need to be known a priori. The obtained bounds on the component numbers have the maximum possible orders in n, and for d = 3 and d≥ 5, they are also asymptotically sharp.

Related

  1. Component-weighted sparse group LASSO for finite mixture regression models
    Vinay Joshy, Zeny Feng, Grace Stelter +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Globally Convergent Block Coordinate Descent Algorithms for Semi-Nonnegative Independent Component Analysis
    Zhenyu Cai, Wentao Ding, Jianze Li +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Multiplicity-Weighted Moments Across a Harmonic Caustic: Closed Forms with Order-Independent Breakpoints
    Tamás Bódis
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Linear Independent Component Analysis via Optimal Transport
    Ashutosh Jha, Michel Besserve, Simon Buchholz
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. A Tutorial on Structural Identifiability of Epidemic Models Using StructuralIdentifiability.jl
    Yuganthi R. Liyanage, Omar Saucedo, Necibe Tuncer +1
    Bulletin of Mathematical BiologyPeer-reviewedLicence not statedFull text14 citedGeneral mathematicsOpenAlex
BibTeX
@misc{semnani2026identifiability,
  title = {{Identifiability from Moments in Independent Component Analysis Mixture Models}},
  author = {Pardis Semnani and Konstantin Usevich and Elina Robeva},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.23846},
  eprint = {2610.23846},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.23846},
}
RIS
TY  - UNPB
TI  - Identifiability from Moments in Independent Component Analysis Mixture Models
AU  - Pardis Semnani
AU  - Konstantin Usevich
AU  - Elina Robeva
PY  - 2026
DA  - 2026/10/16
PB  - arXiv
DO  - 10.48550/arxiv.2610.23846
UR  - https://arxiv.org/abs/2610.23846
AB  - We study Independent Component Analysis (ICA) mixture models. These models consist of mixtures of ICA densities. An ICA density is associated with a random vector whose coordinates become mutually independent after an invertible linear transformation. ICA mixture models are nonparametric extensions of the celebrated family of Gaussian mixtures. We show that in many cases the ICA mixtures are identifiable from the collection of the observed moment tensors, that is, the mixing coefficients, linear transformations, and source moments of order up to d can be identified from the moment tensors of order up to d for generic parameters. We address the problem by studying the corresponding secant varieties and their algebraic properties such as dimensions and Gauss maps. In particular, for n-variate distributions, we establish that generically and up to the trivial scaling and permutation symmetries, when d≥ 5, the parameters can be recovered uniquely for asymptotically up to n^d−2/d! mixture components. For d=3,4, we show identifiability up to a finite equivalence class for asymptotically up to n^d−2/d! and 0.5 n^d−2/d! components respectively, where for d=4 the mixing coefficients need to be known a priori. The obtained bounds on the component numbers have the maximum possible orders in n, and for d = 3 and d≥ 5, they are also asymptotically sharp.
ER  -