arXiv Statistics ML

Let Time Tell: Identification and Gaussian Process Estimation for Interrupted Time Series

arXiv Machine Learning
Jul 31

DoTime: A Synthetic Benchmark Generator for Interventional and Counterfactual Time Series

arXiv:2607. 27263v1 Announce Type: new Abstract: Most benchmarks for causal inference over time series are observational, small, or domain-specific, leaving interventional and counterfactual estimation under-served exactly where it matters most, such as in healthcare, policy evaluation, and climate science.

By Dennis Thumm, Billy Tim Anthony, Ying Chen
arXiv Machine Learning
Aug 28

Gaussian Processes and Reproducing Kernel Hilbert Spaces: Connections and Equivalences

The monograph explores the relationships between Gaussian processes and reproducing kernel Hilbert spaces (RKHS), two widely used approaches that rely on positive definite kernels. It examines how these frameworks connect and are equivalent across key topics such as regression, interpolation, numerical integration, distributional discrepancies, statistical dependence, and Gaussian process sample path properties. By establishing a unifying perspective based on the equivalence between the Gaussian Hilbert space and the RKHS, the work aims to bridge methods developed independently by the machine learning, statistics, and numerical analysis communities.

By Motonobu Kanagawa, Philipp Hennig, Dino Sejdinovic, Bharath K. Sriperumbudur
arXiv Machine Learning
Oct 16

Time-partitioning Gaussian Process Mixture Model

The Time-partitioning Gaussian Process Mixture Model (TPGPMM) is a Bayesian nonparametric framework that identifies persistent regimes and models nonstationary dependence in time series. It uses an adaptive Pitman–Yor prior on contiguous segmentations combined with regime-specific Gaussian processes, and learns change points and hyperparameters via a split–merge Metropolis-within-Gibbs sampler. Experiments on the CBOE Volatility Index and the 10‑year U.S. Treasury yield recover regime structures aligned with major market and monetary‑policy events, while variants that estimate observation noise improve predictive accuracy but may reduce sparsity or event alignment.

By Guilherme Piantino, Hedibert F. Lopes
arXiv Machine Learning
Jun 8

Automatic, Debiased, and Invariant Counterfactual Generation under General Interventions

arXiv:2606. 07399v1 Announce Type: cross Abstract: Generative models for counterfactual outcomes have great potential to support decision-making under complex interventions, but existing approaches are limited by unstable estimation, poor generalization across environments, and bias from nuisance model misspecification.

By Raphael C Kim, Jingsen Zhu, Ramin Zabih, Michele Santacatterina
arXiv Machine Learning
Oct 5

Predictively Oriented Gaussian Process Posteriors

arXiv:2610.03201v1 Announce Type: cross Abstract: Gaussian Processes (GPs) are a powerful tool for modelling and quantifying uncertainty in functional relationships. However, they require practitione...

By Callum Lau, Jeremias Knoblauch, Louis Sharrock
arXiv Machine Learning
Sep 29

Towards Universal Representation-Based Process Control

The paper proposes a new approach to window‑level monitoring of temporal processes by treating it as a reference‑based hypothesis test. Instead of relying on predefined parametric models, the method uses an empirical reference distribution derived from task‑ or domain‑specific data, combined with pretrained time‑series encoders, kernel density estimation, and conformal calibration to provide finite‑sample valid inference in a learned representation space. Classical concepts such as stationarity and cyclostationarity naturally emerge as special cases of this framework, and experiments show the method’s sensitivity to distributional changes while maintaining well‑calibrated inference under stable conditions.

By Jinmyeong Choi, Taesup Kim, Artur Dubrawski
arXiv Machine Learning
Oct 21

What Moved the Alarm Score? Causal Attribution with Exact Computation and Scarce-Incident Estimation

The paper introduces a method for attributing changes in alarm scores in industrial and scientific systems by modeling the problem as a Shapley game over hybrid structural causal models. It distinguishes between changes in structural functions and exogenous laws, providing a detailed, function/law-resolved explanation of how each type of change propagates to the alarm score. For ordered linear SCMs and quadratic scores, the authors present a polynomial‑time exact computation of the full Shapley vector and, for scarce incident data, a cross‑fitted estimation approach with error bounds and top‑k recovery guarantees, validated through experiments on controlled and real shifts.

By Masaaki Takada, Ryusei Shingaki
arXiv Machine Learning
Jul 8

Model-based Bootstrap of Controlled Markov Chains

arXiv:2605. 12410v2 Announce Type: replace-cross Abstract: We propose and analyze a model-based bootstrap for transition kernels in finite controlled Markov chains (CMCs) with possibly nonstationary or history-dependent control policies, a setting that arises naturally in offline reinforcement learning (RL) when the behavior policy generating the data is unknown.

By Ziwei Su, Imon Banerjee, Diego Klabjan