Nearest Neighbor Representations of Neural Circuits (2402.08751v2)
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.
- “On the complexity of depth-2 circuits with threshold gates” In International Symposium on Mathematical Foundations of Computer Science, 2005, pp. 107–118 Springer
- Richard Beigel “Perceptrons, PP, and the polynomial hierarchy” In Computational complexity 4 Springer, 1994, pp. 339–349
- Jehoshua Bruck “Harmonic analysis of polynomial threshold functions” In SIAM Journal on Discrete Mathematics 3.2 SIAM, 1990, pp. 168–177
- “Lower Bounds for Linear Decision Lists” In Chic. J. Theor. Comput. Sci. 2020, 2019 URL: https://api.semanticscholar.org/CorpusID:58014125
- “A short list of equalities induces large sign rank” In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, pp. 47–58 IEEE
- “Linear threshold functions in decision lists, decision trees, and depth-2 circuits” In Information Processing Letters 183, 2024, pp. 106418 DOI: https://doi.org/10.1016/j.ipl.2023.106418
- Jürgen Forster “A linear lower bound on the unbounded error probabilistic communication complexity” In Journal of Computer and System Sciences 65.4 Elsevier, 2002, pp. 612–625
- “Threshold circuits of bounded depth” In Journal of Computer and System Sciences 46.2 Elsevier, 1993, pp. 129–154
- Péter Hajnal, Zhihao Liu and György Turán “Nearest Neighbor Representations of Boolean Functions” In Information and Computation 285 Elsevier, 2022, pp. 104879
- Johan Håstad, Stasys Jukna and Pavel Pudlák “Top-down lower bounds for depth-three circuits” In Computational Complexity 5.2 Springer, 1995, pp. 99–112
- John Håstad “Almost optimal lower bounds for small depth circuits” In Proceedings of the eighteenth annual ACM symposium on Theory of computing, 1986, pp. 6–20
- “Communication complexity with synchronized clocks” In 2010 IEEE 25th Annual Conference on Computational Complexity, 2010, pp. 259–269 IEEE
- William H Kautz “The realization of symmetric switching functions with linear-input logical elements” In IRE Transactions on Electronic Computers IEEE, 1961, pp. 371–378
- Kordag Mehmet Kilic and Jehoshua Bruck “Neural Network Computations with DOMINATION Functions” In 2021 IEEE International Symposium on Information Theory (ISIT), 2021, pp. 1029–1034 IEEE DOI: 10.1109/ISIT45174.2021.9517872
- Kordag Mehmet Kilic, Jin Sima and Jehoshua Bruck “On algebraic constructions of neural networks with small weights” In 2022 IEEE International Symposium on Information Theory (ISIT), 2022, pp. 3007–3012 IEEE DOI: 10.1109/ISIT50566.2022.9834401
- Kordag Mehmet Kilic, Jin Sima and Jehoshua Bruck “On the Information Capacity of Nearest Neighbor Representations” In 2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp. 1663–1668 DOI: 10.1109/ISIT54713.2023.10206832
- Ramamohan Paturi and Michael E Saks “On threshold circuits for parity” In Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 397–404 IEEE
- Vwani P Roychowdhury, Alon Orlitsky and Kai-Yeung Siu “Lower bounds on threshold and related circuits via communication complexity” In IEEE Transactions on Information Theory 40.2 IEEE, 1994, pp. 467–474
- Kai-Yeung Siu, Vwani P. Roychowdhury and Thomas Kailath “Depth-size tradeoffs for neural computation” In IEEE Transactions on Computers 40.12 IEEE Computer Society, 1991, pp. 1402–1412
- Larry J Stockmeyer “On the combinational complexity of certain symmetric Boolean functions” In Mathematical Systems Theory 10.1 Springer, 1976, pp. 323–336
- “Linear decision lists and partitioning algorithms for the construction of neural networks” In Foundations of Computational Mathematics: Selected Papers of a Conference Held at Rio de Janeiro, January 1997, 1997, pp. 414–423 Springer
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.