When is the rate function of a random vector strictly convex?
Vladislav Vysotsky

TL;DR
This paper establishes a necessary and sufficient condition for the strict convexity of the rate function of a random vector in , especially when the vector has a finite Laplace transform, and describes its effective domain under weaker conditions.
Contribution
It provides a complete characterization of when the rate function is strictly convex and describes its effective domain under less restrictive assumptions.
Findings
Strict convexity characterized by a necessary and sufficient condition.
Finite Laplace transform guarantees strict convexity.
Complete description of the effective domain under weaker conditions.
Abstract
We give a necessary and sufficient condition for strict convexity of the rate function of a random vector in . This condition is always satisfied when the random vector has finite Laplace transform. We also completely describe the effective domain of the rate function under a weaker condition.
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.
