神经元的最近邻表示
Nearest Neighbor Representations of Neurons
AI总结:
本文研究阈值函数的最近邻表示中锚点数量与分辨率的权衡,证明三个经典函数可用多项式数量锚点换取O(log n)分辨率,并猜想该结论适用于所有阈值函数。
摘要:
最近邻(NN)表示是一种受大脑启发的新兴计算模型。我们研究使用NN表示来表示一个神经元(阈值函数)的复杂度。已知两个锚点(即计算NN时所参照的点)就足以构成一个阈值函数的NN表示,然而,其分辨率(一个锚点各元素所需的最大比特数)为O(n log n)。在本工作中,我们研究阈值函数的NN表示中锚点数量与分辨率之间的权衡。我们证明,著名的阈值函数EQUALITY、COMPARISON和ODD-MAX-BIT原本需要2或3个锚点以及O(n)的分辨率,却可以用n的多项式数量级的锚点和O(log n)的分辨率来表示。我们猜想,对于所有阈值函数,都存在规模为多项式大、且在n上具有对数分辨率的NN表示。
英文摘要:
The Nearest Neighbor (NN) Representation is an emerging computational model that is inspired by the brain. We study the complexity of representing a neuron (threshold function) using the NN representations. It is known that two anchors (the points to which NN is computed) are sufficient for a NN representation of a threshold function, however, the resolution (the maximum number of bits required for the entries of an anchor) is $O(n\log{n})$. In this work, the trade-off between the number of anchors and the resolution of a NN representation of threshold functions is investigated. We prove that the well-known threshold functions EQUALITY, COMPARISON, and ODD-MAX-BIT, which require 2 or 3 anchors and resolution of $O(n)$, can be represented by polynomially large number of anchors in $n$ and $O(\log{n})$ resolution. We conjecture that for all threshold functions, there are NN representations with polynomially large size and logarithmic resolution in $n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。