Deeptime: a Python library for machine learning dynamical models from time series data
Open accessThe DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
Generation and analysis of time-series data is relevant to many quantitative fields ranging from economics to fluid mechanics. In the physical sciences, structures such as metastable and coherent sets, slow relaxation processes, collective variables, dominant transition pathways or manifolds and channels of probability flow can be of great importance for understanding and characterizing the kinetic, thermodynamic and mechanistic properties of the system. Deeptime is a general purpose Python library offering various tools to estimate dynamical models based on time-series data including conventional linear learning methods, such as Markov state models (MSMs), Hidden Markov Models and Koopman models, as well as kernel and deep learning approaches such as VAMPnets and deep MSMs. The library is largely compatible with scikit-learn, having a range of Estimator classes for these different models, but in contrast to scikit-learn also provides deep Model classes, e.g. in the case of an MSM, which provide a multitude of analysis methods to compute interesting thermodynamic, kinetic and dynamical quantities, such as free energies, relaxation times and transition paths. The library is designed for ease of use but also easily maintainable and extensible code. In this paper we introduce the main features and structure of the deeptime software. Deeptime can be found under https://deeptime-ml.github.io/.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Matplotlib: a 2D graphics environment
Hunter, J. D. (2007) · Computing in Science & Engineering · doi:10.1109/mcse.2007.55 · Cited by 39,249
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2020) · Nature Methods · doi:10.1038/s41592-019-0686-2 · Cited by 38,430
Harris, C. R., Millman, K. J., van der Walt, S. J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N. J., et al. (2020) · Nature · doi:10.1038/s41586-020-2649-2 · Cited by 23,826
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743 · cited 3×
“HMMs [30, 31] are a type of model consisting of a hidden (i.”
BackgroundMethodLeast squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2019) · Apollo - University of Cambridge Repository · doi:10.17863/cam.64134 · Cited by 10,460
Discovering governing equations from data by sparse identification of nonlinear dynamical systems
Brunton, S. L., Proctor, J. L., & Kutz, J. N. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1517384113 · Cited by 4,796
Self-citationLasota, A., & Mackey, M. C. (1994) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-4286-4 · Cited by 1,353
Markov models of molecular kinetics: Generation and validation
Prinz, J.-H., Wu, H., Sarich, M., Keller, B., Senne, M., Held, M., Chodera, J. D., Schütte, C., & Noé, F. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3565032 · Cited by 1,275 · cited 3×
“mean first passage times and fluxes among (sets of) states [109], implied timescales [27], or metastable decompositions of Markov states [110].”
BackgroundSelf-citation
Cited by
Scalable emulation of protein equilibrium ensembles with generative deep learning
Lewis, S., Hempel, T., Jiménez-Luna, J., Gastegger, M., Xie, Y., Foong, A. Y. K., Satorras, V. G., Abdin, O., Veeling, B. S., Zaporozhets, I., et al. (2025) · Science · doi:10.1126/science.adv9817 · Cited by 390
Self-citationConev, A., Rigo, M. M., Devaurs, D., Fonseca, A. F., Kalavadwala, H., de Freitas, M. V., Clementi, C., Zanatta, G., Antunes, D. A., & Kavraki, L. E. (2023) · Briefings in Bioinformatics · doi:10.1093/bib/bbad242 · Cited by 28
How Robust Is the Ligand Binding Transition State?
Bose, S., Lotz, S. D., Deb, I., Shuck, M., Lee, K. S. S., & Dickson, A. (2023) · Journal of the American Chemical Society · doi:10.1021/jacs.3c08940 · Cited by 16
Markov State Models with Weighted Ensemble Simulation: How to Eliminate the Trajectory Merging Bias
Bose, S., Kilinc, C., & Dickson, A. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01141 · Cited by 10
Wang, B., Wang, C., Chen, J., Liu, D., Sun, C., Zhang, J., Zhang, K., & Li, H. (2026) · Nature Machine Intelligence · doi:10.1038/s42256-026-01198-9 · Cited by 5
Metadata
- Authors
- Hoffmann, M., Scherer, M., Hempel, T., Mardt, A., de Silva, B., Husic, B. E., Klus, S., Wu, H., Kutz, N., Brunton, S. L., & Noé, F.
- Venue
- Machine Learning: Science and Technology
- Publisher
- IOP Publishing
- Published
- 2021-12-10
- Volume
- 3
- Issue
- 1
- Pages
- 015009
- ISSN
- 2632-2153 (ISSN-L)
- OpenAlex
- W3208532694
- Cited by
- 147
- References
- 22
- FWCI
- 7.30
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Deeptime: a Python library for machine learning dynamical models from time series data. https://app.cochat.ai/papers/10.1088/2632-2153/ac3de0
- The paper
- Hoffmann, M., Scherer, M., Hempel, T., Mardt, A., de Silva, B., Husic, B. E., Klus, S., Wu, H., Kutz, N., Brunton, S. L., & Noé, F. (2022). Deeptime: a Python library for machine learning dynamical models from time series data. Machine Learning: Science and Technology. https://doi.org/10.1088/2632-2153/ac3de0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.