Fetching the paper…
Reading the bibliography…
Although simple individually, artificial neurons provide state-of-the-art performance when interconnected in deep networks.
W. R. Thompson, “On the likelihood that one unknown probability exceeds another in view of the evidence of two samples,” Biometrika , vol. 25, no. 3/4, pp. 285–294, 1933
1933
Earlier work this paper cites.
J. Von Neumann and O. Morgenstern, Theory of Games and Economic Behavior , 1947
1947
Earlier work this paper cites.
H. Robbins, “Some aspects of the sequential design of experiments,” Bulletin of the American Mathematical Society , 1952
1952
Earlier work this paper cites.
M. L. Tsetlin, “On behaviour of finite automata in random medium,” Avtomat. i Telemekh , vol. 22, no. 10, pp. 1345–1354, 1961
1961
Earlier work this paper cites.
V. U. Krylov and M. Tsetlin, “Games Between Automata,” Automation and Remote Control , vol. 24, pp. 889–899, 1963
1963
Earlier work this paper cites.
V. A. Borovikov and V. I. Bryzgalov, “The Simplest Symmetric Game of Many Automata,” Avtomatika i Telemekhanika , vol. 26, pp. 637–687, 1965
1965
Earlier work this paper cites.
V. A. Volkonskii, “Asymptotic Properties of the Behavior of Elementary Automata in a Game,” Problemy Peredachi Informatsii , vol. 1, pp. 36–53, 1965
1965
Earlier work this paper cites.
B. G. Pittel, “The Asymptotic Properties of One Form of Goore Game,” Problemy Peredachi Informatsii , vol. 1, pp. 99–112, 1965
1965
Earlier work this paper cites.
K. S. Narendra, “Competitive and cooperative games of variable-structure stochastic automata,” Journal of Cybernetics , vol. 3, no. 1, pp. 1–23, 1973
1973
Earlier work this paper cites.
R. Viswanathan and K. S. Narendra, “Games of stochastic automata,” IEEE Transactions on Systems, Man, and Cybernetics , vol. SMC-4, no. 1, pp. 131–135, 1974
1974
Earlier work this paper cites.
J. Gittins, “Bandit processes and dynamic allocation indices,” Journal of the Royal Statistical Society, Series B (Methodological) , vol. 41, no. 2, pp. 148–177, 1979
1979
Earlier work this paper cites.
L. G. Valiant, “A Theory of the Learnable,” Communications of the ACM , vol. 27, no. 11, pp. 1134–1142, 1984
1984
Earlier work this paper cites.
A. G. Barto and P. Anandan, “Pattern-recognizing stochastic learning automata,” IEEE Transactions on Systems, Man, and Cybernetics , vol. 15, no. 3, pp. 360–375, 1985
1985
Earlier work this paper cites.
B. J. Oommen and D. C. Ma, “Deterministic Learning Automata Solutions to The Equipartitioning Problem,” IEEE Transactions on Computers , vol. 37, no. 1, pp. 2–13, 1988
1988
Earlier work this paper cites.
K. S. Narendra and M. A. L. Thathachar, Learning Automata: An Introduction . Prentice-Hall, Inc., 1989
1989
Earlier work this paper cites.
J. Carroll, Theory of Finite Automata With an Introduction to Formal Languages . Prentice Hall, 1989
1989
Earlier work this paper cites.
B. Tung and L. Kleinrock, “Using Finite State Automata to Produce Self-Optimization and Self-Control,” IEEE Transactions on Parallel and Distributed Systems , vol. 7, no. 4, pp. 47–61, 1996
1996
Earlier work this paper cites.
D. Monderer and L. Shapley, “Potential games,” Games and Economic Behavior , vol. 14, no. 1, pp. 124–143, 1996. [Online]. Available: https://EconPapers.repec.org/RePEc:eee:gamebe:v:14:y:1996:i:1:p:124-143
1996
Cited alongside, same era.
B. J. Oommen, “Stochastic Searching on the Line and its Applications to Parameter Learning in Nonlinear Optimization,” IEEE Transactions on Systems, Man, and Cybernetics, Part B , vol. 27, no. 4, pp. 733–739, 1997
1997
Cited alongside, same era.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278 – 2324, 1998
1998
Cited alongside, same era.
P. Sastry and M. Thathachar, “Learning automata algorithms for pattern classification,” Sadhana , vol. 24, no. 4-5, pp. 261–292, 1999
1999
Cited alongside, same era.
B. C. May, N. Korda, A. Lee, and D. S. Leslie, “Optimistic Bayesian sampling in contextual-bandit problems,” Journal of Machine Learning Research , vol. 13, pp. 2069–2106, 2012
2012
Later among the works it cites.
O.-C. Granmo and S. Glimsdal, “Accelerated Bayesian learning for decentralized two-armed bandit based decision making with applications to the Goore Game,” Applied Intelligence , vol. 38, no. 4, 2013
2013
Later among the works it cites.
L. Wan, M. Zeiler, S. Zhang, Y. LeCun, and R. Fergus, “Regularization of neural networks using dropconnect,” International Conference on Machine Learning (ICML) , 2013
2013
Later among the works it cites.
V. Haugland, M. Kjølleberg, S.-E. Larsen, and O.-C. Granmo, “A two-armed bandit collective for hierarchical examplar based mining of frequent itemsets with applications to intrusion detection,” Transactions on Computational Collective Intelligence XIV , vol. 8615, pp. 1–19, 2014
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2000
Cited alongside, same era.
P. Auer, “Using confidence bounds for exploitation-exploration trade-offs,” in Journal of Machine Learning Research , vol. 3, no. 3, 2003, pp. 397–422
2003
Cited alongside, same era.
M. A. L. Thathachar and P. S. Sastry, Networks of Learning Automata: Techniques for Online Stochastic Optimization . Kluwer Academic Publishers, 2004
2004
Cited alongside, same era.
G. E. Hinton, S. Osindero, and Y.-W. Teh, “A Fast Learning Algorithm for Deep Belief Nets,” Neural Computation , vol. 18, no. 7, pp. 1527 – 1554, 2006
2006
Cited alongside, same era.
B. J. Oommen, S. Misra, and O.-C. Granmo, “Routing bandwidth-guaranteed paths in MPLS traffic engineering: a multiple race track learning approach,” Computers, IEEE Transactions on , vol. 56, no. 7, pp. 959–976, 2007
2007
Cited alongside, same era.
O.-C. Granmo, B. J. Oommen, S. A. Myrer, and M. G. Olsen, “Learning Automata-based Solutions to the Nonlinear Fractional Knapsack Problem withApplications to Optimal Resource Allocation,” IEEE Transactions on Systems, Man, and Cybernetics, Part B , vol. 37, no. 1, pp. 166–175, 2007
2007
Cited alongside, same era.
O.-C. Granmo, B. J. Oommen, S. A. Myrer, and M. G. Olsen, “Learning Automata-based Solutions to the Nonlinear Fractional Knapsack Problem with Applications to Optimal Resource Allocation,” IEEE Transactions on Systems, Man, and Cybernetics, Part B , vol. 37, no. 1, pp. 166–175, 2007
2007
Cited alongside, same era.
S.-H. Zahiri, “Learning automata based classifier,” Pattern Recognition Letters , vol. 29, no. 1, pp. 40–48, 2008
2008
Cited alongside, same era.
Y. Lecun, Y. Bengio, and G. Hinton, “Deep learning,” pp. 436–444, 2015
2015
Later among the works it cites.
J. Schmidhuber, “Deep Learning in neural networks: An overview,” Neural Networks , vol. 61, pp. 85–117, 2015
2015
Later among the works it cites.
M. Goodwin, A. Yazidi, and T. M. Jonassen, “Distributed learning automata for solving a classification task,” in 2016 IEEE congress on evolutionary computation (CEC) . IEEE, 2016, pp. 3999–4006
2016
Later among the works it cites.
J. Zhang, Y. Wang, C. Wang, and M. Zhou, “Symmetrical Hierarchical Stochastic Searching on the Line in Informative and Deceptive Environments,” IEEE Transactions on Cybernetics , vol. 47, no. 3, pp. 626 – 635, jul 2016
2016
Later among the works it cites.
Guolong Su, Kush R. Varshney, and Dmitry M. Malioutov, “Interpretable Two-Level Boolean Rule Learning for Classification,” in ICML Workshop on Human Interpretability in Machine Learning (WHI 2016) , 2016, pp. 66–70
2016
Later among the works it cites.
H. Motieghader, A. Najafi, B. Sadeghi, and A. Masoudi-Nejad, “A hybrid gene selection algorithm for microarray cancer classification using genetic algorithm and learning automata,” Informatics in Medicine Unlocked , vol. 9, pp. 246–254, 2017
2017
Later among the works it cites.
T. Wang, C. Rudin, F. Doshi-Velez, Y. Liu, E. Jones, E. Klampfl, P. Macneille, and M. Gupta, “A Bayesian Framework for Learning Rule Sets for Interpretable Classification,” Journal of Machine Learning Research , 2017
2017
Later among the works it cites.
M. Ghavipour and M. R. Meybodi, “A streaming sampling algorithm for social activity networks using fixed structure learning automata,” Applied Intelligence , 2018
2018
Closest in time.
A. Yazidi and B. John Oommen, “On the analysis of a random walk-jump chain with tree-based transitions and its applications to faulty dichotomous search,” Sequential Analysis , vol. 37, pp. 31–46, jan 2018
2018
Closest in time.
O.-C. Granmo, “The Fully Connected Deep Tsetlin Machine,” In Preparation , 2019
2019
Closest in time.
O.-C. Granmo, “The Convolutional Tsetlin Machine,” In Preparation , 2019
2019
Closest in time.
——, “The Recurrent Tsetlin Machine,” In Preparation , 2019
2019
Closest in time.