Optimal Detection of a Change in Distribution
分布变化的最优检测AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究未知时点的分布突变和序贯报警,对应结构变化检测。
反馈分类问题分布变化的最优检测AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Suppose one is able to observe sequentially a series of independent observations $X_1, X_2, \cdots$ such that $X_1, X_2, \cdots, X_{\nu-1}$ are iid distributed according to a known distribution $F_0$ and $X_\nu, X_{\nu+1}, \cdots$ are iid distributed according to a known distribution $F_1$. Assume that $\nu$ is unknown and the problem is to raise an alarm as soon as possible after the distribution changes from $F_0$ to $F_1$. Formally, the problem is to find a stopping rule $N$ which in some sense minimizes $E(N - \nu\mid N\geq \nu)$ subject to a restriction $E(N\mid\nu = \infty) \geq B$. A stopping rule that is a limit of Bayes rules is first derived. Then an almost minimax rule is presented; i.e. a stopping rule $N^\ast$ is described which satisfies $E(N^\ast\mid\nu = \infty) = B$ for which \begin{equation*}\begin{split}\sup_{1\leq\nu < \infty}E(N^\ast - \nu\mid N^\ast \geq \nu) \\ - \inf_{\{\text{stopping rules} N|E(N| \nu=\infty)\geq B\}} \sup_{1\leq\nu < \infty}E(N - \nu \mid N \geq \nu) = o(1)\end{split}\end{equation*} where $o(1) \rightarrow 0$ as $B \rightarrow \infty$.