arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.12691cs.NE
收藏

使用Intel的Pohoiki Springs的神经形态最近邻搜索

Neuromorphic Nearest-Neighbor Search Using Intel's Pohoiki Springs

E. Paxon Frady, Garrick Orchard, David Florey, Nabil Imam, Ruokun Liu, Joyesh Mishra, Jonathan Tse, Andreas Wild, Friedrich T. Sommer, Mike Davies

摘要:

类脑计算应用神经科学的见解来揭示计算技术的创新。在大脑中,数十亿个相互连接的神经元通过利用传统计算系统所不具备的特性(例如时间尖峰代码和集成存储器和计算的精细并行处理单元)以极低的能量水平执行快速计算。在这里,我们展示了Pohoiki Springs神经形态系统,这是一个由768个相互连接的Loihi芯片组成的网络,它们在硅中共同实现了1亿个尖峰神经元。我们展示了一个可扩展的近似k-近邻(k-NN)算法搜索大型数据库,利用神经形态的原则。与最先进的传统基于CPU的实现相比,在包含超过100万个高维模式的几个标准数据集上进行评估时,我们实现了卓越的延迟,索引构建时间和能源效率。此外,该系统支持在O(1)时间内在线向索引数据库添加新数据点,这与所有常规k-NN实现不同。

英文摘要:

Neuromorphic computing applies insights from neuroscience to uncover innovations in computing technology. In the brain, billions of interconnected neurons perform rapid computations at extremely low energy levels by leveraging properties that are foreign to conventional computing systems, such as temporal spiking codes and finely parallelized processing units integrating both memory and computation. Here, we showcase the Pohoiki Springs neuromorphic system, a mesh of 768 interconnected Loihi chips that collectively implement 100 million spiking neurons in silicon. We demonstrate a scalable approximate k-nearest neighbor (k-NN) algorithm for searching large databases that exploits neuromorphic principles. Compared to state-of-the-art conventional CPU-based implementations, we achieve superior latency, index build time, and energy efficiency when evaluated on several standard datasets containing over 1 million high-dimensional patterns. Further, the system supports adding new data points to the indexed database online in O(1) time unlike all but brute force conventional k-NN implementations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