Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.