Inverse Ising problem in continuous time: A latent variable approach

Abstract

We consider the inverse Ising problem, i.e. the inference of network couplings from observed spin trajectories for a model with continuous time Glauber dynamics. By introducing two sets of auxiliary latent random variables we render the likelihood into a form, which allows for simple iterative inference algorithms with analytical updates. The variables are: (1) Poisson variables to linearise an exponential term which is typical for point process likelihoods and (2) Pólya-Gamma variables, which make the likelihood quadratic in the coupling parameters. Using the augmented likelihood, we derive an expectation-maximization (EM) algorithm to obtain the maximum likelihood estimate of network parameters. Using a third set of latent variables we extend the EM algorithm to sparse couplings via L1 regularization. Finally, we develop an efficient approximate Bayesian inference algorithm using a variational approach. We demonstrate the performance of our algorithms on data simulated from an Ising model. For data which are simulated from a more biologically plausible network with spiking neurons, we show that the Ising model captures well the low order statistics of the data and how the Ising couplings are related to the underlying synaptic structure of the simulated network.

GetDist: a Python package for analysing Monte Carlo samples

“…Using a Discrete Cosine Transform (DCT), this can also efficiently handle leadingorder boundary effects, so that boundaries are not mistaken for large derivatives [1]. The method only requires one DCT of the binned data and some binned array dot products, and hence is fast; we adopt it as our auto-bandwidth selector 9 . The DCT imposes even symmetry about boundaries, so we only use it for the bandwidth choice, not the actual KDE (the linear boundary kernel gives better accuracy by allowing general gradients at the boundaries).…”

“…This is easy to do approximately by just constructing histograms, however it may be unclear how wide to make the bins and the result is unlikely to be an accurate representation of the density. A Bayesian approach could attempt to solve for the distribution of the true density given the samples (and a model of how they were drawn), for example using a Gaussian process prior [7][8][9]. While conceptually appealing and potentially very accurate, solutions typically involve a further step of MC sampling and can have non-trivial computational cost.…”

Objective Bayesian Edge Screening and Structure Selection for Ising Networks

“…However, since the pseudolikelihood comprises a sequence of logistic regressions, we can use the data-augmentation strategy that was proposed by Polson, Scott, and Windle (2013a) to facilitate a simple Gibbs sampling approach, with full-conditionals that are easy to sample from. A similar approach to the Ising model's pseudolikelihood was considered by Donner and Opper (2017). Here we extend this idea to SSVS for the Ising model.…”

Objective Bayesian Edge Screening and Structure Selection for Ising Networks

“…sample from. A similar approach to the Ising model's pseudolikelihood was considered by Donner and Opper (2017). Here, we extend this idea to SSVS for the Ising model.…”