On the influence of synaptic weight states in a locally competitive algorithm for memristive hardware

Proceedings of the 2014 IEEE/ACM International Symposium on Nanoscale Architectures, NANOARCH 2014

Volumn , Issue , 2014, Pages 19-24

  Woods, Walt ^a   Burger, Jens ^a   Teuscher, Christof ^a  

^a Portland State University   (United States)

Author keywords

LCA; memristive devices; MNIST; neu romorphic computing; switching characteristics

Indexed keywords

HARDWARE; LEARNING ALGORITHMS; LIFE CYCLE; NANOTECHNOLOGY; PASSIVE FILTERS;

LCA; MEMRISTIVE DEVICES; MNIST; NEU-ROMORPHIC COMPUTING; SWITCHING CHARACTERISTICS;

MEMRISTORS;

EID: 84906737456     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NANOARCH.2014.6880503     Document Type: Conference Paper

References (11)

1. D. Querlioz et al., " Bioinspired networks with nanoscale memristive devices that combine the unsupervised and supervised learning approaches," in Nanoscale Architectures (NANOARCH), 2012 IEEE/ACM International Symposium on, July 2012, pp. 203-210.
2. C. Zamarreñ o-Ramos et al., " On spike-timing-dependent- plasticity, memristive devices, and building a self-learning visual cortex," Frontiers in neuroscience, vol. 5, 2011.
3. S. H. Jo et al., "Nanoscale memristor device as synapse in neuromorphic systems, " Nano letters, vol. 10, pp. 1297-1301, 2010.
4. S. Gaba e t al., " Stochastic memristive devices for computing and neuromorphic applications," Nanoscale, vol. 5, pp. 5872-5878, 2013.
5. F. Alibart et al., "High precision tuning of state for memristive dev ices by adaptable variation-tolerant algorithm," Nanotechnology, vol. 23, p. 075201, 2012.
6. B. Rubin et al., " Long memory lifetimes require complex synapses and limited sparseness," vol. 1, pp. 1-14, 2007.
7. C. J. Rozell et al., " Sparse coding via thresholding and local competition in neural circuits," Neural computation, vol. 20, pp. 2526-2563, 2008.
8. R. Berdan et al., " Memristive devices as parameter setting elements in programmable gain amplifiers," Appl. Phys. Lett., vol. 101, p. 243502, 2012.
9. P. Schultz et al., "Replic ating kernels with a short stride allows sparse reconstructions with fewer independent kernels," 2014. [Online]. Available: http://arxiv.org/abs/1406.4205v1
10. Y. LeCun et al., "Gradient-based le arning applied to document recognition," in Intelligent Signal Processing. IEEE Press, 1998, pp. 306-351.
11. M. Driels et al., Determining the Number of Iterations for Mon te Carlo Simulations of Weapon Effectiveness. Naval Postgraduate School, 2004. [Online]. Available: http://books.google.com/books?id= 20KZNwAACAAJ