Publications

Methods for tracking lab animal movements in unconstrained environments have become increasingly common and powerful tools for neuroscience. The prevailing hypothesis is that animal behavior in these environments comprises sequences of discrete stereotyped body movements ("motifs" or "actions"). However, the same action can occur at different speeds or heading directions, and the same action may manifest slightly differently across subjects due to, for example, variation in body size. These and other forms of nuisance variability complicate attempts to quantify animal behavior in terms of discrete action sequences and draw meaningful comparisons across individual subjects. To address this, we present a framework for motion analysis that uses conditional variational autoencoders in conjunction with adversarial learning paradigms to disentangle behavioral factors. We demonstrate the utility of this approach in downstream tasks such as clustering, decodability, and motion synthesis. Further, we apply our technique to improve disease detection in a Parkinsonian mouse model.

Simulating membrane proteins accurately combines two challenges into one: properly capturing the structure and dynamics of proteins as well as correctly representing the membrane environment in which they are usually embedded. Beginning with pioneering efforts in the 1980s and 1990s,1−7 both challenges have been met with increasing success over the years. Simulations of membrane proteins in realistic cellular contexts over many microseconds are now common.Concomitant advances in the determination of membrane protein structures, with over 50 unique structures determined 8 annually have further expanded the reach of simulations in this area. This Special Issue highlights a number of recent molecular dynamics (MD) simulations of membrane proteins and covers a wide range of applications and specialized techniques.

Quasi two-dimensional (quasi-2D) Coulomb systems have drawn widespread interest. The reduced symmetry of these systems leads to complex collective behaviors yet simultaneously poses significant challenges for particle-based simulations. In this paper, a novel method is presented for efficiently simulating a collection of (N) charges confined in doubly periodic slabs, with the extension to scenarios involving dielectric jumps at slab boundaries. Unlike existing methods, the method is insensitive to the aspect ratio of the simulation box, and it achieves optimal ( O(N)) complexity and strong parallel scalability, thanks to the random batch Ewald (RBE) approach. Moreover, the additional cost for polarization contributions, represented as image reflection series, is reduced to a negligible cost via combining the RBE with an efficient structure factor coefficient recalibration technique in (k)-space. Explicit formulas for optimal parameter choices of the algorithm are provided through error estimates, together with a rigorous proof. Finally, we demonstrate the accuracy, efficiency, and scalability of our method, called RBE2D, via numerical tests across a variety of prototype systems. An excellent agreement between RBE2D and the particle-particle particle-mesh method (PPPM) is observed, with a significant reduction in the computational cost and improved strong scalability, demonstrating that it is a promising method for a broad range of charged systems under quasi-2D confinement.

The flagellum is the most complex macromolecular structure known in bacteria and is composed of around two dozen distinct proteins. The main building block of the long, external flagellar filament, flagellin, is secreted through the flagellar type-III secretion system at a remarkable rate of several tens of thousands of amino acids per second, significantly surpassing the rates achieved by other pore-based protein secretion systems. The evolutionary implications and potential benefits of this high secretion rate for flagellum assembly and function, however, have remained elusive. In this study, we provide both experimental and theoretical evidence that the flagellar secretion rate has been evolutionarily optimized to facilitate rapid and efficient construction of a functional flagellum. By synchronizing flagellar assembly, we found that a minimal filament length of 2.5 μm was required for swimming motility. Biophysical modeling revealed that this minimal filament length threshold resulted from an elasto-hydrodynamic instability of the whole swimming cell, dependent on the filament length. Furthermore, we developed a stepwise filament labeling method combined with electron microscopy visualization to validate predicted flagellin secretion rates of up to 10,000 amino acids per second. A biophysical model of flagellum growth demonstrates that the observed high flagellin secretion rate efficiently balances filament elongation and energy consumption, thereby enabling motility in the shortest amount of time. Taken together, these insights underscore the evolutionary pressures that have shaped the development and optimization of the flagellum and type-III secretion system, illuminating the intricate interplay and cost-benefit tradeoff between functionality and efficiency in assembly of large macromolecular structures.

