2020 IEEE International Symposium on Information Theory (ISIT) 2020
DOI: 10.1109/isit44484.2020.9174114
|View full text |Cite
|
Sign up to set email alerts
|

Second-Order Asymptotically Optimal Change-point Detection Algorithm with Sampling Control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…One study develops a second-order asymptotically optimal algorithm when only one location (or stream) is assumed to change. 25 The algorithm samples from a single location until determining there is no change, moves to another location and continues until becoming confident there is no change, eventually cycling through all locations until an alarm is raised. Another study uses TS to sample statistics for each location based on the Shiraev-Roberts procedure.…”
Section: Introductionmentioning
confidence: 99%
“…One study develops a second-order asymptotically optimal algorithm when only one location (or stream) is assumed to change. 25 The algorithm samples from a single location until determining there is no change, moves to another location and continues until becoming confident there is no change, eventually cycling through all locations until an alarm is raised. Another study uses TS to sample statistics for each location based on the Shiraev-Roberts procedure.…”
Section: Introductionmentioning
confidence: 99%