TY - GEN
T1 - Universal outlier hypothesis testing
AU - Li, Yun
AU - Nitinawarat, Sirin
AU - Veeravalli, Venugopal V.
PY - 2013
Y1 - 2013
N2 - The following outlier hypothesis testing problem is studied in a universal setting. Vector observations are collected each with M ≥ 3 coordinates. When a given coordinate is the outlier, the observations in that coordinate are assumed to be distributed according to the 'outlier' distribution, distinct from the common 'typical' distribution governing the observations in all the other coordinates. Nothing is known about the outlier and the typical distributions except that they are distinct and have full supports. The goal is to design a universal test to best discern the outlier coordinate. A universal test based on the generalized likelihood principle is proposed and is shown to be universally exponentially consistent, and a single-letter characterization of the error exponent achievable by the test is derived. It is shown that as the number of coordinates approaches infinity, our universal test is asymptotically efficient. Specifically, it achieves a limiting error exponent that is equal to the largest achievable error exponent when the outlier and typical distributions are both known.
AB - The following outlier hypothesis testing problem is studied in a universal setting. Vector observations are collected each with M ≥ 3 coordinates. When a given coordinate is the outlier, the observations in that coordinate are assumed to be distributed according to the 'outlier' distribution, distinct from the common 'typical' distribution governing the observations in all the other coordinates. Nothing is known about the outlier and the typical distributions except that they are distinct and have full supports. The goal is to design a universal test to best discern the outlier coordinate. A universal test based on the generalized likelihood principle is proposed and is shown to be universally exponentially consistent, and a single-letter characterization of the error exponent achievable by the test is derived. It is shown that as the number of coordinates approaches infinity, our universal test is asymptotically efficient. Specifically, it achieves a limiting error exponent that is equal to the largest achievable error exponent when the outlier and typical distributions are both known.
UR - http://www.scopus.com/inward/record.url?scp=84890340522&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890340522&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620710
DO - 10.1109/ISIT.2013.6620710
M3 - Conference contribution
AN - SCOPUS:84890340522
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2666
EP - 2670
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -