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

2D capsid formation within an oscillatory energy landscape: orderly self-assembly depends on the interplay between a dynamic potential and intrinsic relaxation times

Multiple dissipative self-assembly protocols designed to create novel structures or to reduce kinetic traps have recently emerged. Specifically, temporal oscillations of particle interactions have been shown effective at both aims, but investigations thus far have focused on systems of simple colloids or their binary mixtures. In this work, we expand our understanding of the effect of temporally oscillating interactions to a two-dimensional coarse-grained viral capsid-like model that undergoes a self-limited assembly. This model includes multiple intrinsic relaxation times due to the internal structure of the capsid subunits and, under certain interaction regimes, proceeds via a two-step nucleation mechanism. We find that oscillations much faster than the local intrinsic relaxation times can be described via a time averaged inter-particle potential across a wide range of interaction strengths, while oscillations much slower than these relaxation times result in structures that adapt to the attraction strength of the current half-cycle. Interestingly, oscillation periods similar to these relaxation times shift the interaction window over which orderly assembly occurs by enabling error correction during the half-cycles with weaker attractions. Our results provide fundamental insights to non-equilibrium self-assembly on temporally variant energy landscapes.

Inverse design of a pyrochlore lattice of DNA origami through model-driven experiments

Sophisticated statistical mechanics approaches and human intuition have demonstrated the possibility of self-assembling complex lattices or finite-size constructs. However, attempts so far have mostly only been successful in silico and often fail in experiment because of unpredicted traps associated with kinetic slowing down (gelation, glass transition) and competing ordered structures. Theoretical predictions also face the difficulty of encoding the desired interparticle interaction potential with the experimentally available nano- and micrometer-sized particles. To overcome these issues, we combine SAT assembly (a patchy-particle interaction design algorithm based on constrained optimization) with coarse-grained simulations of DNA nanotechnology to experimentally realize trap-free self-assembly pathways. We use this approach to assemble a pyrochlore three-dimensional lattice, coveted for its promise in the construction of optical metamaterials, and characterize it with small-angle x-ray scattering and scanning electron microscopy visualization.

Designing 3D multicomponent self-assembling systems with signal-passing building blocks

We introduce an allostery-mimetic building block model for the self-assembly of 3D structures. We represent the building blocks as patchy particles, where each binding site (patch) can be irreversibly activated or deactivated by binding of the particle's other controlling patches to another particle. We show that these allostery-mimetic systems can be designed to increase yields of target structures by disallowing misassembled states and can further decrease the smallest number of distinct species needed to assemble a target structure. Next, we show applications to design a programmable nanoparticle swarm for multifarious assembly: a system of particles that stores multiple possible target structures and a particular structure is recalled by presenting an external trigger signal. Finally, we outline a possible pathway for realization of such structures at nanoscale using DNA nanotechnology devices.

Engineering Azeotropy to Optimize the Self-Assembly of Colloidal Mixtures

The goal of inverse self-assembly is to design interparticle interactions capable of assembling the units into a desired target structure. The effective assembly of complex structures often requires the use of multiple components, each new component increasing the thermodynamic degrees of freedom and, hence, the complexity of the self-assembly pathway. In this work we explore the possibility to use azeotropy, i.e., a special thermodynamic condition where the system behaves effectively as a one-component system, as a way to control the self-assembly of an arbitrary number of components. Exploiting the mass-balance equations, we show how to select patchy particle systems that exhibit azeotropic points along the desired self-assembly pathway. As an example we map the phase diagram of a binary mixture that, by design, fully assembles into cubic (and only cubic) diamond crystal via an azeotropic point. The ability to explicitly include azeotropic points in artificial designs reveals effective pathways for the self-assembly of complex structures.

Mechanisms of Biomolecular Self-Assembly Investigated Through In Situ Observations of Structures and Dynamics

Biomolecular self-assembly of hierarchical materials is a precise and adaptable bottom-up approach to synthesizing across scales with considerable energy, health, environment, sustainability, and information technology applications. To achieve desired functions in biomaterials, it is essential to directly observe assembly dynamics and structural evolutions that reflect the underlying energy landscape and the assembly mechanism. This review will summarize the current understanding of biomolecular assembly mechanisms based on in situ characterization and discuss the broader significance and achievements of newly gained insights. In addition, we will also introduce how emerging deep learning/machine learning-based approaches, multiparametric characterization, and high-throughput methods can boost the development of biomolecular self-assembly. The objective of this review is to accelerate the development of in situ characterization approaches for biomolecular self-assembly and to inspire the next generation of biomimetic materials.

Tensor renormalization group study of orientational ordering in simple models of adsorption monolayers

A simple lattice model of the orientational ordering in organic adsorption layers that considers the directionality of intermolecular interactions is proposed. The symmetry and the number of rotational states of the adsorbed molecule are the main parameters of the model. The model takes into account both the isotropic and directional contributions to the molecule-molecule interaction potential. Using several special cases of this model, we have shown that the tensor renormalization group (TRG) approach can be successfully used for the analysis of orientational ordering in organic adsorption layers with directed intermolecular interactions. Adsorption isotherms, potential energy, and entropy have been calculated for the model adsorption layers differing in the molecule symmetry and the number of rotational states. The calculated thermodynamic characteristics show that entropy effects play a significant role in the self-assembly of dense phases of the molecular layers. All the results obtained with the TRG have been verified by the standard Monte Carlo method. The proposed model reproduces the main features of the phase behavior of the real adsorption layers of benzoic, terephthalic, and trimesic acids on a homogeneous surface of metal single crystals and graphite.

Toward the Golden Age of Materials Informatics: Perspective and Opportunities

Materials informatics is reaching the transition point and is evolving from its early stages of adoption and development and moving toward its golden age. Here, the transformation of the early stage of materials informatics toward the next level of materials informatics is explored. In particular, it has become crucial to be able to manipulate materials synthesis data, materials properties data, and materials characterization data. Through the use of ontology, material design and understanding can be carried out simultaneously in a whitebox manner. Here, a perspective on the ultimate goal of materials informatics along with potential key components is discussed.

Active control of equilibrium, near-equilibrium, and far-from-equilibrium colloidal systems

The development of top-down active control over bottom-up colloidal assembly processes has the potential to produce materials, surfaces, and objects with applications in a wide range of fields spanning from computing to materials science to biomedical engineering. In this review, we summarize recent progress in the field using a taxonomy based on how active control is used to guide assembly. We find there are three distinct scenarios: (1) navigating kinetic pathways to reach a desirable equilibrium state, (2) the creation of a desirable metastable, kinetically trapped, or kinetically arrested state, and (3) the creation of a desirable far-from-equilibrium state through continuous energy input. We review seminal works within this framework, provide a summary of important application areas, and present a brief introduction to the fundamental concepts of control theory that are necessary for the soft materials community to understand this literature. In addition, we outline current and potential future applications of actively-controlled colloidal systems, and we highlight important open questions and future directions.

Optimization of non-equilibrium self-assembly protocols using Markov state models

The promise of self-assembly to enable the bottom-up formation of materials with prescribed architectures and functions has driven intensive efforts to uncover rational design principles for maximizing the yield of a target structure. Yet, despite many successful examples of self-assembly, ensuring kinetic accessibility of the target structure remains an unsolved problem in many systems. In particular, long-lived kinetic traps can result in assembly times that vastly exceed experimentally accessible timescales. One proposed solution is to design non-equilibrium assembly protocols in which system parameters change over time to avoid such kinetic traps. Here, we develop a framework to combine Markov state model (MSM) analysis with optimal control theory to compute a time-dependent protocol that maximizes the yield of the target structure at a finite time. We present an adjoint-based gradient descent method that, in conjunction with MSMs for a system as a function of its control parameters, enables efficiently optimizing the assembly protocol. We also describe an interpolation approach to significantly reduce the number of simulations required to construct the MSMs. We demonstrate our approach with two examples; a simple semi-analytic model for the folding of a polymer of colloidal particles, and a more complex model for capsid assembly. Our results show that optimizing time-dependent protocols can achieve significant improvements in the yields of selected structures, including equilibrium free energy minima, long-lived metastable structures, and transient states.

