Extreme Value Theory for Open Set Classification -- GPD and GEV Classifiers

DOI10.48550/ARXIV.1808.09902arXiv1808.09902MaRDI QIDQ147636

Publication date: 29 August 2018

Abstract: Classification tasks usually assume that all possible classes are present during the training phase. This is restrictive if the algorithm is used over a long time and possibly encounters samples from unknown classes. The recently introduced extreme value machine, a classifier motivated by extreme value theory, addresses this problem and achieves competitive performance in specific cases. We show that this algorithm can fail when the geometries of known and unknown classes differ. To overcome this problem, we propose two new algorithms relying on approximations from extreme value theory. We show the effectiveness of our classifiers in simulations and on the LETTER and MNIST data sets.