arXiv (All)
open access
Approximately Optimal Multi-Stream Quickest Change Detection
This paper considers the constrained sampling multi-stream quickest change detection problem, also known as the bandit quickest change detection problem. One stream contains a change-point that shifts its mean by an unknown amount. The goal is to quickly detect this change while controlling for fals
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
- Learner-based Concept Drift Detection: Analysis and Evaluation#290603
- A more efficient algorithm to compute the Rand Index for change-point problems#665417
- A more efficient algorithm to compute the Rand Index for change-point problems#663917
- The Real-time Cost of Timing Uncertainty: Consensus and Failure Detection#464630
- The Price of Self-Calibration: Exact Evidence Budgets and Manufactured Blind Sets in Adaptive Monitoring#1048998
Record · ID 984974
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