Searcharxiv⌕ Search

arXiv subjects

Stephen Whitelam

Publications and source records attributed to Stephen Whitelam.

At least 37 records · Page 2Linked to original sources
arXiv2024

Competing addition processes give distinct growth regimes in the assembly of 1D filaments

We present a model to describe the concentration-dependent growth of protein filaments. Our model contains two states, a low entropy/high affinity ordered state and a high entropy/low affinity disordered state. Consistent with experiments, our model shows a diffusion-limited linear growth regime at low concentration, followed by a concentration independent plateau at intermediate concentrations, and rapid disordered precipitation at the highest concentrations. We show that growth in the linear and plateau regions is the result of two processes that compete amid the rapid binding and unbinding of non-specific states. The first process is the addition of ordered molecules during the periods where the end of the filament is free of incorrectly bound molecules. The second process is the capture of defects, which occurs when consecutive ordered additions occur on top of incorrectly bound molecules. We show that a key molecular property is the probability that a diffusive collision results in a correctly bound state. Small values of this probability suppress the defect capture growth mode, resulting in a plateau in the growth rate when incorrectly bound molecules become common enough to poison ordered growth. We show that conditions that non-specifically suppress or enhance intermolecular interactions, such as the addition of depletants or osmolytes, have opposite effects on the growth rate in the linear and plateau regimes. In the linear regime stronger interactions promote growth by reducing dissolution events, but in the plateau regime stronger interactions inhibit growth by stabilizing incorrectly bound molecules.

cond-mat.soft↗
arXiv2024

Learning protocols for the fast and efficient control of active matter

We show that it is possible to learn protocols that effect fast and efficient state-to-state transformations in simulation models of active particles. By encoding the protocol in the form of a neural network we use evolutionary methods to identify protocols that take active particles from one steady state to another, as quickly as possible or with as little energy expended as possible. Our results show that protocols identified by a flexible neural-network ansatz, which allows the optimization of multiple control parameters and the emergence of sharp features, are more efficient than protocols derived recently by constrained analytical methods. Our learning scheme is straightforward to use in experiment, suggesting a way of designing protocols for the efficient manipulation of active matter in the laboratory.

cond-mat.stat-mech↗
arXiv2023

Nonequilibrium formulation of varying-temperature bit erasure

Landauer's principle states that erasing a bit of information at fixed temperature T costs at least kT ln 2 units of work. Here we investigate erasure at varying temperature, to which Landauer's result does not apply. We formulate bit erasure as a stochastic nonequilibrium process involving a compression of configuration space, with physical and logical states associated in a symmetric way. Erasure starts and ends at temperature T, but temperature can otherwise vary with time in an arbitrary way. Defined in this way, erasure is governed by a set of nonequilibrium fluctuation relations that show that varying-temperature erasure can done with less work than k T ln 2. As a result, erasure and the complementary process of bit randomization can be combined to form a work-producing engine cycle.

cond-mat.stat-mech↗
arXiv2023

How to train your demon to do fast information erasure without heat production

Time-dependent protocols that perform irreversible logical operations, such as memory erasure, cost work and produce heat, placing bounds on the efficiency of computers. Here we use a prototypical computer model of a physical memory to show that it is possible to learn feedback-control protocols to do fast memory erasure without input of work or production of heat. These protocols, which are enacted by a neural-network ``demon'', do not violate the second law of thermodynamics because the demon generates more heat than the memory absorbs. The result is a form of nonlocal heat exchange in which one computation is rendered energetically favorable while a compensating one produces heat elsewhere, a tactic that could be used to rationally design the flow of energy within a computer.

cond-mat.stat-mech↗
arXiv2023

Demon in the machine: learning to extract work and absorb entropy from fluctuating nanosystems

We use Monte Carlo and genetic algorithms to train neural-network feedback-control protocols for simulated fluctuating nanosystems. These protocols convert the information obtained by the feedback process into heat or work, allowing the extraction of work from a colloidal particle pulled by an optical trap and the absorption of entropy by an Ising model undergoing magnetization reversal. The learning framework requires no prior knowledge of the system, depends only upon measurements that are accessible experimentally, and scales to systems of considerable complexity. It could be used in the laboratory to learn protocols for fluctuating nanosystems that convert measurement information into stored work or heat.

cond-mat.stat-mech↗
arXiv2023

Remembering the work of Phillip L. Geissler: A coda to his scientific trajectory

Phillip L. Geissler made important contributions to the statistical mechanics of biological polymers, heterogeneous materials, and chemical dynamics in aqueous environments. He devised analytical and computational methods that revealed the underlying organization of complex systems at the frontiers of biology, chemistry, and materials science. In this retrospective, we celebrate his work at these frontiers.

cond-mat.stat-mech↗
arXiv2022

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.

cond-mat.stat-mech↗
arXiv2022

Training neural networks using Metropolis Monte Carlo and an adaptive variant

