14 comments

[ 2.9 ms ] story [ 41.4 ms ] thread
> We show that any CA may readily be represented using a convolutional neural network with a network-in-network architecture.
See also: "learning" Conway's Game of Life configurations by gradient descent.

https://hardmath123.github.io/conways-gradient.html

Excellent write up. I've coincidentally been experimenting with the same thing. Any idea whether this approach could be used to speed up a search for exact solutions?
I wonder if it is because using backpropagation all non-linear functions are chained together when the weights are learnt? Is it naive to think by that formulation the results will be quite similar since the final model equations are close?
Not sure I understand the importance of this...
Indeed, CA can be represented by simple combinations of boolean functions, obviously by NN also, which is a combination of similar nonlinear functions.
A wide enough NN can represent any arbitrary binary function, but it's not obvious that one can learn it.
Yet the best NNs are deep, not wide.
kind of obvious
Can you please tell us how is it obvious? I am interested in the network in network part
I was hoping to see some mention of rule 110
I take it this is not a bidirectional mapping?