A neural algorithm for a fundamental computing problem

DOI10.1101/180471zbMath1403.68184OpenAlexW2748551393WikidataQ46508121 ScholiaQ46508121MaRDI QIDQ4645996

Sanjoy Dasgupta, Saket Navlakha, Charles F. Stevens

Publication date: 11 January 2019

Full work available at URL: https://doi.org/10.1126/science.aam9868

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (11)

Bioinspired Random Projections for Robust, Sparse Classification ⋮ Habituation as a neural algorithm for online odor discrimination ⋮ Unifying Online and Offline Preference for Social Link Prediction ⋮ Binary random projections with controllable sparsity patterns ⋮ A basic compositional model for spiking neural networks ⋮ VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search ⋮ Sparsity through evolutionary pruning prevents neuronal networks from overfitting ⋮ GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions ⋮ Unnamed Item ⋮ Index structures for fast similarity search for real vectors. II ⋮ Data-Driven Reconstruction and Encoding of Sparse Stimuli across Convergent Sensory Layers from Downstream Neuronal Network Dynamics

This page was built for publication: A neural algorithm for a fundamental computing problem