Competing neural networks: Finding a strategy for the game of matching pennies
I. Samengo, D. H. Zanette
Abstract
The ability of a deterministic, plastic system to learn to imitate stochastic behavior is analyzed. Two neural networks -actually, two perceptrons- are put to play a zero-sum game one against the other. The competition, by acting as a kind of mutually supervised learning, drives the networks to produce an approximation to the optimal strategy, that is to say, a random signal.
Create a lesson
Related papers
The Stone-Wales trefoil: a new topological defect in graphene
M. V. Kondrin, Y. B. Lebed, V. V. Brazhkin
Short-Range Vector Spin Glasses: Parisi Hierarchies and Real-Space Ultrametricity
Akash Vijay, Jaewon Kim, Jong Yeon Lee
Lyapunov spectrum of random neural networks
David G. Clark
Revealing more on complex energy landscapes by passing less local information: Cavity approach with trust region in non-convex optimization problems
Zhiqi Xu, Chi Ho Yeung
Predicting activation-barrier and plasticity-onset statistics in a model of glasses
Makoto Suda, Edan Lerner, Eran Bouchbinder
Classifications in modular restricted Boltzmann machines
Elena Agliari, Andrea Lepre, Edoardo Roscani