Hierarchical Materials from High Information Content Macromolecular Building Blocks: Construction, Dynamic Interventions, and Prediction

Hierarchical materials that exhibit order over multiple length scales are ubiquitous in nature. Because hierarchy gives rise to unique properties and functions, many have sought inspiration from nature when designing and fabricating hierarchical matter. More and more, however, nature's own high-information content building blocks, proteins, peptides, and peptidomimetics, are being coopted to build hierarchy because the information that determines structure, function, and interfacial interactions can be readily encoded in these versatile macromolecules. Here, we take stock of recent progress in the rational design and characterization of hierarchical materials produced from high-information content blocks with a focus on stimuli-responsive and "smart" architectures. We also review advances in the use of computational simulations and data-driven predictions to shed light on how the side chain chemistry and conformational flexibility of macromolecular blocks drive the emergence of order and the acquisition of hierarchy and also on how ionic, solvent, and surface effects influence the outcomes of assembly. Continued progress in the above areas will ultimately usher in an era where an understanding of designed interactions, surface effects, and solution conditions can be harnessed to achieve predictive materials synthesis across scale and drive emergent phenomena in the self-assembly and reconfiguration of high-information content building blocks.

Low-dissipation self-assembly protocols of active sticky particles

We use neuroevolutionary learning to identify time-dependent protocols for low-dissipation self-assembly in a model of generic active particles with interactions. When the time allotted for assembly is sufficiently long, low-dissipation protocols use only interparticle attractions, producing an amount of entropy that scales as the number of particles. When time is too short to allow assembly to proceed via diffusive motion, low-dissipation assembly protocols instead require particle self-propulsion, producing an amount of entropy that scales with the number of particles and the swim length required to cause assembly. Self-propulsion therefore provides an expensive but necessary mechanism for inducing assembly when time is of the essence.

A simple solution to the problem of self-assembling cubic diamond crystals

The self-assembly of colloidal diamond (CD) crystals is considered as one of the most coveted goals of nanotechnology, both from the technological and fundamental points of view. For applications, colloidal diamond is a photonic crystal which can open new possibilities of manipulating light for information processing. From a fundamental point of view, its unique symmetry exacerbates a series of problems that are commonly faced during the self-assembly of target structures, such as the presence of kinetic traps and the formation of crystalline defects and alternative structures (polymorphs). Here we demonstrate that all these problems can be systematically addressed via SAT-assembly, a design framework that converts self-assembly into a Boolean satisfiability problem (SAT). Contrary to previous solutions (requiring four or more components), we prove that the assembly of the CD crystal only requires a binary mixture. Moreover, we use molecular dynamics simulations of a system composed by nearly a million nucleotides to test a DNA nanotechnology design that constitutes a promising candidate for experimental realization.

Data-Driven Materials Innovation and Applications

Owing to the rapid developments to improve the accuracy and efficiency of both experimental and computational investigative methodologies, the massive amounts of data generated have led the field of materials science into the fourth paradigm of data-driven scientific research. This transition requires the development of authoritative and up-to-date frameworks for data-driven approaches for material innovation. A critical discussion on the current advances in the data-driven discovery of materials with a focus on frameworks, machine-learning algorithms, material-specific databases, descriptors, and targeted applications in the field of inorganic materials is presented. Frameworks for rationalizing data-driven material innovation are described, and a critical review of essential subdisciplines is presented, including: i) advanced data-intensive strategies and machine-learning algorithms; ii) material databases and related tools and platforms for data generation and management; iii) commonly used molecular descriptors used in data-driven processes. Furthermore, an in-depth discussion on the broad applications of material innovation, such as energy conversion and storage, environmental decontamination, flexible electronics, optoelectronics, superconductors, metallic glasses, and magnetic materials, is provided. Finally, how these subdisciplines (with insights into the synergy of materials science, computational tools, and mathematics) support data-driven paradigms is outlined, and the opportunities and challenges in data-driven material innovation are highlighted.

