SOURCE-LINKED INTELLIGENCE

Distribution-free inference on the number of changepoints

arXiv · AI, language, vision and robotics · article · Sep 8, 2026 · UTC

Suppose we are given an ordered sequence of independent data whose distribution changes $K$ times at unknown locations, for some unknown $K \geq 0$. In this paper, we study the problem of performing distribution-free inference on $K$. First, we show an impossibility result: any distribution-free upper confidence bound on $K$ must be trivial and uninformative. Then, using conformal $p$-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

Read original source ↗ Open in workspace

recordType

paper

region

Global