Markov Transitions between Attractor States in a Recurrent Neural Network
Lists
Only you see this
Abstract
Stochasticity is an essential part of explaining the world. Increasingly, neuroscientists and cognitive scientists are identifying mechanisms whereby the brain uses probabilistic reasoning in representational, predictive, and generative settings. But stochasticity is not always useful: robust perception and memory retrieval require representations that are immune to corruption by stochastic noise. In an effort to combine these robust representations with stochastic computation, we present an architecture that generalizes traditional recurrent attractor networks to follow probabilistic Markov dynamics between stable and noise-resistant fixed points.
BibTeX
@inproceedings{bernstein2017markov,
author = {Jeremy Bernstein and Ishita Dasgupta and David Rolnick and Haim Sompolinsky},
title = {{Markov Transitions between Attractor States in a Recurrent Neural Network}},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2017},
url = {https://openreview.net/forum?id=GWAIhJzPp9},
}Loading related content...