Nonlinear independent component analysis (ICA) provides an appealing framework for unsupervised feature learning, but the models proposed so far are not identifiable. Here, we first propose a new intuitive principle of unsupervised deep learning from time series which uses the nonstationary structure of the data. Our l…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “contrastive ICA”
Contrastive ICA identifies features in experimental groups relative to controls.
problem Jointly analyzing experimental and control datasets to identify salient features.
method Developed contrastive ICA (cICA) using tensor decomposition.
result cICA identifies patterns and visualizes data effectively, outperforming existing methods.
Paper connects contrastive learning to MI maximization and establishes robust methods for nonlinear ICA and subspace estimation.
problem Understanding and improving unsupervised representation learning and density ratio estimation.
method The paper connects contrastive learning to MI maximization, establishes new recovery conditions for nonlinear ICA, and proposes a practical outlier-robust method for nonlinear subspace estimation.
result The proposed methods can be seen as maximizing MI, performing nonlinear ICA, or estimating nonlinear subspaces, and are robust to outliers.
Non-linear source separation is a challenging open problem with many applications. We extend a recently proposed Adversarial Non-linear ICA (ANICA) model, and introduce Cramer-Wold ICA (CW-ICA). In contrast to ANICA we use a simple, closed--form optimization target instead of a discriminator--based independence measure…
OT-ICA uses optimal transport to find independent components, outperforming traditional methods.
problem Finding independent components from linear mixtures of signals.
method OT-ICA uses the squared Wasserstein distance to maximize non-Gaussianity, optimizing projections via gradient descent.
result OT-ICA outperforms traditional proxy-based methods in various applications.
Generalizes PCA and ICA for continuous-time signals using neural networks.
problem Low-rank decomposition of continuous-time vector-valued signals.
method Implicit neural network framework to learn numerical approximations of PCA and ICA.
result Unified approach to PCA and ICA in continuous domain, enforcing decorrelation and independence.
Nonlinear independent component analysis (ICA) is a general framework for unsupervised representation learning, and aimed at recovering the latent variables in data. Recent practical methods perform nonlinear ICA by solving a series of classification problems based on logistic regression. However, it is well-known that…
A new law limits kurtosis contrast in balanced mixtures.
problem Kurtosis-based ICA fails in wide, balanced mixtures.
method Proved a redundancy law and showed purification restores contrast.
result Kurtosis contrast obeys in balanced mixtures.
We present a generalization of independent component analysis (ICA), where instead of looking for a linear transform that makes the data components independent, we look for a transform that makes the data components well fit by a tree-structured graphical model. Treating the problem as a semiparametric statistical prob…
Nonlinear ICA is a fundamental problem for unsupervised representation learning, emphasizing the capacity to recover the underlying latent variables generating the data (i.e., identifiability). Recently, the very first identifiability proofs for nonlinear ICA have been proposed, leveraging the temporal structure of the…
AVICA estimates noise levels for better group ICA source recovery.
problem Estimating shared independent sources from multiple noisy views.
method AVICA models each view as a linear mixture of shared sources with additive noise, optimizing noise levels alongside sources.
result AVICA yields better source estimates than other methods, especially in real-world applications like MEG and fMRI.
Independent component analysis (ICA) aims at decomposing an observed random vector into statistically independent variables. Deflation-based implementations, such as the popular one-unit FastICA algorithm and its variants, extract the independent components one after another. A novel method for deflationary ICA, referr…
Study uses Wasserstein distance to identify causal orders and unmix sources.
problem Identifying causal relationships and separating sources in non-Gaussian data.
method Wasserstein distance for non-Gaussianity, linear ICA, causal inference.
result Exact identification of ICA unmixing matrix and causal orders.
We consider the problem of recovering a common latent source with independent components from multiple views. This applies to settings in which a variable is measured with multiple experimental modalities, and where the goal is to synthesize the disparate measurements into a single unified representation. We consider t…
Causal Component Analysisstat.ML
Causal Component Analysis aims to recover latent variables with causal relationships.
problem Recover latent variables with causal relationships from observed mixtures.
method Introduces a likelihood-based approach using normalizing flows to estimate unmixing function and causal mechanisms.
result Demonstrates effectiveness through synthetic experiments in CauCA and ICA settings.
A new method for binary ICA using non-stationary sources.
problem Independent component analysis of binary data.
method Linear mixing model in latent space, followed by binary observation model with non-stationary sources.
result Proves non-identifiability with few observed variables but identifies with more variables.
This paper tackles sequential distribution shifts in representation learning.
problem Learning meaningful representations in a sequence of distribution shifts.
method Nonlinear Independent Component Analysis (ICA) framework for continual causal representation learning.
result The method achieves performance comparable to joint training on multiple offline distributions and shows no benefit from the incoming new distribution on all latent variables.
New model separates images into independent factors quickly and easily.
problem Separating high-dimensional data like images into independent latent factors.
method Combines bijective feature maps with linear ICA model on the Stiefel manifold.
result Models converge quickly and achieve better unsupervised latent factor discovery.
A new ICA method adds L1-regularization for better interpretability of fMRI data.
problem Improving interpretability of ICA features in high-dimensional fMRI data.
method L1-regularization added to ICA cost function, solved by DCA.
result Validated on synthetic and real fMRI data, improving feature interpretability.
Independent component analysis (ICA) is the most popular method for blind source separation (BSS) with a diverse set of applications, such as biomedical signal processing, video and image analysis, and communications. Maximum likelihood (ML), an optimal theoretical framework for ICA, requires knowledge of the true unde…
Independent Component Analysis (ICA) is a popular model for blind signal separation. The ICA model assumes that a number of independent source signals are linearly mixed to form the observed signals. We propose a new algorithm, PEGI (for pseudo-Euclidean Gradient Iteration), for provable model recovery for ICA with Gau…
Paper proposes compressive ICA algorithms for ICA model.
problem Efficiently solving ICA model with reduced memory and computational complexity.
method Compressive learning approach to ICA model, proving existence of compressive ICA scheme, proposing two algorithms (IPG and ASD).
result Proposed algorithms achieve substantial memory gains over well-known ICA algorithms.
ICA accurately estimates treatment effects even with confounders.
problem Estimating treatment effects in the presence of confounding variables.
method Uses Independent Component Analysis (ICA) to identify latent sources and estimate mixing coefficients.
result Linear ICA can consistently estimate multiple treatment effects, even with Gaussian confounders, and is more sample-efficient than Orthogonal Machine Learning (OML).
Independent component analysis (ICA) is a powerful method for blind source separation based on the assumption that sources are statistically independent. Though ICA has proven useful and has been employed in many applications, complete statistical independence can be too restrictive an assumption in practice. Additiona…
New model combines ICA and HMM for unsupervised learning of nonstationary time series.
problem Manual segmentation of non-stationary data is computationally expensive and inaccurate.
method Combines Hidden Markov Model with nonlinear ICA for unsupervised learning.
result Proves identifiability of the model for general mixing nonlinearity.
Algorithm learns affine transformations robustly from corrupted samples.
problem Learning affine transformations from corrupted samples.
method New geometric certificate and iterative improvement method.
result Total variation distance of between learned and original distributions.
Independent component analysis (ICA) has become a standard data analysis technique applied to an array of problems in signal processing and machine learning. This tutorial provides an introduction to ICA based on linear algebra formulating an intuition for ICA from first principles. The goal of this tutorial is to prov…
Independent Component Analysis (ICA) - one of the basic tools in data analysis - aims to find a coordinate system in which the components of the data are independent. Most popular ICA methods use kurtosis as a metric of non-Gaussianity to maximize, such as FastICA and JADE. However, their assumption of fourth-order mom…
This paper reviews nonlinear ICA for disentangled representations in unsupervised learning.
problem Finding useful disentangled representations in unsupervised deep learning.
method Review of nonlinear ICA theory and algorithms for disentanglement.
result Nonlinear ICA can be shown to estimate useful disentangled representations.
New ICA method for sources with mixed spectra.
problem Inaccurate separation of sources with temporal autocorrelations and mixed spectra.
method Estimates spectral density functions and line spectra using cubic splines and indicator functions, then maximizes the Whittle likelihood function.
result Outperforms existing ICA methods in simulations and EEG data applications.
New framework for identifying spatial data components using TP latent components.
problem Identifying complex dependencies in spatial data.
method Introduces a new nonlinear ICA framework with -process latent components and develops a learning and inference algorithm.
result Identifiability of TP independent components under general conditions and Gaussian Process limit.
Second-order Approximation of Minimum Discrimination Information in Independent Component Analysisstat.ML
A new method improves ICA performance by approximating MDI.
problem Improving F astICA's performance with nonlinear functions.
method Second-order approximation of MDI for joint maximization.
result Efficiency validated through experiments compared to other ICA algorithms.
New methods generalize nonlinear ICA beyond structural sparsity.
problem Identify true latent sources from nonlinear mixtures without structural sparsity assumptions.
method Propose identifiability results for undercomplete, partial sparsity, and flexible grouping structures.
result Prove identifiability in general settings of undercompleteness, partial sparsity, and flexible grouping structures.
Paper analyzes online tensorial ICA convergence with stochastic approximation.
problem Online tensorial ICA convergence analysis.
method Stochastic approximation for nonconvex optimization.
result Sharp finite-sample error bound of .
We performed an empirical comparison of ICA and PCA algorithms by applying them on two simulated noisy time series with varying distribution parameters and level of noise. In general, ICA shows better results than PCA because it takes into account higher moments of data distribution. On the other hand, PCA remains quit…
New method identifies latent sources from nonlinear mixtures without auxiliary variables.
problem Identifying latent sources from nonlinear mixtures without additional information.
method Structural Sparsity assumptions on the mixing process.
result Latent sources can be identified up to permutation and transformation.
Independent component analysis (ICA) is a widely used BSS method that can uniquely achieve source recovery, subject to only scaling and permutation ambiguities, through the assumption of statistical independence on the part of the latent sources. Independent vector analysis (IVA) extends the applicability of ICA by joi…
Independent Component Analysis (ICA) is a dimensionality reduction technique that can boost efficiency of machine learning models that deal with probability density functions, e.g. Bayesian neural networks. Algorithms that implement adaptive ICA converge slower than their nonadaptive counterparts, however, they are cap…
New theory allows ICA without assuming non-Gaussian sources.
problem Traditional ICA struggles with Gaussian sources.
method Developed identifiability theory based on second-order statistics and sparsity.
result Identifiability theory and estimation methods validated experimentally.
This paper is an attempt to separate cardiac and respiratory signals from an electrical bio-impedance (EBI) dataset. For this two well-known algorithms, namely Principal Component Analysis (PCA) and Independent Component Analysis (ICA), were used to accomplish the task. The ability of the PCA and the ICA methods first …
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 challen…
Reservoir subspace injection improves online ICA by preserving injected features.
problem Discarding injected features in top- whitening can degrade performance.
method Formalized reservoir subspace injection (RSI) and developed diagnostics (IER, SSO, ρ_x) to identify and mitigate the failure mode.
result RSI controller preserves passthrough retention, improving performance by up to 2.2 dB.
New model improves transfer learning and semi-supervised learning.
problem Improving transfer learning and semi-supervised learning performance.
method Developed a new conditional energy-based model (ICE-BeeM) based on nonlinear ICA.
result Identifiable representations learned by ICE-BeeM improve performance in transfer learning and semi-supervised learning tasks.
Independent Component Analysis (ICA) is the problem of learning a square matrix , given samples of , where is a random vector with independent coordinates. Most existing algorithms are provably efficient only when each has finite and moderately valued fourth moment. However, there are practical appli…
The FastICA algorithm is one of the most popular iterative algorithms in the domain of linear independent component analysis. Despite its success, it is observed that FastICA occasionally yields outcomes that do not correspond to any true solutions (known as demixing vectors) of the ICA problem. These outcomes are comm…
Independent Component Analysis (ICA) - one of the basic tools in data analysis - aims to find a coordinate system in which the components of the data are independent. In this paper we present Multiple-weighted Independent Component Analysis (MWeICA) algorithm, a new ICA method which is based on approximate diagonalizat…
In this paper we show that very large mixtures of Gaussians are efficiently learnable in high dimension. More precisely, we prove that a mixture with known identical covariance matrices whose number of components is a polynomial of any fixed degree in the dimension n is polynomially learnable as long as a certain non-d…
We consider moment matching techniques for estimation in Latent Dirichlet Allocation (LDA). By drawing explicit links between LDA and discrete versions of independent component analysis (ICA), we first derive a new set of cumulant-based tensors, with an improved sample complexity. Moreover, we reuse standard ICA techni…