arXiv (All)
open access
Pollak's Minimax Quickest Change Detection: Non-Asymptotic Optimality
Although Pollak's minimax formulation is one of the central frameworks in quickest change detection (QCD), the strongest general optimality results available for it are predominantly \emph{asymptotic}, applying as the average run-length-to-false-alarm constraint, $γ$, tends to infinity. Exact result
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
- Pollak's Minimax Quickest Change Detection: Non-Asymptotic Optimality#790251
- Sharp Non-Asymptotic Analysis of the Penalized Challenger in $β$-EB-TCI for Bernoulli Bandits#1157222
- Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time#183233
- In Defense of Artificial Replacement#767637
- Ranking Experiments under Sequential Sampling#684603
Record · ID 794270
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