2000 character limit reached
The Neyman-Pearson lemma for convex expectations
Published 4 Sep 2019 in math.PR | (1909.01518v2)
Abstract: We study the Neyman-Pearson problem for convex expectations on L{\infty}(\mu). 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{\infty}(\mu) 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 L{1}(\mu) can be solved similarly.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.