Nonparametric Evaluation of Noisy ICA Solutions

2024-01-16 · Syamantak Kumar, Purnamrita Sarkar, Peter Bickel, Derek Bean

Independent Component Analysis (ICA) was introduced in the 1980's as a model for Blind Source Separation (BSS), which refers to the process of recovering the sources underlying a mixture of signals, with little knowledge about the source signals or the mixing process. While there are many sophisticated algorithms for estimation, different methods have different shortcomings. In this paper, we develop a nonparametric score to adaptively pick the right algorithm for ICA with arbitrary Gaussian noise. The novelty of this score stems from the fact that it just assumes a finite second moment of the data and uses the characteristic function to evaluate the quality of the estimated mixing matrix without any knowledge of the parameters of the noise distribution. In addition, we propose some new contrast functions and algorithms that enjoy the same fast computability as existing algorithms like FASTICA and JADE but work in domains where the former may fail. While these also may have weaknesses, our proposed diagnostic, as shown by our simulations, can remedy them. Finally, we propose a theoretical framework to analyze the local and global convergence properties of our algorithms.

📄 PDF Abstract BibTeX arXiv:2401.08468

Code (0)

등록된 구현이 없습니다.

Tasks

blind source separationDiagnostic

Methods 이 논문이 사용한 방법론

ICA _Independent component analysis (ICA) is a statistical and computational technique for revealing hidden factors that underlie sets of random variables, measurements, or…

Unsupervised nonparametric detection of unknown objects in noisy images based on percolation theory

2011-02-24 · Mikhail A. Langovoy, Olaf Wittich, Patrick Laurie Davies

We develop an unsupervised, nonparametric, and scalable statistical learning method for detection of unknown objects in noisy images. The method uses results from percolation theory and random graph theory. We present an…

Nonparametric Density Estimation for Stochastic Optimization with an Observable State Variable

2010-12-01 · NeurIPS 2010 12 · Lauren Hannah, Warren Powell, David M. Blei

We study convex stochastic optimization problems where a noisy objective function value is observed after a decision is made. There are many stochastic optimization problems whose behavior depends on an exogenous state v…

Density Estimation Stochastic Optimization

Learning nonparametric ordinary differential equations from noisy data

2022-06-30 · Kamel Lahouel, Michael Wells, Victor Rielly, Ethan Lew 외

Learning nonparametric systems of Ordinary Differential Equations (ODEs) dot x = f(t,x) from noisy data is an emerging machine learning topic. We use the well-developed theory of Reproducing Kernel Hilbert Spaces (RKHS) …

Nonparametric Hawkes Processes: Online Estimation and Generalization Bounds

2018-01-25 · Yingxiang Yang, Jalal Etesami, Niao He, Negar Kiyavash

In this paper, we design a nonparametric online algorithm for estimating the triggering functions of multivariate Hawkes processes. Unlike parametric estimation, where evolutionary dynamics can be exploited for fast comp…

Generalization Bounds

Label Ranking through Nonparametric Regression

2021-11-04 · Dimitris Fotakis, Alkis Kalavasis, Eleni Psaroudaki

Label Ranking (LR) corresponds to the problem of learning a hypothesis that maps features to rankings over a finite set of labels. We adopt a nonparametric regression approach to LR and obtain theoretical performance gua…

regression