arXiv subjects

Christopher E. Miles

Publications and source records attributed to Christopher E. Miles.

11 recordsLinked to original sources

arXiv2026

Identifiability Limits of Physics-Informed Inference for Spatial Stochastic Dynamics from Static Snapshots

Despite increasing scale and resolution, many biological measurements remain destructive, revealing only spatial information rather than the dynamics it encodes. By combining flexible representations with mechanistic constraints, physics-informed machine learning offers a promising route to inferring these dynamics from static snapshots. Motivated by subcellular imaging of gene expression, we ask when a static spatial pattern of molecules can identify spatially varying diffusivity, creation, destruction, and boundary exchange, and how different inference schemes perform on the task. A structural identifiability analysis shows that distributed sources are non-identifiable, whereas a point source such as a transcription site can restore identifiability. These limits are further shaped by seemingly innocuous modeling choices: the boundary conditions, the spatial regularity of the underlying dynamics, and even the stochastic calculus convention. We then adapt several physics-informed schemes, differing in how they represent the solution and enforce the governing equations, and demonstrate effective inference from a single snapshot. Physics-informed approaches can thus recover spatial heterogeneities of biological dynamics from static data, but their use should be accompanied and guided by careful identifiability analysis for meaningful interpretation of the results.

q-bio.QM↗

arXiv2026

Bayesian BiLO: Bilevel Local Operator Learning for Efficient Uncertainty Quantification of Bayesian PDE Inverse Problems with Low-Rank Adaptation

Uncertainty quantification in PDE inverse problems is essential in many applications. Scientific machine learning and AI enable data-driven learning of model components while preserving physical structure, and provide the scalability and adaptability needed for emerging imaging technologies and clinical insights. We develop a Bilevel Local Operator Learning framework for Bayesian inference in PDEs (B-BiLO). At the upper level, we sample parameters from the posterior via Hamiltonian Monte Carlo, while at the lower level we fine-tune a neural network via low-rank adaptation (LoRA) to approximate the solution operator locally. B-BiLO enables efficient gradient-based sampling without synthetic data or adjoint equations and avoids sampling in high-dimensional weight space, as in Bayesian neural networks, by optimizing weights deterministically. We analyze errors from approximate lower-level optimization and establish their impact on posterior accuracy. Numerical experiments across PDE models, including tumor growth, demonstrate that B-BiLO achieves accurate and efficient uncertainty quantification.

cs.LG↗

arXiv2026

BiLO: Bilevel Local Operator Learning for PDE Inverse Problems

We propose a new neural network based method for solving inverse problems for partial differential equations (PDEs) by formulating the PDE inverse problem as a bilevel optimization problem. At the upper level, we minimize the data loss with respect to the PDE parameters. At the lower level, we train a neural network to locally approximate the PDE solution operator in the neighborhood of a given set of PDE parameters, which enables an accurate approximation of the descent direction for the upper level optimization problem. The lower level loss function includes the L2 norms of both the residual and its derivative with respect to the PDE parameters. We apply gradient descent simultaneously on both the upper and lower level optimization problems, leading to an effective and fast algorithm. The method, which we refer to as BiLO (Bilevel Local Operator learning), is also able to efficiently infer unknown functions in the PDEs through the introduction of an auxiliary variable. We provide a theoretical analysis that justifies our approach. Through extensive experiments over multiple PDE systems, we demonstrate that our method enforces strong PDE constraints, is robust to sparse and noisy data, and eliminates the need to balance the residual and the data loss, which is inherent to the soft PDE constraints in many existing methods.

cs.LG↗

arXiv2025

Variational Markov chain mixtures with automatic component selection

