arXiv Machine Learning By Song Liu

Self-sufficient Independent Component Analysis for Demixing Flows

Read the original on arXiv Machine Learning →

The paper introduces a method for learning disentangled signals via non‑linear Independent Component Analysis (ICA) by defining self‑sufficient signals, where the conditional distribution of a missing value given the rest remains unchanged when other signals are observed. It formulates this as a conditional KL divergence minimization and proposes a sequential, prior‑free, likelihood‑free algorithm that learns a demixing flow model at each iteration. The authors provide theoretical guarantees of local descent for an idealized Wasserstein‑gradient‑flow variant and demonstrate the method’s effectiveness on toy and real‑world datasets.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Jul 15

Linear Independent Component Analysis via Optimal Transport

Linear Independent Component Analysis (ICA) recovers jointly independent source signals from their linear mixtures. To achieve this, classical ICA algorithms attempt to maximize non-Gaussianity, measured by negentropy, which is linked to independence by information theory.

Hugging Face Trending Papers
Jun 3

RePercENT: Scaling Disentangled Representation Learning Beyond Two Modalities

To leverage the full potential of multimodal data, we need representations that go beyond the state-of-the-art alignment and fusion approaches and exploit all cross-modal interactions without sacrificing modality-specific information. Learning disentangled representations is a principled way to identify these underlying shared and unique factors that are hidden in observational data.

Hugging Face Trending Papers
Jun 29

Simplifying Flow Matching Transformations with Low-Rank Mixture Models

Normalizing flows are powerful generative models that learn an invertible mapping between complex data distributions and simple latent distributions, typically a standard normal density. However, this choice of latent density can impose unnecessary complexity on the learned flow transformation due to the topological mismatch between the latent and data densities, leading to slower training and suboptimal performance.