Patchy Particles Design: From Floppy Modes to Sloppy Dimensions
Gregory Snyder, Chrisy Xiyu Du
TL;DR
Patchy-particle design space is explored with end-to-end differentiable MD to link design parameters such as patch size $a/r$, patch opening angle $\theta$, and binding energies $E_{AA}, E_{AB}, E_{BB}$ to finite-cluster outcomes. The authors show that the relationship between these parameters is strongly dictated by the target structure's floppiness, with Hessian analysis revealing stiff versus sloppy directions in the design landscape. By contrasting self-assembly and stabilization tasks, the work highlights the role of kinetics and parameter coupling in gradient-based inverse design. The approach provides practical design guidelines for constructing patchy particles to yield specific finite clusters and offers an information-geometry-inspired diagnostic framework for high-dimensional design spaces.
Abstract
Patchy particles have proven to be a prominent model for studying the self-assembly behavior of various systems, ranging from finite clusters to bulk crystal assemblies, and from synthetic colloidal particles to viruses. The patchy particle model is flexible, but it also comes with its own pitfalls -- the potential design space is infinite. Many efforts have been put into building inverse-design frameworks that efficiently design patchy particles for targeted assembly behaviors. In contrast, little work has been done on investigating the interplay between different types of parameters that can be optimized for patchy particles, such as patch location, patch size, and patch binding energies. Here, by utilizing molecular dynamics with automatic differentiation, we elucidate the relationships between different potential optimization parameters and provide general guidelines on how to approach patchy particle design for various types of finite clusters. Specifically, we find that the design parameter landscape is highly dependent on the floppiness of the target structure, and we can identify stiff and sloppy parameters by computing the Hessians of all optimization parameters.