Physics-informed graph neural networks enhance scalability of variational nonequilibrium optimal control

When a physical system is driven away from equilibrium, the statistical distribution of its dynamical trajectories informs many of its physical properties. Characterizing the nature of the distribution of dynamical observables, such as a current or entropy production rate, has become a central problem in nonequilibrium statistical mechanics. Asymptotically, for a broad class of observables, the distribution of a given observable satisfies a large deviation principle when the dynamics is Markovian, meaning that fluctuations can be characterized in the long-time limit by computing a scaled cumulant generating function. Calculating this function is not tractable analytically (nor often numerically) for complex, interacting systems, so the development of robust numerical techniques to carry out this computation is needed to probe the properties of nonequilibrium materials. Here, we describe an algorithm that recasts this task as an optimal control problem that can be solved variationally. We solve for optimal control forces using neural network ansätze that are tailored to the physical systems to which the forces are applied. We demonstrate that this approach leads to transferable and accurate solutions in two systems featuring large numbers of interacting particles.

Correspondence between neuroevolution and gradient descent

We show analytically that training a neural network by conditioned stochastic mutation or neuroevolution of its weights is equivalent, in the limit of small mutations, to gradient descent on the loss function in the presence of Gaussian white noise. Averaged over independent realizations of the learning process, neuroevolution is equivalent to gradient descent on the loss function. We use numerical simulation to show that this correspondence can be observed for finite mutations, for shallow and deep neural networks. Our results provide a connection between two families of neural-network training methods that are usually considered to be fundamentally different.

Gradient-based and non-gradient-based methods for training neural networks are usually considered to be fundamentally different. The authors derive, and illustrate numerically, an analytic equivalence between the dynamics of neural network training under conditioned stochastic mutations, and under gradient descent.

Deposition control of model glasses with surface-mediated orientational order

We introduce a minimal model of solid-forming anisotropic molecules that displays, in thermal equilibrium, surface orientational order without bulk orientational order. The model reproduces the nonequilibrium behavior of recent experiments in which a bulk nonequilibrium structure grown by deposition contains regions of orientational order characteristic of the surface equilibrium. This order is deposited, in general, in a nonuniform way because of the emergence of a growth-poisoning mechanism that causes equilibrated surfaces to grow slower than non-equilibrated surfaces. We use evolutionary methods to design oscillatory protocols able to grow nonequilibrium structures with uniform order, demonstrating the potential of protocol design for the fabrication of this class of materials.

Thermodynamic stability versus kinetic accessibility: Pareto fronts for programmable self-assembly

A challenge in designing self-assembling building blocks is to ensure the target state is both thermodynamically stable and kinetically accessible. These two objectives are known to be typically in competition, but it is not known how to simultaneously optimize them. We consider this problem through the lens of multi-objective optimization theory: we develop a genetic algorithm to compute the Pareto fronts characterizing the tradeoff between equilibrium probability and folding rate, for a model system of small polymers of colloids with tunable short-ranged interaction energies. We use a coarse-grained model for the particles' dynamics that allows us to efficiently search over parameters, for systems small enough to be enumerated. For most target states there is a tradeoff when the number of types of particles is small, with medium-weak bonds favouring fast folding, and strong bonds favouring high equilibrium probability. The tradeoff disappears when the number of particle types reaches a value m*, that is usually much less than the total number of particles. This general approach of computing Pareto fronts allows one to identify the minimum number of design parameters to avoid a thermodynamic-kinetic tradeoff. However, we argue, by contrasting our coarse-grained model's predictions with those of Brownian dynamics simulations, that particles with short-ranged isotropic interactions should generically have a tradeoff, and avoiding it in larger systems will require orientation-dependent interactions.

Neuroevolutionary Learning of Particles and Protocols for Self-Assembly

