The Neyman-Pearson lemma for convex expectations
Sun Chuanfeng, Ji Shaolin

TL;DR
This paper extends Neyman-Pearson theory to convex expectations, introducing a new approach that avoids weak compactness assumptions and applies minimax theorems to identify optimal tests and measures.
Contribution
It proposes a novel method for Neyman-Pearson theory under convex expectations, using weak* topology compactness and duality, applicable to financial risk minimization.
Findings
Established a new approach for convex expectation Neyman-Pearson tests.
Identified representative probability measures via minimax and duality.
Applied results to shortfall risk minimization in incomplete markets.
Abstract
We study the Neyman-Pearson theory for convex expectations (convex risk measures) on . Without assuming that the level sets of penalty functions are weakly compact, a new approach different from the convex duality method is proposed to find a representative pair such that the optimal tests are just the classical Neyman-Pearson tests between the representative probabilities and . The key observation is that the feasible test set is compact in the weak topology by a generalized result of Banach-Alaoglu theorem. Then the minimax theorem can be applied and the representative probability is found first. Secondly, under the probability , we find the representative probability measure by solving a dual problem. Finally, we apply our results to a shortfall risk minimizing problem in an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProcess Optimization and Integration