We examine the zero-temperature Metropolis Monte Carlo algorithm as a tool for training a neural network by minimizing a loss function. We find that, as expected on theoretical grounds and shown empirically by other authors, Metropolis Monte Carlo can train a neural net with an accuracy comparable to that of gradient descent, if not necessarily as quickly. The Metropolis algorithm does not fail automatically when the number of parameters of a neural network is large. It can fail when a neural network's structure or neuron activations are strongly heterogenous, and we introduce an adaptive Monte Carlo algorithm, aMC, to overcome these limitations. The intrinsic stochasticity and numerical stability of the Monte Carlo method allow aMC to train deep neural networks and recurrent neural networks in which the gradient is too small or too large to allow training by gradient descent. Monte Carlo methods offer a complement to gradient-based methods for training neural networks, allowing access to a distinct set of network architectures and principles.

cs.LG↗
arXiv2022

Cellular automata can classify data by inducing trajectory phase coexistence

We show that cellular automata can classify data by inducing a form of dynamical phase coexistence. We use Monte Carlo methods to search for general two-dimensional deterministic automata that classify images on the basis of activity, the number of state changes that occur in a trajectory initiated from the image. When the number of timesteps of the automaton is a trainable parameter, the search scheme identifies automata that generate a population of dynamical trajectories displaying high or low activity, depending on initial conditions. Automata of this nature behave as nonlinear activation functions with an output that is effectively binary, resembling an emergent version of a spiking neuron.

cs.NE↗
arXiv2022

Learning stochastic dynamics and predicting emergent behavior using transformers

We show that a neural network originally designed for language processing can learn the dynamical rules of a stochastic system by observation of a single dynamical trajectory of the system, and can accurately predict its emergent behavior under conditions not observed during training. We consider a lattice model of active matter undergoing continuous-time Monte Carlo dynamics, simulated at a density at which its steady state comprises small, dispersed clusters. We train a neural network called a transformer on a single trajectory of the model. The transformer, which we show has the capacity to represent dynamical rules that are numerous and nonlocal, learns that the dynamics of this model consists of a small number of processes. Forward-propagated trajectories of the trained transformer, at densities not encountered during training, exhibit motility-induced phase separation and so predict the existence of a nonequilibrium phase transition. Transformers have the flexibility to learn dynamical rules from observation without explicit enumeration of rates or coarse-graining of configuration space, and so the procedure used here can be applied to a wide range of physical systems, including those with large and complex dynamical generators.

cond-mat.stat-mech↗
arXiv2021

Optimizing thermodynamic trajectories using evolutionary and gradient-based reinforcement learning

Using a model heat engine, we show that neural network-based reinforcement learning can identify thermodynamic trajectories of maximal efficiency. We consider both gradient and gradient-free reinforcement learning. We use an evolutionary learning algorithm to evolve a population of neural networks, subject to a directive to maximize the efficiency of a trajectory composed of a set of elementary thermodynamic processes; the resulting networks learn to carry out the maximally-efficient Carnot, Stirling, or Otto cycles. When given an additional irreversible process, this evolutionary scheme learns a previously unknown thermodynamic cycle. Gradient-based reinforcement learning is able to learn the Stirling cycle, whereas an evolutionary approach achieves the optimal Carnot cycle. Our results show how the reinforcement learning strategies developed for game playing can be applied to solve physical problems conditioned upon path-extensive order parameters.

cs.NE↗
arXiv2021

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.

cs.NE↗
arXiv2021

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 that 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.

cond-mat.stat-mech↗
arXiv2021

Varied phenomenology of models displaying dynamical large-deviation singularities

Singularities of dynamical large-deviation functions are often interpreted as the signal of a dynamical phase transition and the coexistence of distinct dynamical phases, by analogy with the correspondence between singularities of free energies and equilibrium phase behavior. Here we study models of driven random walkers on a lattice. These models display large-deviation singularities in the limit of large lattice size, but the extent to which each model's phenomenology resembles a phase transition depends on the details of the driving. We also compare the behavior of ergodic and non-ergodic models that present large-deviation singularities. We argue that dynamical large-deviation singularities indicate the divergence of a model timescale, but not necessarily one associated with cooperative behavior or the existence of distinct phases.

cond-mat.stat-mech↗
arXiv2021

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.

cs.LG↗
arXiv2020

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.

cond-mat.stat-mech↗
arXiv2020

Dynamical large deviations of two-dimensional kinetically constrained models using a neural-network state ansatz

We use a neural network ansatz originally designed for the variational optimization of quantum systems to study dynamical large deviations in classical ones. We obtain the scaled cumulant-generating function for the dynamical activity of the Fredrickson-Andersen model, a prototypical kinetically constrained model, in one and two dimensions, and present the first size-scaling analysis of the dynamical activity in two dimensions. These results provide a new route to the study of dynamical large-deviation functions, and highlight the broad applicability of the neural-network state ansatz across domains in physics.

cond-mat.stat-mech↗