Markov state modeling has gained popularity in various scientific fields since it reduces complex time-series data sets into transitions between a few states. Yet common Markov state modeling frameworks assume a single Markov chain describes the data, so they suffer from an inability to discern heterogeneities. As an alternative, this paper models time-series data using a mixture of Markov chains, and it automatically determines the number of mixture components using the variational expectation-maximization algorithm.Variational EM simultaneously identifies the number of Markov chains and the dynamics of each chain without expensive model comparisons or posterior sampling. As a theoretical contribution, this paper identifies the natural limits of Markov state mixture modeling by proving a lower bound on the classification error. It then presents numerical experiments where variational EM achieves performance consistent with the theoretically optimal error scaling. The experiments are based on synthetic and observational data sets including Last.fm music listening, ultramarathon running, and gene expression. In each of the three data sets, variational EM leads to the identification of meaningful heterogeneities.

stat.ME↗

arXiv2025

Mechanistic inference of stochastic gene expression from structured single-cell data

Single-cell gene expression measurements encode variability spanning molecular noise, cell-to-cell heterogeneity, and technical artifacts. Mechanistic stochastic models provide powerful approaches to disentangle these sources, yet inferring underlying dynamics from standard snapshot sequencing data faces fundamental identifiability limitations. This review focuses on how structured datasets with temporal, spatial, or multimodal features offer constraints to resolve these ambiguities, but demand more sophisticated models and inference strategies, including machine-learning techniques with inherent tradeoffs. We highlight recent progress in the judicious integration of structured single-cell data, stochastic model development, and innovative inference strategies to extract predictive, gene-level insights. These advances lay the foundation for scaling mechanistic inference upward to regulatory networks and multicellular tissues.

q-bio.QM↗

arXiv2023

Inferring stochastic rates from heterogeneous snapshots of particle positions

Many imaging techniques for biological systems -- like fixation of cells coupled with fluorescence microscopy -- provide sharp spatial resolution in reporting locations of individuals at a single moment in time but also destroy the dynamics they intend to capture. These snapshot observations contain no information about individual trajectories, but still encode information about movement and demographic dynamics, especially when combined with a well-motivated biophysical model. The relationship between spatially evolving populations and single-moment representations of their collective locations is well-established with partial differential equations (PDEs) and their inverse problems. However, experimental data is commonly a set of locations whose number is insufficient to approximate a continuous-in-space PDE solution. Here, motivated by popular subcellular imaging data of gene expression, we embrace the stochastic nature of the data and investigate the mathematical foundations of parametrically inferring demographic rates from snapshots of particles undergoing birth, diffusion, and death in a nuclear or cellular domain. Toward inference, we rigorously derive a connection between individual particle paths and their presentation as a Poisson spatial process. Using this framework, we investigate the properties of the resulting inverse problem and study factors that affect quality of inference. One pervasive feature of this experimental regime is the presence of cell-to-cell heterogeneity. Rather than being a hindrance, we show that cell-to-cell geometric heterogeneity can increase the quality of inference on dynamics for certain parameter regimes. Altogether, the results serve as a basis for more detailed investigations of subcellular spatial patterns of RNA molecules and other stochastically evolving populations that can only be observed for single instants in their time evolution.

q-bio.SC↗

arXiv2023

Coarse-grained dynamics of transiently-bound fast linkers

Transient bonds between fast linkers and slower particles are widespread in physical and biological systems. In spite of their diverse structure and function, a commonality is that the linkers diffuse on timescales much faster compared to the overall motion of the particles they bind to. This limits numerical and theoretical approaches that need to resolve these diverse timescales with high accuracy. Many models, therefore, resort to effective, yet ad-hoc, dynamics, where linker motion is only accounted for when bound. This paper provides a mathematical justification for such coarse-grained dynamics that preserves detailed balance at equilibrium. Our derivation is based on multiscale averaging techniques and is broadly applicable. We verify our results with simulations on a minimal model of fast linker binding to a slow particle. We show how our framework can be applied to various systems, including those with multiple linkers, stiffening linkers upon binding, or slip bonds with force-dependent unbinding. Importantly, the preservation of detailed balance only sets the ratio of the binding to the unbinding rates, but it does not constrain the detailed expression of binding kinetics. We conclude by discussing how various choices of binding kinetics may affect macroscopic dynamics.

