AI & ML
FAST: Functional Adaptive Sensing and Testing for Quickest Change Detection
arXiv math.IT0 views
arXiv:2611.22581v1 Announce Type: cross Abstract: 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.
Source:https://arxiv.org/abs/2611.22581PreviousSemantic Communication via Analog RF Computing: When the Radio Computes the MeaningNextPluggable Subband-Decoupled Fusion and Unlabeled Capture Prototype Calibration: Bridging High-SNR Null-Subcarrier Regrowth and Low-SNR Coherent Preambles for Cross-Domain IoT RF Fingerprinting
Related posts

The Download: AI learns to smell and hydropower struggles
0MIT Technology Review

Nvidia isn’t selling any more AI chips to China
0The Verge
Nvidia clarifies when it will — and won’t —keep financing neoclouds
0TechCrunch

Google Home speakers get a major Gemini upgrade ‘soon,’ but only for paid subscribers
09to5Google

NVIDIA's CEO Shake-Up Exposes a Costly Prediction Market Deadline
0HackerNoon
Lumi-4B AI Model: Everything You Need to Know
0HackerNoon