Fetching the paper…
Reading the bibliography…
Neural networks have gained importance as the machine learning models that achieve state-of-the-art performance on large-scale image classification, object detection and natural language processing tasks.
J. Von Neumann, “Probabilistic logics and the synthesis of reliable organisms from unreliable components,” Automata studies , vol. 34, pp. 43–98, 1956
1956
Earlier work this paper cites.
R. L. Dobrushin, “Definition of random variables by conditional distributions,” Teoriya Veroyatnostei i ee Primeneniya , vol. 15, no. 3, pp. 469–497, 1970
1970
Earlier work this paper cites.
A. L. Toom, “Nonergodic multidimensional system of automata,” Problemy Peredachi Informatsii , vol. 10, no. 3, pp. 70–79, 1974
1974
Earlier work this paper cites.
R. Ahlswede and P. Gács, “Spreading of sets in product spaces and hypercontraction of the markov operator,” The annals of probability , pp. 925–939, 1976
1976
Earlier work this paper cites.
S. Wolfram, “Statistical mechanics of cellular automata,” Rev. Mod. Phys. , vol. 55, no. 3, p. 601, 1983
1983
Earlier work this paper cites.
M. Furst, J. B. Saxe, and M. Sipser, “Parity, circuits, and the polynomial-time hierarchy,” Mathematical systems theory , vol. 17, no. 1, pp. 13–27, 1984
1984
Earlier work this paper cites.
G. Grinstein, C. Jayaprakash, and Y. He, “Statistical mechanics of probabilistic cellular automata,” Phys. Rev. Lett. , vol. 55, no. 23, p. 2527, 1985
1985
Earlier work this paper cites.
J. T. Håstad, Computational limitations for small-depth circuits . MIT press, 1987
1987
Earlier work this paper cites.
N. Pippenger, “Reliable computation by formulas in the presence of noise,” IEEE Trans. Inf. Theory , vol. 34, no. 2, pp. 194–197, 1988
1988
Earlier work this paper cites.
P. Berman and J. Simon, “Investigations of fault-tolerant networks of computers,” in Proceedings of the twentieth annual ACM symposium on Theory of computing , 1988, pp. 66–77
1988
Earlier work this paper cites.
T. Feder, “Reliable computation by networks in the presence of noise,” IEEE Trans. Inf. Theory , vol. 35, no. 3, pp. 569–571, 1989
1989
Earlier work this paper cites.
A. M. Turing, “The chemical basis of morphogenesis,” Bull. Math. Biol. , vol. 52, no. 1-2, pp. 153–197, 1990
1990
Earlier work this paper cites.
W. S. Evans, Information theory and noisy computation . Citeseer, 1994, vol. 94, no. 57
1994
Cited alongside, same era.
W. Hoeffding, “Probability inequalities for sums of bounded random variables,” in The Collected Works of Wassily Hoeffding . Springer, 1994, pp. 409–426
1994
Cited alongside, same era.
R. Impagliazzo, R. Paturi, and M. E. Saks, “Size–depth tradeoffs for threshold circuits,” SIAM J. Comput. , vol. 26, no. 3, pp. 693–707, 1997
1997
Cited alongside, same era.
E. Erkip and T. M. Cover, “The efficiency of investment information,” IEEE Trans. Inf. Theory , vol. 44, no. 3, pp. 1026–1040, 1998
1998
Cited alongside, same era.
W. S. Evans and L. J. Schulman, “Signal propagation and noisy circuits,” IEEE Trans. Inf. Theory , vol. 45, no. 7, pp. 2367–2373, 1999
1999
Cited alongside, same era.
A. Fischer and C. Igel, “Training restricted boltzmann machines: An introduction,” Pattern Recognit. , vol. 47, no. 1, pp. 25–39, 2014
2014
Later among the works it cites.
Y. Shen, N. C. Harris, S. Skirlo, M. Prabhu, T. Baehr-Jones, M. Hochberg, X. Sun, S. Zhao, H. Larochelle, D. Englund et al. , “Deep learning with coherent nanophotonic circuits,” Nat. Photonics , vol. 11, no. 7, p. 441, 2017
2017
Later among the works it cites.
Y. Polyanskiy and Y. Wu, “Strong data-processing inequalities for channels and bayesian networks,” in Convexity and Concentration . Springer, 2017, pp. 211–249. [Online]. Available: http://people.lids.mit.edu/yp/homepage/data/simple-IMA.pdf
2017
Later among the works it cites.
H. W. Lin, M. Tegmark, and D. Rolnick, “Why does deep and cheap learning work so well?” J. Stat. Phys. , vol. 168, no. 6, pp. 1223–1247, 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. M. Cover, Elements of information theory . John Wiley & Sons, 1999
1999
Cited alongside, same era.
P. Gács, “Reliable cellular automata with self-organization,” J. Stat. Phys. , vol. 103, no. 1-2, pp. 45–267, 2001
2001
Cited alongside, same era.
L. F. Gray, “A reader’s guide to gacs’s “positive rates” paper,” J. Stat. Phys. , vol. 103, no. 1-2, pp. 1–44, 2001
2001
Cited alongside, same era.
M. Anthony, “Boolean functions and artificial neural networks,” Boolean Functions , vol. 2, 2003
2003
Cited alongside, same era.
T. M. Liggett, Interacting particle systems . Springer Science & Business Media, 2012, vol. 276
2012
Cited alongside, same era.
2013
Cited alongside, same era.
J. C. Duchi, M. I. Jordan, and M. J. Wainwright, “Local privacy and statistical minimax rates,” in 2013 IEEE 54th Annual Symposium on Foundations of Computer Science . IEEE, 2013, pp. 429–438
2013
Cited alongside, same era.
X. Lin, Y. Rivenson, N. T. Yardimci, M. Veli, Y. Luo, M. Jarrahi, and A. Ozcan, “All-optical machine learning using diffractive deep neural networks,” Science , vol. 361, no. 6406, pp. 1004–1008, 2018
2018
Later among the works it cites.
N. Semenova, X. Porte, L. Andreoli, M. Jacquot, L. Larger, and D. Brunner, “Fundamental aspects of noise in analog-hardware neural networks,” Chaos: An Interdisciplinary Journal of Nonlinear Science , vol. 29, no. 10, p. 103128, 2019
2019
Later among the works it cites.
L. Chen and R. Tell, “Bootstrapping results for threshold circuits “just beyond” known lower bounds,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , 2019, pp. 34–41
2019
Later among the works it cites.
P. Yao, H. Wu, B. Gao, J. Tang, Q. Zhang, W. Zhang, J. J. Yang, and H. Qian, “Fully hardware-implemented memristor convolutional neural network,” Nature , vol. 577, no. 7792, pp. 641–646, 2020
2020
Later among the works it cites.
O. I. Rumyantsev, J. A. Lecoq, O. Hernandez, Y. Zhang, J. Savall, R. Chrapkiewicz, J. Li, H. Zeng, S. Ganguli, and M. J. Schnitzer, “Fundamental bounds on the fidelity of sensory cortical coding,” Nature , vol. 580, no. 7801, pp. 100–105, 2020
2020
Later among the works it cites.
N. Y. Yao, C. Nayak, L. Balents, and M. P. Zaletel, “Classical discrete time crystals,” Nat. Phys. , vol. 16, no. 4, pp. 438–447, 2020
2020
Later among the works it cites.