The Neyman-Pearson lemma for convex expectations
Abstract
We study the Neyman-Pearson problem for convex expectations on L∞(μ). The existence of the optimal test is given. Without assuming that the level sets of penalty functions are weakly compact, we prove that the optimal tests for convex expectations on L∞(μ) are just the classical Neyman-Pearson tests between a fixed representative pair of simple hypotheses. Then we show that the Neyman-Pearson problem for convex expectations on L1(μ) can be solved similarly.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.