Search arXivSearch

arXiv · 2608.09365

leaspy: LEArning Spatiotemporal Patterns in PYthon

Abstract

Longitudinal data are fundamental across scientific disciplines for modeling how complex systems evolve over time. A core challenge in these settings is handling temporal misalignment: different subjects undergo a similar underlying process but at varying speeds and starting times. This difficulty is further compounded when tracking multivariate dynamics, where features interact dynamically rather than following simple, independent pathways. To address these challenges, we present leaspy (LEArning Spatiotemporal patterns in PYthon), an open-source Python library. Built on a mixed effects model, leaspy enables the estimation of population-level trajectories while accounting for subject-specific variability. The library supports multivariate formulation across diverse data types, including continuous, time-to-event (joint), and mixture models-and has been successfully applied to characterize disease heterogeneity, and generate individual predictions We demonstrate its practical utility through an application in neurodegenerative disease progression. Developed following modern software engineering practices, including systematic testing and continuous integration, leaspy facilitates the integration of new models and provides a robust user-friendly library for longitudinal progression modeling.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juliette Ortholand, Sofia Kaisaridi, Nicolas Gensollen, Etienne Maheux, Caglayan Tuna, Raphael Couronne, Arnaud Valladier, Pierre-Emmanuel Poulet, Nemo Fournier, Léa Aguilhon, Maylis Tran, Gabrielle Casimiro, Jean-Vincent Martini, Sebastian Mendez, Igor Koval, Stanley Durrleman, Sophie Tezenas Du Montcel. 2026-08-10. leaspy: LEArning Spatiotemporal Patterns in PYthon. https://arxiv.org/abs/2608.09365

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

See You at the Posterior Line: Learning Bayesian Modeling Through a Car Racing Game

We present an interactive classroom activity designed to address a central challenge in teaching introductory Bayesian statistics: how to formalize subjective knowledge and available information into prior distributions and then update them with empirical data. Role-playing as data analysts for a racing team, students evaluate candidate tires by converting qualitative engineering reports into prior distributions, collecting primary data via a virtual racing game, and using a Beta-Binomial model to inform team strategy. This discovery-based exercise allows small groups to observe directly how different prior choices and sample data jointly shape posterior inference. Student feedback ($n=32$) highlights high enjoyment, engagement and improved conceptual clarity. Open-access materials to implement the activity are provided, alongside recommendations for adapting it to other teaching contexts.

stat.OT

Why is Regularization Underused? An Empirical Study on Trust and Adoption of Statistical Methods

Statistical practice does not automatically follow methodological innovation. Regularization methods, widely advocated to reduce overfitting and stabilize inference, are readily available in modern software, but are not consistently used by data analysts. We investigate this implementation gap in a large-scale empirical study of trust in, and acceptance of, regularization techniques, based on $N = 606$ data analysts. Drawing on measurement frameworks from technology acceptance research, we survey practitioners and embed a randomized experiment to test whether written recommendation of regularization methods increases trust or intended use. We find no evidence of such an effect. Instead, adoption intentions are strongly associated with analysts' perceptions of ease of implementation and practical benefit, such as improved bias control or interpretability. Perceived social norms also emerge as a central driver. These results indicate that uptake of statistical methodology depends less on formal recommendations than on usability, perceived utility, and community practice.

stat.OT

Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times

This paper studies a two-server split--merge queue with positively dependent subtask service times modeled through a latent-factor bivariate Erlang construction. An exact characterization of the split--merge completion time is obtained, including explicit formulas for its first two moments and the resulting mean waiting time. Under fixed marginal service-time distributions, independence is shown to stochastically increase the completion time and hence overestimate mean waiting time. Numerical illustrations show that this benchmark gap can be substantial.

stat.OT