Differentiable cellular automata

Carlos Martin

Differentiable cellular automata

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1708.09546 v1 pith:JTQM7IWI submitted 2017-08-31 cs.DM nlin.CG

Carlos Martin This is my paper

classification cs.DMnlin.CG

keywords automatacellulardcasdifferentiableordinarybehaviorclasscomputed

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We describe a class of cellular automata (CAs) that are end-to-end differentiable. DCAs interpolate the behavior of ordinary CAs through rules that act on distributions of states. The gradient of a DCA with respect to its parameters can be computed with an iterative propagation scheme that uses previously-computed gradients and values. Gradient-based optimization over DCAs could be used to find ordinary CAs with desired properties.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Differentiable Logic Cellular Automata: From Game of Life to Pattern Generation
cs.AI 2025-06 conditional novelty 6.0 of 10

A recurrent circuit of differentiable logic gates learns local update rules for cellular automata, reproducing Game of Life and generating target patterns.

Pith tools