Minimax Tests and the Neyman-Pearson Lemma for Capacities
1973; Institute of Mathematical Statistics; Volume: 1; Issue: 2 Linguagem: Inglês
10.1214/aos/1176342363
ISSN2168-8966
AutoresPeter J. Huber, Volker Strassen,
Tópico(s)Machine Learning and Algorithms
ResumoRobust test problems between two approximately known simple hypotheses can be formalized as minimax test problems between two composite hypotheses. We show that if the composite hypotheses can be described in terms of alternating capacities of order 2 (in the sense of Choquet), then the minimax tests are ordinary Neyman-Pearson tests between a fixed representative pair of simple hypotheses; moreover, the condition is in a certain sense also necessary. All the neighborhoods customarily used to formalized approximate knowledge happen to have this particular structure.
Referência(s)