no code implementations • 14 May 2024 • Jesus Garcia Fernandez, Sander Keemink, Marcel van Gerven
To this end, we extend the recently introduced activity-based node perturbation (ANP) method to operate in the time domain, leading to more efficient learning and generalization.
1 code implementation • NeurIPS 2020 • Allan Mancoo, Sander Keemink, Christian K. Machens
Here we turn these findings around and show that virtually all inhibition-dominated SNNs can be understood through the lens of convex optimization, with network connectivity, timescales, and firing thresholds being intricately linked to the parameters of underlying convex optimization problems.