mlsanityData to 7 Oct 2026

Boosting Independent Component Analysis

arXiv 2112.06920 ↗First posted 12 Dec 2021stat.ML cs.LG eess.SPcited by 0

Not on the map. Why?

Abstract (arXiv)

Independent component analysis is intended to recover the mutually independent components from their linear mixtures. This technique has been widely used in many fields, such as data analysis, signal processing, and machine learning. To alleviate the dependency on prior knowledge concerning unknown sources, many nonparametric methods have been proposed. In this paper, we present a novel boosting-based algorithm for independent component analysis. Our algorithm consists of maximizing likelihood estimation via boosting and seeking unmixing matrix by the fixed-point method. A variety of experiments validate its performance compared with many of the presently known algorithms.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 55 references that are in the map. First posted on arXiv 12 Dec 2021.

Builds on

6 of 55 references.

References · 6

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2017Faster independent component analysis by preconditioning with Hessian approximationscited by 16
  3. 2019Overcomplete Independent Component Analysis via SDPcited by 9
  4. 2013Independent Component Analysis via Distance Covariancecited by 6
  5. 2021Boosting in Univariate Nonparametric Maximum Likelihood Estimationcited by 2
  6. 2021Second-order Approximation of Minimum Discrimination Information in Independent Component Analysiscited by 1

Built on by

Not cited yet.