Efficient Associative Computation with Discrete Synapses

DOI10.1162/NECO_A_00795zbMATH Open1472.92026OpenAlexW2180007725WikidataQ50547926 ScholiaQ50547926MaRDI QIDQ5380385FDOQ5380385

Authors: Andreas Knoblauch 

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

Recommendations

• scientific article; zbMATH DE number 761425
• Computing with discrete multi-valued neurons
• On discrete-time cellular neural networks for associative memories
• scientific article; zbMATH DE number 615129
• On the computational power of discrete Hopfield nets
• A computationally efficient abstraction of long-term potentiation
• On the computational power of circuits of spiking neurons
• scientific article; zbMATH DE number 1300101

Mathematics Subject Classification ID

Neural networks for/in biological studies, artificial life and related topics (92B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Neural networks and physical systems with emergent collective computational abilities
• Title not available (Why is that?)
• On associative memory
• A Method for the Construction of Minimum-Redundancy Codes
• Run-length encodings (Corresp.)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Capacity and information efficiency of the associative net
• The existence of persistent states in the brain
• Optimising synaptic learning rules in linear associative memories
• Neural associative memory with optimal Bayesian learning
• Die Lernmatrix
• Neural Associative Memory and the Willshaw–Palm Probability Distribution
• Information storage in sparsely coded memory nets
• Memory Capacities for Synaptic and Structural Plasticity
• Neural associative memory for brain modeling and information retrieval
• Can programming be liberated from the von Neumann style?
• The space of interactions in neural network models
• Capacity of neural networks with discrete synaptic couplings
• A model of cortical associative memory based on a horizontal network of connected columns
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inhomogeneities in Heteroassociative Memories with Linear Learning Rules
• Imposing Biological Constraints onto an Abstract Neocortical Attractor Network Model
• Associative memory: on the (puzzling) sparse coding limit
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective neuronal learning with ineffective Hebbian learning rules
• A familiarity discrimination algorithm inspired by computations of the perirhinal cortex

Cited In (9)

• GXNOR-Net: training deep neural networks with ternary weights and activations without full-precision memory under a unified discretization framework
• Multiassociative memory: recurrent synapses increase storage capacity
• Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory
• Robust exponential memory in Hopfield networks
• Neural associative memory with optimal Bayesian learning
• Memorization and Association on a Realistic Neural Model
• Storing object-dependent sparse codes in a Willshaw associative network
• Iterative retrieval and block coding in autoassociative and heteroassociative memory
• Neural Associative Memory and the Willshaw–Palm Probability Distribution

This page was built for publication: Efficient Associative Computation with Discrete Synapses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380385)