Publications

A direct solver is introduced for solving overdetermined linear systems involving nonuniform discrete Fourier transform matrices. Such matrices can be transformed into a Cauchy-like form that has hierarchical low rank structure. The rank structure of this matrix is explained, and it is shown that the ranks of the relevant submatrices grow only logarithmically with the number of columns of the matrix. A fast rank-structured hierarchical approximation method based on this analysis is developed, along with a hierarchical least-squares solver for these and related systems. This result is a direct method for inverting nonuniform discrete transforms with a complexity that is usually nearly linear with respect to the degrees of freedom in the problem. This solver is benchmarked against various iterative and direct solvers in the setting of inverting the one-dimensional type-II (or forward) transform, for a range of condition numbers and problem sizes (up to (4 10

Despite the parallels between problems in computer vision and cryo-electron microscopy (cryo-EM), many state-of-the-art approaches from computer vision have yet to be adapted for cryo-EM. Within the computer-vision research community, implicits such as neural radiance fields (NeRFs) have enabled the detailed reconstruction of 3D objects from few images at different camera-viewing angles. While other neural implicits, specifically density fields, have been used to map conformational heterogeneity from noisy cryo-EM projection images, most approaches represent volume with an implicit function in Fourier space, which has disadvantages compared with solving the problem in real space, complicating, for instance, masking, constraining physics or geometry, and assessing local resolution. In this work, we build on a recent development in neural implicits, a multi-resolution hash-encoding framework called instant-NGP, that we use to represent the scalar volume directly in real space and apply it to the cryo-EM density-map reconstruction problem (InstaMap). We demonstrate that for both synthetic and real data, InstaMap for homogeneous reconstruction achieves higher resolution at shorter training stages than five other real-spaced representations. We propose a solution to noise overfitting, demonstrate that InstaMap is both lightweight and fast to train, implement masking from a user-provided input mask and extend it to molecular-shape heterogeneity via bending space using a per-image vector field.

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

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.

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.

Using a state-of-the-art numerical scheme, we show that the Higgs mode under excitation exhibits chirped oscillations and exponential decay when fluctuations are included. This is in stark contrast to conventional BCS collisionless dynamics which predict power-law decay and the absence of chirping. The chirped amplitude mode enables us to determine the local modification of the effective potential even when the system is in a long-lived prethermal state. We then show that this chirped amplitude mode is an experimentally observable quantity since the photoinduced (super)current in pump-probe experiments serves as an efficient proxy for the order parameter dynamics, including the chirped dynamics. Our result is based on the attractive Hubbard model using dynamical mean-field theory within the symmetry-broken state after a excitation across the superconducting gap. Since the collective response involves long timescales, we extend the hierarchical low-rank compression method for nonequilibrium Green's functions to symmetry-broken states and show that it serves as an efficient representation despite long-lived memory kernels.

This paper provides an explicit formula for the approximate solution of the static London equations. These equations describe the currents and magnetic fields in a Type-I superconductor. We represent the magnetic field as a 2-form and the current as a 1-form, and assume that the superconducting material is contained in a bounded, connected set, Ω, with smooth boundary. The London penetration depth gives an estimate for the thickness of the layer near ∂Ω where the current is largely carried. In an earlier paper, we introduced a system of Fredholm integral equations of second kind, on ∂Ω, for solving the physically relevant scattering problems in this context. In real Type-I superconductors the penetration depth is very small, typically about 100nm, which often renders the integral equation approach computationally intractable. In this paper we provide an explicit formula for approximate solutions, with essentially optimal error estimates, as the penetration depth tends to zero. Our work makes extensive use of the Hodge decomposition of differential forms on manifolds with boundary, and thus evokes Kohn's work on the tangential Cauchy-Riemann equations.

Resolving continuous conformational heterogeneity in single-particle cryo-electron microscopy (cryo-EM) is a field in which new methods are now emerging regularly. Methods range from traditional statistical techniques to state-of-the-art neural network approaches. Such ongoing efforts continue to enhance the ability to explore and understand the continuous conformational variations in cryo-EM data. One of the first methods was the manifold embedding approach or ManifoldEM. However, comparing it with more recent methods has been challenging due to software availability and usability issues. In this work, we introduce a modern Python implementation that is user-friendly, orders of magnitude faster than its previous versions and designed with a developer-ready environment. This implementation allows a more thorough evaluation of the strengths and limitations of methods addressing continuous conformational heterogeneity in cryo-EM, paving the way for further community-driven improvements.

Stokes flows with near-touching rigid particles induce near-singular lubrication forces under relative motion, making their accurate numerical treatment challenging. With the aim of controlling the accuracy with a computationally cheap method, we present a new technique that combines the method of fundamental solutions (MFS) with the method of images. For rigid spheres, we propose to represent the flow using Stokeslet proxy sources on interior spheres, augmented by lines of image sources adapted to each near-contact to resolve lubrication. Source strengths are found by a least-squares solve at contact-adapted boundary collocation nodes. We include extensive numerical tests, and validate against reference solutions from a well-resolved boundary integral formulation. With less than 60 additional image sources per particle per contact, we show controlled uniform accuracy to three relative digits in surface velocities, and up to five digits in particle forces and torques, for all separations down to a thousandth of the radius. In the special case of flows around fixed particles, the proxy sphere alone gives controlled accuracy. A one-body preconditioning strategy allows acceleration with the fast multipole method, hence close to linear scaling in the number of particles. This is demonstrated by solving problems of up to 2000 spheres on a workstation using only 700 proxy sources per particle.

In this work, we introduce the No-Underrun Sampler (NURS), a locally-adaptive, gradient-free Markov chain Monte Carlo method that blends ideas from Hit-and-Run and the No-U-Turn Sampler. NURS dynamically adapts to the local scale of the target distribution without requiring gradient evaluations, making it especially suitable for applications where gradients are unavailable or costly. We establish key theoretical properties, including reversibility, formal connections to Hit-and-Run and Random Walk Metropolis, Wasserstein contraction comparable to Hit-and-Run in Gaussian targets, and bounds on the total variation distance between the transition kernels of Hit-and-Run and NURS. Empirical experiments, supported by theoretical insights, illustrate the ability of NURS to sample from Neal's funnel, a challenging multi-scale distribution from Bayesian hierarchical inference.