Publications

Given sparse or low-quality radial-velocity measurements of a star, there are often many qualitatively different stellar or exoplanet companion orbit models that are consistent with the data. The consequent multimodality of the likelihood function leads to extremely challenging search, optimization, and MCMC posterior sampling over the orbital parameters. Here we create a custom Monte Carlo sampler for sparse or noisy radial-velocity measurements of two-body systems that can produce posterior samples for orbital parameters even when the likelihood function is poorly behaved. The six standard orbital parameters for a binary system can be split into four non-linear parameters (period, eccentricity, argument of pericenter, phase) and two linear parameters (velocity amplitude, barycenter velocity). We capitalize on this by building a sampling method in which we densely sample the prior pdf in the non-linear parameters and perform rejection sampling using a likelihood function marginalized over the linear parameters. With sparse or uninformative data, the sampling obtained by this rejection sampling is generally multimodal and dense. With informative data, the sampling becomes effectively unimodal but too sparse: in these cases we follow the rejection sampling with standard MCMC. The method produces correct samplings in orbital parameters for data that include as few as three epochs. The Joker can therefore be used to produce proper samplings of multimodal pdfs, which are still informative and can be used in hierarchical (population) modeling. We give some examples that show how the posterior pdf depends sensitively on the number and time coverage of the observations and their uncertainties.

Modeling self-organization of neural networks for unsupervised learning using Hebbian and anti-Hebbian plasticity has a long history in neuroscience. Yet, derivations of single-layer networks with such local learning rules from principled optimization objectives became possible only recently, with the introduction of similarity matching objectives. What explains the success of similarity matching objectives in deriving neural networks with local learning rules? Here, using dimensionality reduction as an example, we introduce several variable substitutions that illuminate the success of similarity matching. We show that the full network objective may be optimized separately for each synapse using local learning rules both in the offline and online settings. We formalize the long-standing intuition of the rivalry between Hebbian and anti-Hebbian rules by formulating a min-max optimization problem. We introduce a novel dimensionality reduction objective using fractional matrix exponents. To illustrate the generality of our approach, we apply it to a novel formulation of dimensionality reduction combined with whitening. We confirm numerically that the networks with learning rules derived from principled objectives perform better than those with heuristic learning rules.

We present a hierarchical probabilistic model for improving geometric stellar distance estimates using color--magnitude information. This is achieved with a data driven model of the color--magnitude diagram, not relying on stellar models but instead on the relative abundances of stars in color--magnitude cells, which are inferred from very noisy magnitudes and parallaxes. While the resulting noise-deconvolved color--magnitude diagram can be useful for a range of applications, we focus on deriving improved stellar distance estimates relying on both parallax and photometric information. We demonstrate the efficiency of this approach on the 1.4 million stars of the Gaia TGAS sample that also have APASS magnitudes. Our hierarchical model has 4~million parameters in total, most of which are marginalized out numerically or analytically. We find that distance estimates are significantly improved for the noisiest parallaxes and densest regions of the color--magnitude diagram. In particular, the average distance signal-to-noise ratio and uncertainty improve by 19~percent and 36~percent, respectively, with 8~percent of the objects improving in SNR by a factor greater than 2. This computationally efficient approach fully accounts for both parallax and photometric noise, and is a first step towards a full hierarchical probabilistic model of the Gaia data.

The proper positioning of mitotic spindle in the single-cell Caenorhabditis elegans embryo is achieved initially by the migration and rotation of the pronuclear complex (PNC) and its two associated astral microtubules (MTs). Pronuclear migration produces global cytoplasmic flows that couple the mechanics of all microtubules, the PNC, and the cell periphery with each other through their hydrodynamic interactions (HIs). We present the first computational study that explicitly accounts for detailed HIs between the cytoskeletal components and demonstrate the key consequences of HIs on the mechanics of pronuclear migration. First we show that, because of HIs between the MTs, the cytoplasm-filled astral MTs behave like a porous medium with its permeability decreasing with increasing the number of MTs. We then directly study the dynamics of PNC migration under various force-transduction models, including the pushing or pulling of MTs at the cortex, and the pulling of MTs by cytoplasmically-bound force generators. While achieving proper position and orientation on reasonable time-scales does not uniquely choose a model, we find that each model produces a different signature in its induced cytoplasmic flow. We suggest then that cytoplasmic flows can be used to differentiate between mechanisms.

