Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits
From MaRDI portal
Publication:5214411
DOI10.1162/neco_a_01242zbMath1429.92026arXiv1904.10399OpenAlexW2981139958WikidataQ90718196 ScholiaQ90718196MaRDI QIDQ5214411
Chia-Jung Chang, Lili Su, Nancy A. Lynch
Publication date: 7 February 2020
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.10399
Related Items
Learning hierarchically-structured concepts ⋮ A basic compositional model for spiking neural networks
Cites Work
- Unnamed Item
- A class of finite-time dual neural networks for solving quadratic programming problems and its \(k\)-winners-take-all application
- Emergence of attention within a neural population
- The Scaling of Winner-Takes-All Accuracy with Population Size
- Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks
- Computing with Spikes: The Advantage of Fine-Grained Timing
- A simple model for low variability in neural spike trains
- Memory Capacities for Synaptic and Structural Plasticity