Fast Computation of Branching Process Transition Probabilities via ADMM

02/23/2023
by   Achal Awasthi, et al.
0

Branching processes are a class of continuous-time Markov chains (CTMCs) prevalent for modeling stochastic population dynamics in ecology, biology, epidemiology, and many other fields. The transient or finite-time behavior of these systems is fully characterized by their transition probabilities. However, computing them requires marginalizing over all paths between endpoint-conditioned values, which often poses a computational bottleneck. Leveraging recent results that connect generating function methods to a compressed sensing framework, we recast this task from the lens of sparse optimization. We propose a new solution method using variable splitting; in particular, we derive closed form updates in a highly efficient ADMM algorithm. Notably, no matrix products – let alone inversions – are required at any step. This reduces computational cost by orders of magnitude over existing methods, and the resulting algorithm is easily parallelizable and fairly insensitive to tuning parameters. A comparison to prior work is carried out in two applications to models of blood cell production and transposon evolution, showing that the proposed method is orders of magnitudes more scalable than existing work.

READ FULL TEXT
research
07/06/2021

Scaling up Continuous-Time Markov Chains Helps Resolve Underspecification

Modeling the time evolution of discrete sets of items (e.g., genetic mut...
research
03/07/2020

Stochastic Modified Equations for Continuous Limit of Stochastic ADMM

Stochastic version of alternating direction method of multiplier (ADMM) ...
research
07/19/2019

Are Parametric Markov Chains Monotonic?

This paper presents a simple algorithm to check whether reachability pro...
research
09/17/2020

Asymptotic Analysis of ADMM for Compressed Sensing

In this paper, we analyze the asymptotic behavior of alternating directi...
research
05/01/2019

Automated Machine Learning via ADMM

We study the automated machine learning (AutoML) problem of jointly sele...
research
08/16/2016

Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees

Efficient methods for storing and querying are critical for scaling high...

Please sign up or login with your details

Forgot password? Click here to reset