Generalized Orlicz Premia
- Generalized Orlicz premia are multiplicative premium functionals based on non-convex Orlicz-type loss functions, preserving monotonicity, positive homogeneity, and law invariance.
- The framework unifies diverse risk measures including geometric means, expectiles, and Lᵖ-quantiles, offering a common approach to risk assessment and robust statistics.
- Key structural properties such as cash-additivity, dual representations, and geometric convexity provide practical insights for linking arithmetic and multiplicative risk measures.
Generalized Orlicz premia are multiplicative premium functionals defined from an Orlicz-type loss function that need not be convex. In the formulation introduced in "Generalized Orlicz premia" (Aygün et al., 12 Jul 2025), the premium of a bounded nonnegative random variable is
with the convention that if and , then . The framework extends the classical convex Orlicz premium by relaxing convexity while preserving monotonicity, positive homogeneity, normalization, and law-invariance, and it is broad enough to include the geometric mean, quantiles, expectiles, and -quantiles (Aygün et al., 12 Jul 2025).
1. Definition and analytic setting
The construction is developed on a nonatomic probability space , with equalities and inequalities between random variables understood -almost surely. In the classical Orlicz setting, for a convex Young function with 0, the Orlicz space is
1
and the associated Luxemburg norm is
2
When the loss function is not convex, the corresponding admissible set is generally not a linear space. For that reason, the generalized theory takes as natural domain
3
and, for geometric constructions,
4
A generalized Orlicz function 5 is required to satisfy
6
7
This normalization enforces 8.
If 9 is finite, strictly increasing and continuous, then
0
This identifies 1 as the unique scaling factor that normalizes expected loss to one. The paper presents this as the multiplicative counterpart of certainty equivalents and connects it to M-estimation-type functionals through root-finding for the estimating equation 2 (Aygün et al., 12 Jul 2025).
The generalized definition should be distinguished from the classical convex Orlicz premium. In the convex case, if 3 is a convex Young function with 4 and 5, then
6
and 7 is a norm on 8 with the usual duality based on the conjugate
9
2. Structural properties
For 0 satisfying the generalized assumptions above, the premium 1 on 2 retains several structural properties that are standard in the convex theory. Specifically,
3
Thus the premium is monotone, positively homogeneous, and normalized (Aygün et al., 12 Jul 2025).
The paper also gives deterministic bounds. Writing
4
one has
5
These inequalities locate the premium between two scale parameters determined by the essential supremum of 6 and the effective support of 7.
Left-continuity of 8 is used to obtain min-attainment and a threshold criterion. If 9, then
0
and
1
The exposition emphasizes that without left-continuity, min-attainment and this threshold equivalence may fail.
Convexity of the premium is equivalent, up to mild auxiliary conditions, to convexity of the loss function. If 2 is convex, then 3 is convex. Conversely, under mild additional conditions, convexity of 4 implies convexity of 5. The premium is also law-invariant: 6
A useful interpretive point is that generalized Orlicz premia are presented as return risk measures rather than monetary risk measures. In this terminology, return risk measures are normalized, monotone, positively homogeneous maps on 7, whereas cash-additivity for premia,
8
is distinct from translation invariance for monetary risk measures, which takes the form 9 (Aygün et al., 12 Jul 2025).
3. Canonical examples and the scope of the framework
A central contribution of the generalized formulation is that it accommodates economically and statistically important functionals that fall outside the convex Orlicz setting.
The geometric mean is obtained by taking
0
which is concave and satisfies 1. In that case
2
The relevant domain restriction is 3 almost surely, or 4, so that 5 is finite. The paper identifies this as a prototypical geometrically convex example (Aygün et al., 12 Jul 2025).
Expectiles are also recovered exactly. For 6, define
7
Then
8
the 9-expectile of 0. Equivalently, 1 is the unique solution of
2
or the minimizer of
3
The first-order condition matches the balancing equation.
The paper further records several additional examples. With a suitable step function 4, 5 yields the left 6-quantile. For 7, the choice 8 yields
9
More generally,
0
gives an 1-quantile: 2 solves
3
These examples clarify the breadth of the generalized framework. The geometric mean is multiplicative and non-convex, expectiles are elicitable and cash-additive, and quantile-type constructions emerge from step or power losses. This suggests that generalized Orlicz premia function as a unifying device for functionals that are usually treated in separate literatures on risk measurement, robust statistics, and forecast evaluation (Aygün et al., 12 Jul 2025).
4. Cash-additivity and collapse to 4-quantiles
One of the main structural theorems concerns the consequences of imposing cash-additivity,
5
Under the assumptions that 6 is finite, continuous and strictly increasing, the paper proves that if 7 is cash-additive, then there exist 8 and 9 such that
0
If, in addition, 1 is convex, or alternatively concave, then necessarily 2 and
3
so that 4 is an expectile (Aygün et al., 12 Jul 2025).
This yields a generalized collapse theorem. In the classical convex theory, cash-additivity is associated with a “collapse to the mean.” The new result extends that statement by showing that, without assuming convexity of 5, cash-additivity forces the premium into the family of 6-quantiles. Convexity or concavity then refines the conclusion to the expectile case.
The relevant notion of 7-quantile, for 8, is any minimizer
9
The paper notes that existence follows under mild integrability, and that uniqueness holds for 0 under strictly convex loss. Special cases include 1, which yields the mean, and 2, which yields the median(s).
The theory also records one-sided variants. For
3
one obtains cash-subadditivity if 4 and cash-superadditivity if 5, whereas exact cash-additivity forces 6.
The broader implication is that additive consistency in premium units is highly restrictive in the multiplicative Orlicz setting. A plausible implication is that non-convexity does not generate arbitrary new cash-additive premia; rather, it enlarges the family from classical linear expectile-type objects to the full 7-quantile class (Aygün et al., 12 Jul 2025).
5. Geometric convexity and dual representation
A substantial part of the theory replaces ordinary convexity by geometric convexity. For functions 8, GG-convexity means
9
and GA-convexity means
00
The paper proves the equivalences
01
together with GG-convex 02 GA-convex, and the fact that for monotone convex 03, GA-convexity holds automatically (Aygün et al., 12 Jul 2025).
For functionals 04, GG-convexity is defined by
05
while GA-convexity uses the corresponding arithmetic combination on the right-hand side. Within this framework, if 06 is GA-convex, then 07 is GG-convex; conversely, under mild conditions, GG-convexity of 08 implies GA-convexity of 09.
The dual representation in the convex arithmetic case takes the form
10
with multiplicative penalty
11
For convex Orlicz premia 12, the penalty is explicitly
13
where 14 is the convex conjugate of 15.
In the geometrically convex case, the dual form becomes multiplicative: 16 with
17
For GA-convex generalized Orlicz premia 18,
19
The exposition describes this as structurally analogous to the convex case but with the geometric mean as the basic block.
The connection between arithmetic and geometric duality is made explicit by relative entropy. If a convex return risk measure admits
20
then it also admits
21
where
22
and
23
is the relative entropy. This identifies a multiplicative transformation linking the arithmetic and geometric dual forms (Aygün et al., 12 Jul 2025).
6. Elicitability, stability, and relation to Haezendonck–Goovaerts premia
The paper’s final major characterization concerns elicitability. A functional 24 is elicitable if there exists a strictly proper scoring function 25 such that, for all integrable 26,
27
with unique minimizer. Equivalently, there exists an identification function 28 with 29 and a strict identification property.
A necessary condition for elicitability is the CxLS property, meaning convex level sets under mixtures on distributions. The paper shows that if 30 is law-invariant, GG-convex, and has CxLS, then 31 for some GA-convex Orlicz function 32. If 33 is law-invariant, convex, and has CxLS, then 34 for some convex Orlicz function 35. Generalized Orlicz premia are therefore characterized as the law-invariant return risk measures that are GG-convex or convex and elicitable via CxLS (Aygün et al., 12 Jul 2025).
Two examples are emphasized. The geometric mean satisfies
36
with strictly consistent score 37 and identification 38. Expectiles satisfy
39
and admit the identification
40
This generalized theory is naturally compared with the classical Haezendonck–Goovaerts premium principles, which are Orlicz-based premia on the natural domain 41. For a finite-valued Young function 42 with 43 and 44, the Haezendonck–Goovaerts premium is
45
where
46
These premia are sublinear, monotone, translation invariant, law-invariant, and Lipschitz in the Orlicz norm. They always satisfy the Fatou property, and they satisfy the Lebesgue property if and only if 47 fulfills the 48 condition (Gao et al., 2019).
The dual representation of the Haezendonck–Goovaerts premium is
49
where
50
This classical result provides the convex Orlicz benchmark against which generalized Orlicz premia are formulated. The generalized theory departs from the linear-space setting of 51, accommodates non-convex 52, and replaces arithmetic dual blocks by multiplicative geometric ones when GG-convexity is imposed. A plausible implication is that generalized Orlicz premia extend rather than supplant the Haezendonck–Goovaerts framework: the latter remains the natural convex, translation-invariant model on Orlicz spaces, while the former captures multiplicative and elicitable functionals that classical convexity excludes (Gao et al., 2019).