OpenAlex ·
Robust Quickest Change Detection with Cost-Efficient Experiment Design and Unknown Post-Change Model
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.16055
- Original
- Read it at the publisher
- Topics
Abstract
A quickest change detection problem is studied where the decision-maker has access to multiple experiments, but can choose only one experiment at a time to detect the change. The true post-change distribution under each experiment is unknown, but known to belong to a family of distributions. It is assumed that each of these families of distributions has an element that is least favorable in a well-defined sense. An algorithm is proposed that is designed using the least favorable distributions. It is shown that the algorithm is first-order asymptotically optimal, as the rate of false alarms goes to zero. This algorithm minimizes the worst-case average detection delay over all post-change distributions within the assumed families, subject to a constraint on the average run length to false alarm and constraints on the average fraction of time each experiment is performed before change.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Networking & Internet
NetRL: Powering Network Decisions via NetGRPO-Driven Reinforcement Learning
CALM-5G: Event-Level Conformal Risk Control for Predictive Service-Assurance Alarms
Sample-Size Extrapolation in Simulation-Based Inference via Statistical Scaling
HILO: Enabling Low-power, Dual-Band Communication using Tunnel Diode Oscillators
Towards Resilience: Slice-Driven Orchestration of Mobile IoMT in 6G-Edge-Continuum
Get the few papers worth your time in Networking & Internet every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.