We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.IT

Change to browse by:

References & Citations

DBLP - CS Bibliography

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Information Theory

Title: Sequential Outlier Hypothesis Testing under Universality Constraints

Authors: Jun Diao, Lin Zhou
Abstract: We revisit sequential outlier hypothesis testing and derive bounds on the achievable exponents. Specifically, the task of outlier hypothesis testing is to identify the set of outliers that are generated from an anomalous distribution among all observed sequences where most are generated from a nominal distribution. In the sequential setting, one obtains a sample from each sequence per unit time until a reliable decision could be made. We assume that the number of outliers is known while both the nominal and anomalous distributions are unknown. For the case of exactly one outlier, our bounds on the achievable exponents are tight, providing exact large deviations characterization of sequential tests and strengthening a previous result of Li, Nitinawarat and Veeravalli (2017). In particular, we propose a sequential test that has bounded average sample size and better theoretical performance than the fixed-length test, which could not be guaranteed by the corresponding sequential test of Li, Nitinawarat and Veeravalli (2017). Our results are also generalized to the case of multiple outliers.
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2404.14221 [cs.IT]
  (or arXiv:2404.14221v2 [cs.IT] for this version)

Submission history

From: Jun Diao [view email]
[v1] Mon, 22 Apr 2024 14:33:02 GMT (63kb)
[v2] Wed, 24 Apr 2024 09:50:54 GMT (63kb)

Link back to: arXiv, form interface, contact.