mlsanityData to 7 Oct 2026

Correlative Information Maximization Based Biologically Plausible Neural Networks for Correlated Source Separation

arXiv 2210.04222 ↗First posted 9 Oct 2022eess.SP cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

The brain effortlessly extracts latent causes of stimuli, but how it does this at the network level remains unknown. Most prior attempts at this problem proposed neural networks that implement independent component analysis which works under the limitation that latent causes are mutually independent. Here, we relax this limitation and propose a biologically plausible neural network that extracts correlated latent sources by exploiting information about their domains. To derive this network, we choose maximum correlative information transfer from inputs to outputs as the separation objective under the constraint that the outputs are restricted to their presumed sets. The online formulation of this optimization problem naturally leads to neural networks with local learning rules. Our framework incorporates infinitely many source domain choices and flexibly models complex latent structures. Choices of simplex or polytopic source domains result in networks with piecewise-linear activation functions. We provide numerical examples to demonstrate the superior correlated source separation capability for both synthetic and natural sources.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 16 of its 48 references that are in the map. First posted on arXiv 9 Oct 2022.

Builds on

16 of 48 references.

References · 16

  1. 2020On Disentangled Representations Learned From Correlated Datacited by 94
  2. 2018Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applicationscited by 55
  3. 2022Self-Supervised Learning with an Information Maximization Criterioncited by 38
  4. 2017On Identifiability of Nonnegative Matrix Factorizationcited by 34
  5. 2016Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clusteringcited by 28
  6. 2014Identifiability of the Simplex Volume Minimization Criterion for Blind Hyperspectral Unmixing: The No Pure-Pixel Casecited by 26
  7. 2020Simplex-Structured Matrix Factorization: Sparsity-based Identifiability and Provably Correct Algorithmscited by 21
  8. 2017Why do similarity matching objectives lead to Hebbian/anti-Hebbian networks?cited by 20
  9. 2022Polytopic Matrix Factorization: Determinant Maximization Based Criterion and Identifiabilitycited by 14
  10. 2017Blind nonnegative source separation using biological neural networkscited by 11
  11. 2020Biologically plausible single-layer networks for nonnegative independent component analysiscited by 8
  12. 2021A Normative and Biologically Plausible Algorithm for Independent Component Analysiscited by 8
4 more
  1. 2022An Information Maximization Based Blind Source Separation Approach for Dependent and Independent Sourcescited by 7
  2. 2022Biologically-Plausible Determinant Maximization Neural Networks for Blind Separation of Correlated Sourcescited by 6
  3. 2020Blind Bounded Source Separation Using Neural Networks with Local Learning Rulescited by 4
  4. 2022On Identifiable Polytope Characterization for Polytopic Matrix Factorizationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 2.

3 papers.