mlsanityData to 14 Oct 2026

Blind Bounded Source Separation Using Neural Networks with Local Learning Rules

arXiv 2004.05479 ↗First posted 11 Apr 2020eess.SP cs.NE q-bio.NCcited by 4

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

Cited by year (2026 to 14 Oct)

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

4 papers.