Efficient Associative Computation with Discrete Synapses
From MaRDI portal
Publication:5380385
DOI10.1162/NECO_a_00795zbMath1472.92026OpenAlexW2180007725WikidataQ50547926 ScholiaQ50547926MaRDI QIDQ5380385
Publication date: 4 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_00795
Related Items (5)
GXNOR-Net: training deep neural networks with ternary weights and activations without full-precision memory under a unified discretization framework ⋮ Storing Object-Dependent Sparse Codes in a Willshaw Associative Network ⋮ Iterative Retrieval and Block Coding in Autoassociative and Heteroassociative Memory ⋮ Multiassociative Memory: Recurrent Synapses Increase Storage Capacity ⋮ Robust exponential memory in Hopfield networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Neural associative memory for brain modeling and information retrieval
- On associative memory
- Optimising synaptic learning rules in linear associative memories
- The existence of persistent states in the brain
- Effective Neuronal Learning with Ineffective Hebbian Learning Rules
- Neural Associative Memory with Optimal Bayesian Learning
- Die Lernmatrix
- Capacity of neural networks with discrete synaptic couplings
- Neural Associative Memory and the Willshaw–Palm Probability Distribution
- Information storage in sparsely coded memory nets
- Can programming be liberated from the von Neumann style?
- A model of cortical associative memory based on a horizontal network of connected columns
- Capacity and information efficiency of the associative net
- Memory Capacities for Synaptic and Structural Plasticity
- Neural networks and physical systems with emergent collective computational abilities.
- The space of interactions in neural network models
- Inhomogeneities in Heteroassociative Memories with Linear Learning Rules
- Imposing Biological Constraints onto an Abstract Neocortical Attractor Network Model
- A Method for the Construction of Minimum-Redundancy Codes
- Run-length encodings (Corresp.)
- Associative memory: on the (puzzling) sparse coding limit
This page was built for publication: Efficient Associative Computation with Discrete Synapses