arXiv (All)
open access
Distribution-free inference on the number of changepoints
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 upp
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Polychromatic Partitions, Kingman Theory, and Ewens Sampling Formula#793367
- Polychromatic Partitions, Kingman Theory, and Ewens Sampling Formula#789363
- Fast Graph Laplacian Estimation using Effective Resistance#1049405
- A law of thin processes with neighbour-count thinning#1061367
- A Bayesian Approach to Membership Inference for Statistical Release#238496
Record · ID 985606
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive