Towards Learning Stochastic Population Models by Gradient Descent
<|reference_start|>Towards Learning Stochastic Population Models by Gradient Descent: Increasing effort is put into the development of methods for learning mechanistic models from data. This task entails not only the accurate estimation of parameters but also a suitable model structure. Recent work on the discovery of dynamical systems formulates this problem as a linear equation system. Here, we explore several simulation-based optimization approaches, which allow much greater freedom in the objective formulation and weaker conditions on the available data. We show that even for relatively small stochastic population models, simultaneous estimation of parameters and structure poses major challenges for optimization procedures. Particularly, we investigate the application of the local stochastic gradient descent method, commonly used for training machine learning models. We demonstrate accurate estimation of models but find that enforcing the inference of parsimonious, interpretable models drastically increases the difficulty. We give an outlook on how this challenge can be overcome.<|reference_end|>
@article{kreikemeyer2024towards,
    title={Towards Learning Stochastic Population Models by Gradient Descent},
    author={Justin N. Kreikemeyer, Philipp Andelfinger, Adelinde M. Uhrmacher},
    journal={Proceedings of the 38th ACM SIGSIM Conference on Principles of
  Advanced Discrete Simulation (SIGSIM-PADS 2024). Association for Computing
  Machinery, New York, NY, USA, 88-92},
    year={2024},
    doi={10.1145/3615979.3656058},
    archivePrefix={arXiv},
    eprint={2404.07049},
    primaryClass={cs.LG}
}