Nonlinear Independent Component Analysis for Principled Disentanglement in Unsupervised Deep Learning

Aapo Hyvarinen, Ilyes Khemakhem, Hiroshi Morioka
3/29/2023
cs.LGstat.ML

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

A central problem in unsupervised deep learning is how to find useful representations of high-dimensional data, sometimes called "disentanglement". Most approaches are heuristic and lack a proper theoretical foundation. In linear representation learning, independent component analysis (ICA) has been successful in many applications areas, and it is principled, i.e., based on a well-defined probabilistic model. However, extension of ICA to the nonlinear case has been problematic due to the lack of identifiability, i.e., uniqueness of the representation. Recently, nonlinear extensions that utilize temporal structure or some auxiliary information have been proposed. Such models are in fact identifiable, and consequently, an increasing number of algorithms have been developed. In particular, some self-supervised algorithms can be shown to estimate nonlinear ICA, even though they have initially been proposed from heuristic perspectives. This paper reviews the state-of-the-art of nonlinear ICA theory and algorithms.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hyvarinen2023nonlinear,
  title  = {Nonlinear Independent Component Analysis for Principled Disentanglement in Unsupervised Deep Learning},
  author = {Aapo Hyvarinen and Ilyes Khemakhem and Hiroshi Morioka},
  year   = {2023},
  eprint = {2303.16535},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.16535v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.16535.svg)](https://codeofpaper.com/paper/2303.16535)

Discussion