Pathspace Kalman Filters with Dynamic Process Uncertainty for Analyzing Time-course Data
<|reference_start|>Pathspace Kalman Filters with Dynamic Process Uncertainty for Analyzing Time-course Data: Kalman Filter (KF) is an optimal linear state prediction algorithm, with applications in fields as diverse as engineering, economics, robotics, and space exploration. Here, we develop an extension of the KF, called a Pathspace Kalman Filter (PKF) which allows us to a) dynamically track the uncertainties associated with the underlying data and prior knowledge, and b) take as input an entire trajectory and an underlying mechanistic model, and using a Bayesian methodology quantify the different sources of uncertainty. An application of this algorithm is to automatically detect temporal windows where the internal mechanistic model deviates from the data in a time-dependent manner. First, we provide theorems characterizing the convergence of the PKF algorithm. Then, we numerically demonstrate that the PKF outperforms conventional KF methods on a synthetic dataset lowering the mean-squared-error by several orders of magnitude. Finally, we apply this method to biological time-course dataset involving over 1.8 million gene expression measurements.<|reference_end|>
@article{agrahar2024pathspace,
    title={Pathspace Kalman Filters with Dynamic Process Uncertainty for Analyzing
  Time-course Data},
    author={Chaitra Agrahar, William Poole, Simone Bianco, Hana El-Samad},
    journal={arXiv preprint arXiv:2402.04498},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.04498},
    primaryClass={stat.ML cs.LG q-bio.QM}
}