English

Bayesian ICA with super-Gaussian Source Priors

Methodology 2025-11-17 v3 Machine Learning

Abstract

Independent Component Analysis (ICA) plays a central role in modern machine learning as a flexible framework for feature extraction. We introduce a horseshoe-type prior with a latent Polya-Gamma scale mixture representation, yielding scalable algorithms for both point estimation via expectation-maximization (EM) and full posterior inference via Markov chain Monte Carlo (MCMC). This hierarchical formulation unifies several previously disparate estimation strategies within a single Bayesian framework. We also establish the first theoretical guarantees for hierarchical Bayesian ICA, including posterior contraction and local asymptotic normality results for the unmixing matrix. Comprehensive simulation studies demonstrate that our methods perform competitively with widely used ICA tools. We further discuss implementation of conditional posteriors, envelope-based optimization, and possible extensions to flow-based architectures for nonlinear feature extraction and deep learning. Finally, we outline several promising directions for future work.

Keywords

Cite

@article{arxiv.2406.17058,
  title  = {Bayesian ICA with super-Gaussian Source Priors},
  author = {Jyotishka Datta and Soham Ghosh and Nicholas G. Polson},
  journal= {arXiv preprint arXiv:2406.17058},
  year   = {2025}
}

Comments

This revision adds Soham Ghosh as a co-author and updates Sections 4-5 with new theoretical and empirical results

R2 v1 2026-06-28T17:17:55.435Z