Blind Bounded Source Separation Using Neural Networks with Local Learning Rules
Not on the map. Why?
Abstract (arXiv)
An important problem encountered by both natural and engineered signal processing systems is blind source separation. In many instances of the problem, the sources are bounded by their nature and known to be so, even though the particular bound may not be known. To separate such bounded sources from their mixtures, we propose a new optimization problem, Bounded Similarity Matching (BSM). A principled derivation of an adaptive BSM algorithm leads to a recurrent neural network with a clipping nonlinearity. The network adapts by local learning rules, satisfying an important constraint for both biological plausibility and implementability in neuromorphic hardware.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 0; 2025: 0; 2026: 1.
4 papers.
- 2021A Normative and Biologically Plausible Algorithm for Independent Component Analysiscited by 8
- 2022Biologically-Plausible Determinant Maximization Neural Networks for Blind Separation of Correlated Sourcescited by 6
- 2022Correlative Information Maximization Based Biologically Plausible Neural Networks for Correlated Source Separationcited by 3
- 2026Normative Networks for Source Separation via Local Plasticity and Dendritic Computationcited by 0
- 2026Normative Networks for Source Separation via Local Plasticity and Dendritic Computation19 May 2026
- 2022Correlative Information Maximization Based Biologically Plausible Neural Networks for Correlated Source Separation9 Oct 2022
- 2022Biologically-Plausible Determinant Maximization Neural Networks for Blind Separation of Correlated Sources27 Sep 2022
- 2021A Normative and Biologically Plausible Algorithm for Independent Component Analysis17 Nov 2021