Within simulations of molecules deposited on a surface we show that neuroevolutionary learning can design particles and time-dependent protocols to promote self-assembly, without input from physical concepts such as thermal equilibrium or mechanical stability and without prior knowledge of candidate or competing structures. The learning algorithm is capable of both directed and exploratory design: it can assemble a material with a user-defined property, or search for novelty in the space of specified order parameters. In the latter mode it explores the space of what can be made, rather than the space of structures that are low in energy but not necessarily kinetically accessible.

Generalized optimal paths and weight distributions revealed through the large deviations of random walks on networks

Numerous problems of both theoretical and practical interest are related to finding shortest (or otherwise optimal) paths in networks, frequently in the presence of some obstacles or constraints. A somewhat related class of problems focuses on finding optimal distributions of weights which, for a given connection topology, maximize some kind of flow or minimize a given cost function. We show that both sets of problems can be approached through an analysis of the large-deviation functions of random walks. Specifically, a study of ensembles of trajectories allows us to find optimal paths, or design optimal weighted networks, by means of an auxiliary stochastic process (the generalized Doob transform). The paths are not limited to shortest paths, and the weights must not necessarily optimize a given function. Paths and weights can in fact be tailored to a given statistics of a time-integrated observable, which may be an activity or current, or local functions marking the passing of the random walker through a given node or link. We illustrate this idea with an exploration of optimal paths in the presence of obstacles, and networks that optimize flows under constraints on local observables.

Improving the Accuracy of Nearest-Neighbor Classification Using Principled Construction and Stochastic Sampling of Training-Set Centroids

A conceptually simple way to classify images is to directly compare test-set data and training-set data. The accuracy of this approach is limited by the method of comparison used, and by the extent to which the training-set data cover configuration space. Here we show that this coverage can be substantially increased using coarse-graining (replacing groups of images by their centroids) and stochastic sampling (using distinct sets of centroids in combination). We use the MNIST and Fashion-MNIST data sets to show that a principled coarse-graining algorithm can convert training images into fewer image centroids without loss of accuracy of classification of test-set images by nearest-neighbor classification. Distinct batches of centroids can be used in combination as a means of stochastically sampling configuration space, and can classify test-set data more accurately than can the unaltered training set. On the MNIST and Fashion-MNIST data sets this approach converts nearest-neighbor classification from a mid-ranking- to an upper-ranking member of the set of classical machine-learning techniques.

Insights into the Structure and Energy of DNA Nanoassemblies

Since the pioneering work of Ned Seeman in the early 1980s, the use of the DNA molecule as a construction material experienced a rapid growth and led to the establishment of a new field of science, nowadays called structural DNA nanotechnology. Here, the self-recognition properties of DNA are employed to build micrometer-large molecular objects with nanometer-sized features, thus bridging the nano- to the microscopic world in a programmable fashion. Distinct design strategies and experimental procedures have been developed over the years, enabling the realization of extremely sophisticated structures with a level of control that approaches that of natural macromolecular assemblies. Nevertheless, our understanding of the building process, i.e., what defines the route that goes from the initial mixture of DNA strands to the final intertwined superstructure, is, in some cases, still limited. In this review, we describe the main structural and energetic features of DNA nanoconstructs, from the simple Holliday junction to more complicated DNA architectures, and present the theoretical frameworks that have been formulated until now to explain their self-assembly. Deeper insights into the underlying principles of DNA self-assembly may certainly help us to overcome current experimental challenges and foster the development of original strategies inspired to dissipative and evolutive assembly processes occurring in nature.

Evolutionary reinforcement learning of dynamical large deviations

We show how to bound and calculate the likelihood of dynamical large deviations using evolutionary reinforcement learning. An agent, a stochastic model, propagates a continuous-time Monte Carlo trajectory and receives a reward conditioned upon the values of certain path-extensive quantities. Evolution produces progressively fitter agents, potentially allowing the calculation of a piece of a large-deviation rate function for a particular model and path-extensive quantity. For models with small state spaces, the evolutionary process acts directly on rates, and for models with large state spaces, the process acts on the weights of a neural network that parameterizes the model's rates. This approach shows how path-extensive physics problems can be considered within a framework widely used in machine learning.