Cerebellar granule cells, which constitute half the brain's neurons, supply Purkinje cells with contextual information necessary for motor learning, but how they encode this information is unknown. Here we show, using two-photon microscopy to track neural activity over multiple days of cerebellum-dependent eyeblink conditioning in mice, that granule cell populations acquire a dense representation of the anticipatory eyelid movement. Initially, granule cells responded to neutral visual and somatosensory stimuli as well as periorbital airpuffs used for training. As learning progressed, two-thirds of monitored granule cells acquired a conditional response whose timing matched or preceded the learned eyelid movements. Granule cell activity covaried trial by trial to form a redundant code. Many granule cells were also active during movements of nearby body structures. Thus, a predictive signal about the upcoming movement is widely available at the input stage of the cerebellar cortex, as required by forward models of cerebellar control.

Differential binding of transcription factors (TFs) at cis-regulatory loci drives the differentiation and function of diverse cellular lineages. Understanding the regulatory interactions that underlie cell fate decisions requires characterizing TF binding sites (TFBS) across multiple cell types and conditions. Techniques, e.g. ChIP-Seq can reveal genome-wide patterns of TF binding, but typically requires laborious and costly experiments for each TF-cell-type (TFCT) condition of interest. Chromosomal accessibility assays can connect accessible chromatin in one cell type to many TFs through sequence motif mapping. Such methods, however, rarely take into account that the genomic context preferred by each factor differs from TF to TF, and from cell type to cell type. To address the differences in TF behaviors, we developed Mocap, a method that integrates chromatin accessibility, motif scores, TF footprints, CpG/GC content, evolutionary conservation and other factors in an ensemble of TFCT-specific classifiers. We show that integration of genomic features, such as CpG islands improves TFBS prediction in some TFCT. Further, we describe a method for mapping new TFCT, for which no ChIP-seq data exists, onto our ensemble of classifiers and show that our cross-sample TFBS prediction method outperforms several previously described methods.

We analyze one of the simplest active suspensions with complex dynamics: a suspension of immotile "Extensor" particles that exert active extensile dipolar stresses on the fluid in which they are immersed. This is relevant to several experimental systems, such as recently studied tripartite rods that create extensile flows by consuming a chemical fuel. We first describe the system through a Doi-Onsager kinetic theory based on microscopic modeling. This theory captures the active stresses produced by the particles that can drive hydrodynamic instabilities, as well as the steric interactions of rod-like particles that lead to nematic alignment. This active nematic system yields complex flows and disclination defect dynamics very similar to phenomenological Landau-deGennes Q-tensor theories for active nematic fluids, as well as by more complex Doi-Onsager theories for polar microtubule/motor-protein systems. We apply the quasi-equilibrium Bingham closure, used to study suspensions of passive microscopic rods, to develop a non-standard Q-tensor theory. We demonstrate through simulation that this "BQ-tensor" theory gives an excellent analytical and statistical accounting of the suspension's complex dynamics, at a far reduced computational cost. Finally, we apply the BQ-tensor model to study the dynamics of Extensor suspensions in circular and bi-concave domains. In circular domains, we reproduce previous results for systems with weak nematic alignment, but for strong alignment find novel dynamics with activity-controlled defect production and absorption at the boundaries of the domain. In bi-concave domains, a Fredericks-like transition occurs as the width of the neck connecting the two disks is varied.

We present a new derivation of a boundary integral equation (BIE) for simulating the three-dimensional dynamics of arbitrarily-shaped rigid particles of genus zero immersed in a Stokes fluid, on which are prescribed forces and torques. Our method is based on a single-layer representation and leads to a simple second-kind integral equation. It avoids the use of auxiliary sources within each particle that play a role in some classical formulations. We use a spectrally accurate quadrature scheme to evaluate the corresponding layer potentials, so that only a small number of spatial discretization points per particle are required. The resulting discrete sums are computed in O(n) time, where n denotes the number of particles, using the fast multipole method (FMM). The particle positions and orientations are updated by a high-order time-stepping scheme. We illustrate the accuracy, conditioning and scaling of our solvers with several numerical examples

We present a fast summation method for lattice sums of the type which arise when solving wave scattering problems with periodic boundary conditions. While there are a variety of effective algorithms in the literature for such calculations, the approach presented here is new and leads to a rigorous analysis of Wood's anomalies. These arise when illuminating a grating at specific combinations of the angle of incidence and the frequency of the wave, for which the lattice sums diverge. They were discovered by Wood in 1902 as singularities in the spectral response. The primary tools in our approach are the Euler-Maclaurin formula and a steepest descent argument. The resulting algorithm has super-algebraic convergence and requires only milliseconds of CPU time.

We describe a modular approach to identify and inhibit protein–protein interactions (PPIs) that are mediated by protein secondary and tertiary structures with rationally designed peptidomimetics. Our analysis begins with entries of high-resolution complexes in the Protein Data Bank and utilizes conformational sampling, scoring, and design capabilities of advanced biomolecular modeling software to develop peptidomimetics.