cond-mat.soft↗

arXiv2023

Stochastic switching of delayed feedback suppresses oscillations in genetic regulatory systems

Delays and stochasticity have both served as crucially valuable ingredients in mathematical descriptions of control, physical, and biological systems. In this work, we investigate how explicitly dynamical stochasticity in delays modulates the effect of delayed feedback. To do so, we consider a hybrid model where stochastic delays evolve by a continuous-time Markov chain, and between switching events, the system of interest evolves via a deterministic delay equation. Our main contribution is the calculation of an effective delay equation in the fast switching limit. This effective equation maintains the influence of all subsystem delays and cannot be replaced with a single effective delay. To illustrate the relevance of this calculation, we investigate a simple model of stochastically switching delayed feedback motivated by gene regulation. We show that sufficiently fast switching between two oscillatory subsystems can yield stable dynamics.

q-bio.MN↗

arXiv2018

Analysis of non-processive molecular motor transport using renewal reward theory

We propose and analyze a mathematical model of cargo transport by non-processive molecular motors. In our model, the motors change states by random discrete events (corresponding to stepping and binding/unbinding), while the cargo position follows a stochastic differential equation (SDE) that depends on the discrete states of the motors. The resulting system for the cargo position is consequently an SDE that randomly switches according to a Markov jump process governing motor dynamics. To study this system we (1) cast the cargo position in a renewal theory framework and generalize the renewal reward theorem and (2) decompose the continuous and discrete sources of stochasticity and exploit a resulting pair of disparate timescales. With these mathematical tools, we obtain explicit formulas for experimentally measurable quantities, such as cargo velocity and run length. Analyzing these formulas then yields some predictions regarding so-called non-processive clustering, the phenomenon that a single motor cannot transport cargo, but that two or more motors can. We find that having motor stepping, binding, and unbinding rates depend on the number of bound motors, due to geometric effects, is necessary and sufficient to explain recent experimental data on non-processive motors.

q-bio.SC↗

arXiv2018

Jump Locations of Jump-Diffusion Processes with State-Dependent Rates

We propose a general framework for studying jump-diffusion systems driven by both Gaussian noise and a jump process with state-dependent intensity. Of particular natural interest are the jump locations: the system evaluated at the jump times. However, the state-dependence of the jump rate provides direct coupling between the diffusion and jump components, making disentangling the two to study individually difficult. We provide an iterative map formulation of the sequence of distributions of jump locations. Computation of these distributions allows for the extraction of the interjump time statistics. These quantities reveal a relationship between the long-time distribution of jump location and the stationary density of the full process. We provide a few examples to demonstrate the analytical and numerical tools stemming from the results proposed in the paper, including an application that shows a non-monotonic dependence on the strength of diffusion.

cond-mat.stat-mech↗

arXiv2016

Bidirectionality From Cargo Thermal Fluctuations in Motor-Mediated Transport

Molecular motor proteins serve as an essential component of intracellular transport by generating forces to haul cargoes along cytoskeletal filaments. Two species of motors that are directed oppositely (e.g. kinesin, dynein) can be attached to the same cargo, which is known to produce bidirectional net motion. Although previous work focuses on the motor number as the driving noise source for switching, we propose an alternative mechanism: cargo diffusion. A mean-field mathematical model of mechanical interactions of two populations of molecular motors with cargo thermal fluctuations (diffusion) is presented to study this phenomenon. The delayed response of a motor to fluctuations in the cargo velocity is quantified, allowing for the reduction of the full model a single "characteristic distance", a proxy for the net force on the cargo. The system is then found to be metastable, with switching exclusively due to cargo diffusion between distinct directional transport states. The time to switch between these states is then investigated using a mean first passage time analysis. The switching time is found to be non-monotonic in the drag of the cargo, providing an experimental test of the theory.

q-bio.SC↗