跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22581 · v1

FAST: Functional Adaptive Sensing and Testing for Quickest Change Detection

首次提交 2026-11-17 19:05
版本更新 2026-11-17 19:05
雷达观测 2026-11-18 11:33
arXiv ↗PDF ↗

摘要

Quickest change detection (QCD) is studied for partially observed functional data streams. At each sampling epoch, a function is realized over a continuous domain, but its values can be observed at only a fixed number of locations. At an unknown change point, the functional mean undergoes a shift that is assumed to admit a sparse representation in a localized basis. We propose Functional Adaptive Sensing and Testing (FAST), which jointly estimates the unknown post-change parameter, selects sensing locations, and performs sequential detection. A minimax lower bound on the worst-case detection delay is derived under an average-run-length constraint. A non-asymptotic estimation-error bound is established for the policy-dependent observations induced by adaptive sensing. Under the stated regularity conditions, FAST is first-order asymptotically optimal when sensing subsets are optimized exactly. Simulations and a wildfire case study demonstrate the performance of the proposed procedure.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 19:05 · 最新观测版本

FAST: Functional Adaptive Sensing and Testing for Quickest Change Detection

Quickest change detection (QCD) is studied for partially observed functional data streams. At each sampling epoch, a function is realized over a continuous domain, but its values can be observed at only a fixed number of locations. At an unknown change point, the functional mean undergoes a shift that is assumed to admit a sparse representation in a localized basis. We propose Functional Adaptive Sensing and Testing (FAST), which jointly estimates the unknown post-change parameter, selects sensing locations, and performs sequential detection. A minimax lower bound on the worst-case detection delay is derived under an average-run-length constraint. A non-asymptotic estimation-error bound is established for the policy-dependent observations induced by adaptive sensing. Under the stated regularity conditions, FAST is first-order asymptotically optimal when sensing subsets are optimized exactly. Simulations and a wildfire case study demonstrate the performance of the proposed procedure.

查看此版本解读 →查看此版本原文 ↗