We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2004.05479")
get_code_for_paper("2004.05479")
have("2004.05479")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2004.05479.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2004.05479)
Connect an agent — have() is free.