Pith. sign in

REVIEW 1 cited by

Learning to grow: control of material self-assembly using evolutionary reinforcement learning

Not yet reviewed by Pith; the record is open.

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 1912.08333 v3 pith:VQ2MFNPW submitted 2019-12-18 cond-mat.stat-mech cs.LGcs.NE

classification cond-mat.stat-mechcs.LGcs.NE
keywords networksevolutionarylearningprotocolsself-assemblycaseinputmolecular
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We show that neural networks trained by evolutionary reinforcement learning can enact efficient molecular self-assembly protocols. Presented with molecular simulation trajectories, networks learn to change temperature and chemical potential in order to promote the assembly of desired structures or choose between competing polymorphs. In the first case, networks reproduce in a qualitative sense the results of previously-known protocols, but faster and with higher fidelity; in the second case they identify strategies previously unknown, from which we can extract physical insight. Networks that take as input the elapsed time of the simulation or microscopic information from the system are both effective, the latter more so. The evolutionary scheme we have used is simple to implement and can be applied to a broad range of examples of experimental self-assembly, whether or not one can monitor the experiment as it proceeds. Our results have been achieved with no human input beyond the specification of which order parameter to promote, pointing the way to the design of synthesis protocols by artificial intelligence.

Discussion (0). Continue with ORCID 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

  1. Evolutionary reinforcement learning of dynamical large deviations

    cond-mat.stat-mech 2019-09 conditional novelty 6.0 of 10

    An evolutionary algorithm that mutates a reference model's rates or neural-network weights produces tight upper bounds on dynamical large-deviation rate functions, matching exact results on three test models.

Pith tools