Learning Nonlinear Mixtures: Identifiability and Algorithm

Abstract

Linear mixture models have proven very useful in a plethora of applications, e.g., topic modeling, clustering, and source separation. As a critical aspect of the linear mixture models, identifiability of the model parameters is well-studied, under frameworks such as independent component analysis and constrained matrix factorization. Nevertheless, when the linear mixtures are distorted by an unknown nonlinear functions -- which is well-motivated and more realistic in many cases -- the identifiability issues are much less studied. This work proposes an identification criterion for a nonlinear mixture model that is well grounded in many real-world applications, and offers identifiability guarantees. A practical implementation based on a judiciously designed neural network is proposed to realize the criterion, and an effective learning algorithm is proposed. Numerical results on synthetic and real-data corroborate effectiveness of the proposed method.

arXiv comment15 pages

References in corpus (16)

• Probabilistic Latent Semantic Analysis
• A Variable Splitting Augmented Lagrangian Approach to Linear Spectral Unmixing
• Nonlinear unmixing of hyperspectral images: models and algorithms
• Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
• Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applications
• Nonlinear hyperspectral unmixing with robust nonnegative matrix factorization
• Unsupervised Feature Extraction by Time-Contrastive Learning and Nonlinear ICA
• A Spectral Algorithm for Latent Dirichlet Allocation
• A Practical Algorithm for Topic Modeling with Provable Guarantees
• Identifiability of the Simplex Volume Minimization Criterion for Blind Hyperspectral Unmixing: The No Pure-Pixel Case
• Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
• Sparse Recovery and Dictionary Learning from Nonlinear Compressive Measurements
• Optimal linear estimation under unknown nonlinear transform
• Anchor-Free Correlated Topic Modeling: Identifiability and Algorithm
• Provable Algorithms for Inference in Topic Models
• Learning Hidden Markov Models from Pairwise Co-occurrences with Application to Topic Modeling

Cited by in corpus (4)

• Nonlinear Multiview Analysis: Identifiability and Neural Network-assisted Implementation
• Recovering Joint Probability of Discrete Random Variables from Pairwise Marginals
• Identifiability-Guaranteed Simplex-Structured Post-Nonlinear Mixture Learning via Autoencoder
• Deep Clustering of Compressed Variational Embeddings