REVIEW 1 cited by
Faster independent component analysis by preconditioning with Hessian approximations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Faster independent component analysis by preconditioning with Hessian approximations
read the original abstract
Independent Component Analysis (ICA) is a technique for unsupervised exploration of multi-channel data that is widely used in observational sciences. In its classic form, ICA relies on modeling the data as linear mixtures of non-Gaussian independent sources. The maximization of the corresponding likelihood is a challenging problem if it has to be completed quickly and accurately on large sets of real data. We introduce the Preconditioned ICA for Real Data (Picard) algorithm, which is a relative L-BFGS algorithm preconditioned with sparse Hessian approximations. Extensive numerical comparisons to several algorithms of the same class demonstrate the superior performance of the proposed technique, especially on real data, for which the ICA model does not necessarily hold.
Forward citations
Cited by 1 Pith paper
-
AMICA-Python: Adaptive Mixture Independent Component Analysis with Anderson Acceleration
AMICA-Python reproduces the Fortran AMICA reference to a median relative log-likelihood difference of 1.07e-8 and runs 17.7% faster (34.1% faster with DAAREM acceleration) on 14 EEG recordings.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.