Displaying similar documents to “Large deviations and isoperimetry over convex probability measures with heavy tails.”

φ PHI-divergences, sufficiency, Bayes sufficiency, and deficiency

Friedrich Liese (2012)

Kybernetika

Similarity:

The paper studies the relations between φ -divergences and fundamental concepts of decision theory such as sufficiency, Bayes sufficiency, and LeCam’s deficiency. A new and considerably simplified approach is given to the spectral representation of φ -divergences already established in Österreicher and Feldman [28] under restrictive conditions and in Liese and Vajda [22], [23] in the general form. The simplification is achieved by a new integral representation of convex functions in terms...

The gamma-uniform distribution and its applications

Hamzeh Torabi, Narges Montazeri Hedesh (2012)

Kybernetika

Similarity:

Up to present for modelling and analyzing of random phenomenons, some statistical distributions are proposed. This paper considers a new general class of distributions, generated from the logit of the gamma random variable. A special case of this family is the Gamma-Uniform distribution. We derive expressions for the four moments, variance, skewness, kurtosis, Shannon and Rényi entropy of this distribution. We also discuss the asymptotic distribution of the extreme order statistics,...

Chance constrained problems: penalty reformulation and performance of sample approximation technique

Martin Branda (2012)

Kybernetika

Similarity:

We explore reformulation of nonlinear stochastic programs with several joint chance constraints by stochastic programs with suitably chosen penalty-type objectives. We show that the two problems are asymptotically equivalent. Simpler cases with one chance constraint and particular penalty functions were studied in [6,11]. The obtained problems with penalties and with a fixed set of feasible solutions are simpler to solve and analyze then the chance constrained programs. We discuss solving...

Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities

Imre Csiszár, František Matúš (2012)

Kybernetika

Similarity:

Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The integrands are finite on the positive and infinite on the negative numbers, strictly convex but not necessarily differentiable. The minimization is viewed as a primal problem and studied together with a dual one in the framework of convex duality. The effective domain of the value function is described by a conic core, a modification of the earlier concept of convex core....