Generalized FGM dependence: Geometrical representation and convex bounds on sums
Building on the one-to-one relationship between generalized FGM copulas and multivariate Bernoulli distributions, we prove that the class of multivariate distributions with generalized FGM copulas is a convex polytope. Therefore, we find sharp bounds in this class for many aggregate risk measures, such as value-at-risk, expected shortfall, and entropic risk measure, by enumerating their values on the extremal points of the convex polytope. This is infeasible in high dimensions. We overcome this limitation by considering the aggregation of identically distributed risks with generalized FGM copula specified by a common parameter $p$. In this case, the analogy with the geometrical structure of the class of Bernoulli distribution allows us to provide sharp analytical bounds for convex risk measures.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Risk Aggregation under Dependence Uncertainty and an Order Constraint
We study the aggregation of two risks when the marginal distributions are known and the dependence structure is unknown, under the additional constraint that one risk is smaller than or equal to the other. Risk aggregati…
Convex Representation Learning for Generalized Invariance in Semi-Inner-Product Space
Invariance (defined in a general sense) has been one of the most effective priors for representation learning. Direct factorization of parametric models is feasible only for a small range of invariances, while regulariza…
Representation LearningHigh Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise
Stochastic first-order methods are standard for training large-scale machine learning models. Random behavior may cause a particular run of an algorithm to result in a highly suboptimal objective value, whereas theoretic…
Stochastic OptimizationNoninteractive Locally Private Learning of Linear Models via Polynomial Approximations
Minimizing a convex risk function is the main step in many basic learning algorithms. We study protocols for convex optimization which provably leak very little about the individual data points that constitute the loss f…
Generalized generalized linear models: Convex estimation and online bounds
We introduce a new computational framework for estimating parameters in generalized generalized linear models (GGLM), a class of models that extends the popular generalized linear models (GLM) to account for dependencies…
parameter estimation