stat.MLJun 5, 2026

Empirical Transfer Operators and Finite-Sample Change Detection for Noisy Expanding Interval Maps

Authors: Aparna Rajput

Abstract

We study finite-sample change detection for one-dimensional noisy dynamical systems using partition-based empirical approximations of stationary behaviour. Given observations from an interval-valued process, we partition the state space, estimate a finite transition matrix from observed transitions between partition elements, and apply a small Doeblin-type regularisation to ensure a unique stationary distribution. From an initial reference segment, we compute a baseline empirical stationary distribution π^0,ρ\widehatπ_{0,ρ}. For each later sliding window, we compute π^t,ρ\widehatπ_{t,ρ} and define the score

St=π^t,ρπ^0,ρ1.S_t=\|\widehatπ_{t,ρ}-\widehatπ_{0,ρ}\|_1.

Large values of StS_t indicate a change in stationary behaviour relative to the baseline. The statistic detects changes in invariant density or stationary law, but not all possible changes in transition dynamics. Under explicit assumptions on empirical transition concentration, finite-state stationary distribution stability, partition approximation, regularisation bias, and noise stability, we derive a finite-sample bound for the empirical stationary density. The bound separates sampling error, regularisation bias, partition approximation error, and noise bias. We then obtain a single-window false-alarm guarantee and a sufficient detection condition when the invariant density changes by more than the estimation error. We illustrate the method on synthetic noisy beta-map change-point experiments.

Explore similar work

May 31, 2026stat.ML

Distribution-free changepoint localization after sequential change detection

This paper introduces a distribution-free framework for constructing post-detection confidence sets for changepoints after stopping a sequential change detection procedure. It is well known that conformal test martingales can be used to sequentially detect changes in distribution, but by themselves provide no inference for the time at which a proclaimed change occurred. Past work on post-detection inference requires pre- and post-change classes of distributions to be known, but this paper accomplishes localization of the changepoint without any distributional assumptions. We establish finite-sample coverage guarantees (conditional on correct detection). We provide non-asymptotic bounds on the conditional expected size of the confidence sets. Under suitable asymptotic regimes, we prove that the conditional expected size of the confidence set remains uniformly bounded and demonstrate strong empirical performance on simulated and real data. To the best of our knowledge, this is the first general distribution-free framework for sequential changepoint localization with valid post-detection coverage.
Aytijhya Saha, Aaditya Ramdas
May 13, 2026stat.ML

The Sample Complexity of Multiple Change Point Identification under Bandit Feedback

We study multiple change point localization under bandit feedback. An unknown piecewise-constant function on a compact interval can be queried sequentially at adaptively chosen inputs, and each query returns a noisy evaluation of the function. The goal is to identify a prescribed number of discontinuities, known as change points, within a target precision ηη and confidence level 1δ1-δ, while using as few samples as possible. We propose an adaptive algorithm that first detects intervals likely to contain change points and then refines their locations to precision ηη. We establish non-asymptotic upper bounds on its sample budget, together with corresponding lower bounds. Prior work shows that jump magnitudes alone determine the asymptotic sample complexity as δ0δ\to 0. We reveal that this picture is incomplete beyond this regime. We demonstrate, both empirically and theoretically, that for general δδ and ηη, the complexity is jointly governed by the jumps and the relative positions of the change points.
Maximilian Graf, Victor Thuot
Sep 8, 2026stat.ML

Distribution-free inference on the number of changepoints

Suppose we are given an ordered sequence of independent data whose distribution changes KK times at unknown locations, for some unknown K0K \geq 0. In this paper, we study the problem of performing distribution-free inference on KK. First, we show an impossibility result: any distribution-free upper confidence bound on KK must be trivial and uninformative. Then, using conformal pp-values, and under only the assumption that the data segments induced by the changepoints are exchangeable (within themselves) and mutually independent, we construct a finite-sample valid lower confidence bound on KK, which we call the Conformal LOwer bound on Changepoint Count (CLOCC). We show that CLOCC is the only feasible way to provide a lower bound on KK under the stated assumptions, a property we refer to as its universality. We provide practical guidelines for choosing score functions that yield efficient and tight lower bounds. We evaluate CLOCC in several synthetic and real-data experiments, where it provides informative lower bounds on KK, demonstrating its practical applicability.
Rohan Hore, Aaditya Ramdas