EVIL: Evolving Interpretable Algorithms for Zero-Shot Inference on Event Sequences and Time Series with LLMs
Not on the map. Why?
Abstract (arXiv)
We introduce EVIL (EVolving Interpretable algorithms with LLMs), an approach that uses LLM-guided evolutionary search to discover simple, interpretable algorithms for dynamical systems inference. Rather than training neural networks on large datasets, EVIL evolves pure Python/NumPy programs that perform zero-shot, in-context inference across datasets. We apply EVIL to three distinct tasks: next-event prediction in temporal point processes, rate matrix estimation for Markov jump processes, and time series imputation. In each case, a single evolved algorithm generalizes across all evaluation datasets without per-dataset training (analogous to an amortized inference model). To the best of our knowledge, this is the first work to show that LLM-guided program evolution can discover a single compact inference function for these dynamical-systems problems. Across the three domains, the discovered algorithms are often competitive with, and even outperform, state-of-the-art deep learning models while being orders of magnitudes faster, and remaining fully interpretable.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 54 references that are in the map. First posted on arXiv 17 Apr 2026.
Builds on
28 of 54 references.
References · 28
- 2021CSDI: Conditional Score-based Diffusion Models for Probabilistic Time Series Imputationcited by 577
- 2015Illuminating search spaces by mapping elitescited by 406
- 2021Transformers Can Do Bayesian Inferencecited by 338
- 2018BRITS: Bidirectional Recurrent Imputation for Time Seriescited by 288
- 2022SAITS: Self-Attention-based Imputation for Time Seriescited by 167
- 2019Intensity-Free Learning of Temporal Point Processescited by 138
- 2017VAMPnets: Deep learning of molecular kineticscited by 135
- 2024LLM-SR: Scientific Equation Discovery via Programming with Large Language Modelscited by 117
- 2018Learning Tree-based Deep Model for Recommender Systemscited by 99
- 2021Transformer Embeddings of Irregularly Spaced Events and Their Participantscited by 90
- 2025Mathematical exploration and discovery at scalecited by 66
- 2022HYPRO: A Hybridly Normalized Probabilistic Model for Long-Horizon Prediction of Event Sequencescited by 57
16 more
- 2020Coarse Graining Molecular Dynamics with Graph Neural Networkscited by 56
- 2018Learning unknown ODE models with Gaussian processescited by 54
- 2019Imputing Missing Events in Continuous-Time Event Streamscited by 43
- 2024TSI-Bench: Benchmarking Time Series Imputationcited by 33
- 2022Exploring Generative Neural Temporal Point Processcited by 30
- 2021Long Horizon Forecasting With Temporal Point Processescited by 20
- 2024Decomposable Transformer Point Processescited by 15
- 2025Context parroting: A simple but tough-to-beat baseline for foundation models in scientific machine learningcited by 14
- 2024Zero-shot Imputation with Foundation Inference Models for Dynamical Systemscited by 13
- 2024Foundation Inference Models for Markov Jump Processescited by 13
- 2023Neural Markov Jump Processescited by 11
- 2023BayOTIDE: Bayesian Online Multivariate Time series Imputation with functional decompositioncited by 9
- 2023Interacting Diffusion Processes for Event Sequence Forecastingcited by 9
- 2025In-Context Learning of Stochastic Differential Equations with Foundation Inference Modelscited by 7
- 2025In-Context Learning of Temporal Point Processes with Foundation Inference Modelscited by 7
- 2026Foundation Inference Models for Ordinary Differential Equationscited by 3
Built on by
Not cited yet.