Sign inGet started
Paper · arXiv

Where Does Randomness Matter in Neural Cellular Automata?

Stochastic cell updates are often used throughout the life of a neural cellular automaton (NCA), from backpropagation through time to final rollout. This leaves two questions entangled: does update randomness help learn a useful rule, and must that randomness remain at execution? We separate training and evaluation update modes in controlled Growing NCA experiments, then vary the states shown during training. Under the standard constant-rate persist recipe, asynchronous training passes the short-horizon quality test in 10/10 runs, compared with 3/10 synchronous runs. All ten asynchronous models also retain the target for 4,096 steps under deterministic evaluation. For a scalar translation...

AuthorsFei Zuo, Jiaqi Shi, Yujing Liu
Primary categorycs.LG
Published29 September 2026
Last updated at source29 September 2026
cs.LGcs.NE
Embed this entry
<iframe src="https://silytics.si/embed/item/b1654e95-309f-40e2-9f54-e3ae7fa74bc1" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.