Hamiltonian Monte Carlo (HMC) is the mainstay of applied Bayesian inference for differentiable models. However, HMC still struggles to sample from hierarchical models that induce densities with multiscale geometry: a large step size is needed to efficiently explore low curvature regions while a small step size is needed to accurately explore high curvature regions. We introduce the delayed rejection generalized HMC (DR-G-HMC) sampler that overcomes this challenge by employing dynamic step size selection, inspired by differential equation solvers. In generalized HMC, each iteration does a single leapfrog step. DR-G-HMC sequentially makes proposals with geometrically decreasing step sizes upon rejection of earlier proposals. This simulates Hamiltonian dynamics that can adjust its step size along a (stochastic) Hamiltonian trajectory to deal with regions of high curvature. DR-G-HMC makes generalized HMC competitive by decreasing the number of rejections which otherwise cause inefficient backtracking and prevents directed movement. We present experiments to demonstrate that DR-G-HMC (1) correctly samples from multiscale densities, (2) makes generalized HMC methods competitive with the state of the art No-U-Turn sampler, and (3) is robust to tuning parameters.

In computational physics, chemistry, and biology, the implementation of new techniques in shared and open-source software lowers barriers to entry and promotes rapid scientific progress. However, effectively training new software users presents several challenges. Common methods like direct knowledge transfer and in-person workshops are limited in reach and comprehensiveness. Furthermore, while the COVID-19 pandemic highlighted the benefits of online training, traditional online tutorials can quickly become outdated and may not cover all the software’s functionalities. To address these issues, here we introduce “PLUMED Tutorials,” a collaborative model for developing, sharing, and updating online tutorials. This initiative utilizes repository management and continuous integration to ensure compatibility with software updates. Moreover, the tutorials are interconnected to form a structured learning path and are enriched with automatic annotations to provide broader context. This paper illustrates the development, features, and advantages of PLUMED Tutorials, aiming to foster an open community for creating and sharing educational resources.

In computational physics, chemistry, and biology, the implementation of new techniques in shared and open-source software lowers barriers to entry and promotes rapid scientific progress. However, effectively training new software users presents several challenges. Common methods like direct knowledge transfer and in-person workshops are limited in reach and comprehensiveness. Furthermore, while the COVID-19 pandemic highlighted the benefits of online training, traditional online tutorials can quickly become outdated and may not cover all the software’s functionalities. To address these issues, here we introduce “PLUMED Tutorials,” a collaborative model for developing, sharing, and updating online tutorials. This initiative utilizes repository management and continuous integration to ensure compatibility with software updates. Moreover, the tutorials are interconnected to form a structured learning path and are enriched with automatic annotations to provide broader context. This paper illustrates the development, features, and advantages of PLUMED Tutorials, aiming to foster an open community for creating and sharing educational resources.

We study level set teleportation, an optimization routine which tries to accelerate gradient descent (GD) by maximizing the gradient norm over a level set of the objective. While teleportation intuitively speeds-up GD via bigger steps, current work lacks convergence theory for convex functions, guarantees for solving the teleportation operator, and even clear empirical evidence showing this acceleration. We resolve these open questions. For convex functions satisfying Hessian stability, we prove that GD with teleportation obtains a combined sub-linear/linear convergence rate which is strictly faster than GD when the optimality gap is small. This is in sharp contrast to the standard (strongly) convex setting, where teleportation neither improves nor worsens convergence. To evaluate teleportation in practice, we develop a projected-gradient method requiring only Hessian-vector products. We use this to show that gradient methods with access to a teleportation oracle out-perform their standard versions on a variety of problems. We also find that GD with teleportation is faster than truncated Newton methods, particularly for non-convex optimization.

Understanding how neural systems efficiently process information through distributed representations is a fundamental challenge at the interface of neuroscience and machine learning. Recent approaches analyze the statistical and geometrical attributes of neural representations as population-level mechanistic descriptors of task implementation. In particular, manifold capacity has emerged as a promising framework linking population geometry to the separability of neural manifolds. However, this metric has been limited to linear readouts. Here, we propose a theoretical framework that overcomes this limitation by leveraging contextual input information. We derive an exact formula for the context-dependent capacity that depends on manifold geometry and context correlations, and validate it on synthetic and real data. Our framework's increased expressivity captures representation untanglement in deep networks at early stages of the layer hierarchy, previously inaccessible to analysis. As context-dependent nonlinearity is ubiquitous in neural systems, our data-driven and theoretically grounded approach promises to elucidate context-dependent computation across scales, datasets, and models.

We study emergent dynamics in a viscous drop subject to interfacial nematic activity. Using hydrodynamic simulations, we show how the interplay of nematodynamics, activity-driven flows in the fluid bulk, and surface deformations gives rise to a sequence of self-organized behaviors of increasing complexity, from periodic braiding motions of topological defects to chaotic defect dynamics and active turbulence, along with spontaneous shape changes and translation. Our findings recapitulate qualitative features of experiments and shed light on the mechanisms underpinning morphological dynamics in active interfaces.