I study dynamical systems through probability and statistical learning. My recent work has focused on two related questions: what can we learn about a system from a single observed trajectory, and what can we say about its behavior over long time horizons? The first concerns learning and prediction from dependent data; the second includes quantitative bounds for the convergence of occupation measures toward invariant distributions. I use tools from Markov chains, concentration inequalities, kernel methods, and operator theory. I am also interested in applying ideas and tools from dynamical systems to optimization, flows, and optimal transport.
Previously, I was a Principal Software Engineer at Riot Games, serving as tech lead of the AI/ML team working on League of Legends.
02 / Publications & preprints
Selected writing.
Research papers on probability, learning, control, and distributions.
Oleksii Kachaiev, Luc Brogat-Motte, Silvia Villa, Lorenzo Rosasco
High-probability bounds for the convergence of a Markov chain’s occupation measure in MMD, separating the roles of the spectral gap and kernel relaxation, with an application to one-step prediction from a single trajectory.
A direct operator proof of sharp Hoeffding bounds for Markov chains with an L² spectral gap, extending the same argument to Markov-dependent random matrices.
Edoardo Caldarelli, Oleksii Kachaiev, Cesare Molinari, Lorenzo Rosasco
Learns a switching predictive model for nonlinear dynamics from data, then uses it in model predictive control, with bounds for learning error and control performance.
Studies learning from one dependent trajectory, giving guarantees for prediction and extensions to higher-order systems, finite-state dynamics, and Koopman operators.
Yanis Lalou, Théo Gnassounou, Antoine Collas, Antoine de Mathelin, Oleksii Kachaiev, Ambroise Odonnat, Alexandre Gramfort, Thomas Moreau, Rémi Flamary
A reproducible benchmark for unsupervised domain adaptation across images, text, biomedical, and tabular data, with particular attention to realistic model selection.
Learns a data-dependent kernel between probability distributions by maximizing entropy in an embedding space, yielding useful geometry for downstream tasks.
A scikit-learn and PyTorch-compatible library for domain adaptation, with estimators, pipelines, and tools for evaluating methods under distribution shift.