Critical scaling in hidden state inference for linear Langevin dynamics
arXiv:1612.01976 · doi:10.1088/1742-5468/aa6bc4
Abstract
We consider the problem of inferring the dynamics of unknown (i.e. hidden) nodes from a set of observed trajectories and study analytically the average prediction error and the typical relaxation time of correlations between errors. We focus on a stochastic linear dynamics of continuous degrees of freedom interacting via random Gaussian couplings in the infinite network size limit. The expected error on the hidden time courses can be found as the equal-time hidden-to-hidden covariance of the probability distribution conditioned on observations. In the stationary regime, we analyze the phase diagram in the space of relevant parameters, namely the ratio between the numbers of observed and hidden nodes, the degree of symmetry of the interactions and the amplitudes of the hidden-to-hidden and hidden-to-observed couplings relative to the decay constant of the internal hidden dynamics. In particular, we identify critical regions in parameter space where the relaxation time and the inference error diverge, and determine the corresponding scaling behaviour.
34 pages, 10 figures. Formerly part of arXiv:1603.05538
References in corpus (7)
- Inference algorithms for gene networks: a statistical mechanics analysis
- Belief-Propagation and replicas for inference and learning in a kinetic Ising model with hidden spins
- Inferring hidden states in a random kinetic Ising model: replica analysis
- Extended Plefka Expansion for Stochastic Dynamics
- Inferring hidden states in Langevin dynamics on large networks: Average case performance
- Variational perturbation and extended Plefka approaches to dynamics on random networks: the case of the kinetic Ising model
- Inference for dynamics of continuous variables: the Extended Plefka Expansion with hidden nodes