arXiv (All)
open access
Robust Quickest Change Detection with Cost-Efficient Experiment Design and Unknown Post-Change Model
A quickest change detection problem is studied where the decision-maker has access to multiple experiments, but can choose only one experiment at a time to detect the change. The true post-change distribution under each experiment is unknown, but known to belong to a family of distributions. It is a
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
- Measuring the Value of World-Model Updates: A Counterfactual Utility Protocol for Continual Adaptation#998527
- Change detection with conformal martingales: new optimal constructions, and suboptimality of existing methods#1063390
- Consistency of penalized maximum likelihood estimation for multidimensional change-in-velocity detection#1199465
- Changepoint Detection as Model Selection: A General Framework#249839
- Online Inference for Multiple Changepoint Problems.#1039635
Record · ID 1327645
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