Nearest Neighbor Representations of Neural Circuits

February 13, 2024 ยท The Ethereal ยท ๐Ÿ› International Symposium on Information Theory

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Kordag Mehmet Kilic, Jin Sima, Jehoshua Bruck arXiv ID 2402.08751 Category cs.CC: Computational Complexity Cross-listed cs.DM, cs.LG, cs.NE Citations 0 Venue International Symposium on Information Theory Last Checked 3 months ago
Abstract
Neural networks successfully capture the computational power of the human brain for many tasks. Similarly inspired by the brain architecture, Nearest Neighbor (NN) representations is a novel approach of computation. We establish a firmer correspondence between NN representations and neural networks. Although it was known how to represent a single neuron using NN representations, there were no results even for small depth neural networks. Specifically, for depth-2 threshold circuits, we provide explicit constructions for their NN representation with an explicit bound on the number of bits to represent it. Example functions include NN representations of convex polytopes (AND of threshold gates), IP2, OR of threshold gates, and linear or exact decision lists.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Computational Complexity