Log-concave distributions: definitions, properties, and consequences

Size: px
Start display at page:

Download "Log-concave distributions: definitions, properties, and consequences"

Transcription

1 Log-concave distributions: definitions, properties, and consequences Jon A. Wellner University of Washington, Seattle; visiting Heidelberg Seminaire, Institut de Mathématiques de Toulouse 28 February 202

2 Seminaire, Toulouse Part, 28 February Part 2, 28 February Chernoff s distribution is log-concave

3 Seminaire 2, Thursday, March: Strong log-concavity of Chernoff s density; problems connections and Seminaire 3, Monday, 5 March: Nonparametric estimation of log-concave densities Seminaire 4, Thursday, 8 March: A local maximal inequality under uniform entropy

4 Outline, Part : 2: 3: 4: 5: 6: 7. Log-concave densities / distributions: definitions Properties of the class Some consequences (statistics and probability) Strong log-concavity: definitions Examples & counterexamples Some consequences, strong log-concavity Questions & problems Seminar, Institut de Mathématiques de Toulouse; 28 February 202.3

5 . Log-concave densities / distributions: definitions Suppose that a density f can be written as f(x) f ϕ (x) = exp(ϕ(x)) = exp ( ( ϕ(x))) where ϕ is concave (and ϕ is convex). The class of all densities f on R, or on R d, of this form is called the class of log-concave densities, P log concave P 0. Note that f is log-concave if and only if : logf(λx+( λ)y) λlogf(x)+( λ)logf(y) for all 0 λ and for all x, y. iff f(λx + ( λ)y) f(x) λ f(y) λ iff f((x + y)/2) iff f((x + y)/2) 2 f(x)f(y). f(x)f(y), (assuming f is measurable) Seminar, Institut de Mathématiques de Toulouse; 28 February 202.4

6 . Log-concave densities / distributions: definitions Examples, R Example : standard normal f(x) = (2π) /2 exp( x 2 /2), logf(x) = 2 x2 + log 2π, ( logf) (x) =. Example 2: Laplace f(x) = 2 exp( x ), logf(x) = x + log2, ( logf) (x) = 0 for all x 0. Seminar, Institut de Mathématiques de Toulouse; 28 February 202.5

7 . Log-concave densities / distributions: definitions Example 3: Logistic Example 4: Subbotin e x f(x) = ( + e x ) 2, logf(x) = x + 2log( + e x ), ( logf) e x (x) = ( + e x ) 2 = f(x). f(x) = C r exp( x r /r), C r = 2Γ(/r)r /r, logf(x) = r x r + logc r, ( logf) (x) = (r ) x r 2, r, x 0. Seminar, Institut de Mathématiques de Toulouse; 28 February 202.6

8 . Log-concave densities / distributions: definitions Many univariate parametric families on R are log-concave, for example: Normal (µ, σ 2 ) Uniform(a, b) Gamma(r, λ) for r Beta(a, b) for a, b Subbotin(r) with r. t r densities with r > 0 are not log-concave Tails of log-concave densities are necessarily sub-exponential: i.e. if X f P F 2, then Eexp(c X ) < for some c > 0. Seminar, Institut de Mathématiques de Toulouse; 28 February 202.7

9 . Log-concave densities / distributions: definitions Log-concave densities on R d : A density f on R d is log-concave if f(x) = exp(ϕ(x)) with ϕ concave. Examples The density f of X N d (µ, Σ) with Σ positive definite: ( f(x) = f(x; µ, Σ) = exp (2π) d Σ 2 (x µ)t Σ (x µ) logf(x) = 2 (x µ)t Σ (x µ) (/2)log(2π Σ), D 2 ( logf)(x) ( 2 x i x j ( logf)(x), i, j =,..., d ) ) = Σ. If K R d is compact and convex, then f(x) = K (x)/λ(k) is a log-concave density., Seminar, Institut de Mathématiques de Toulouse; 28 February 202.8

10 . Log-concave densities / distributions: definitions Log-concave measures: Suppose that P is a probability measure on (R d, B d ). P is a logconcave measure if for all nonempty A, B B d and λ (0, ) we have P (λa + ( λ)b) {P (A)} λ {P (B)} λ. A set A R d is affine if tx + ( t)y A for all x, y A, t R. The affine hull of a set A R d is the smallest affine set containing A. Theorem. (Prékopa (97, 973), Rinott (976)). Suppose P is a probability measure on B d such that the affine hull of supp(p ) has dimension d. Then P is log-concave if and only if there is a log-concave (density) function f on R d such that P (B) = B f(x)dx for all B B d. Seminar, Institut de Mathématiques de Toulouse; 28 February 202.9

11 2. Properties of log-concave densities Properties: log-concave densities on R: A density f on R is log-concave if and only if its convolution with any unimodal density is again unimodal (Ibragimov, 956). Every log-concave density f is unimodal (but need not be symmetric). P 0 is closed under convolution. P 0 is closed under weak limits Seminar, Institut de Mathématiques de Toulouse; 28 February 202.0

12 2. Properties of log-concave densities Properties: log-concave densities on R d : Any log concave f is unimodal. The level sets of f are closed convex sets. Log-concave densities correspond to log-concave measures. Prékopa, Rinott. Marginals of log-concave distributions are log-concave: f(x, y) is a log-concave density on R m+n, then g(x) = f(x, y)dy Rn is a log-concave density on R m. Prékopa, Brascamp-Lieb. if Products of log-concave densities are log-concave. P 0 is closed under convolution. P 0 is closed under weak limits. Seminar, Institut de Mathématiques de Toulouse; 28 February 202.

13 3. Some consequences and connections (statistics and probability) (a) f is log-concave if and only if det((f(x i y j )) i,j {,2} ) 0 for all x x 2, y y 2 ; i.e f is a Polya frequency density of order 2; thus log-concave = P F 2 = strongly uni-modal (b) The densities p θ (x) f(x θ) for θ R have monotone likelihood ratio (in x) if and only if f is log-concave. Proof of (b): p θ (x) = f(x θ) has MLR iff f(x θ ) f(x θ) f(x θ ) f(x θ) This holds if and only if for all x < x, θ < θ logf(x θ ) + logf(x θ) logf(x θ ) + logf(x θ). () Let t = (x x)/(x x + θ θ) and note that Seminar, Institut de Mathématiques de Toulouse; 28 February 202.2

14 3. Some consequences and connections (statistics and probability) x θ = t(x θ ) + ( t)(x θ), x θ = ( t)(x θ ) + t(x θ) Hence log-concavity of f implies that logf(x θ) t logf(x θ ) + ( t)logf(x θ), logf(x θ ) ( t)logf(x θ ) + t logf(x θ). Adding these yields (??); i.e. MLR in x. f log-concave implies p θ (x) has Now suppose that p θ (x) has MLR so that (??) holds. In particular that holds if x, x, θ, θ satisfy x θ = a < b = x θ and t = (x x)/(x x+θ θ) = /2, so that x θ = (a+b)/2 = x θ. Then (??) becomes logf(a) + logf(b) 2logf((a + b)/2). This together with measurability of f implies that f is logconcave. Seminar, Institut de Mathématiques de Toulouse; 28 February 202.3

15 3. Some consequences and connections (statistics and probability) Proof of (a): Suppose f is P F 2. Then for x < x, y < y, ( f(x y) f(x y det ) ) f(x y) f(x y ) if and only if or, if and only if = f(x y)f(x y ) f(x y )f(x y) 0 f(x y )f(x y) f(x y)f(x y ), That is, p y (x) has MLR in x. log-concave. f(x y ) f(x y) f(x y ) f(x y). By (b) this is equivalent to f Seminar, Institut de Mathématiques de Toulouse; 28 February 202.4

16 3. Some consequences and connections (statistics and probability) Theorem. (Brascamp-Lieb, 976). Suppose X f = e ϕ with ϕ convex and D 2 ϕ > 0, and let g C (R d ). Then V ar f (g(x)) E (D 2 ϕ) g(x), g(x). (Poincaré - type inequality for log-concave densities) Seminar, Institut de Mathématiques de Toulouse; 28 February 202.5

17 3. Some consequences and connections (statistics and probability) Further consequences: Peakedness and majorization Theorem. (Proschan, 965) Suppose that f on R is logconcave and symmetric about 0. Let X,..., X n be i.i.d. with density f, and suppose that p, p R n + satisfy p p 2 p n, p p 2 p n, k p j k p j, k {,..., n}, n p j = n p j =. (That is, p p.) Then n p j X j is strictly more peaked than n p j X j : P n p j X j t < P n p j X j t for all t 0. Seminar, Institut de Mathématiques de Toulouse; 28 February 202.6

18 3. Some consequences and connections (statistics and probability) Example: p = = p n = /(n ), p n = 0, while p = = p n = /n. Then p p (since n p j = n p j = and k p j = k/(n ) k/n = k p j ), and hence if X,..., X n are i.i.d. f symmetric and log-concave, P ( X n t) < P ( X n t) < < P ( X t) for all t 0. Definition: A d dimensional random variable X is said to be more peaked than a random variable Y if both X and Y have densities and P (Y A) P (X A) for all A A d, the class of subsets of R d symmetric about the origin. which are compact, convex, and Seminar, Institut de Mathématiques de Toulouse; 28 February 202.7

19 3. Some consequences and connections (statistics and probability) Theorem 2. (Olkin and Tong, 988) Suppose that f on R d is log-concave and symmetric about 0. Let X,..., X n be i.i.d. with density f, and suppose that a, b R n satisfy a a 2 a n, b b 2 b n, k a j k b j, k {,..., n}, n a j = n b j. (That is, a b.) Then n a j X j is more peaked than n b j X j : P n In particular, P n a j X j A P n a j X j t P b j X j A for all A A d n b j X j t for all t 0. Seminar, Institut de Mathématiques de Toulouse; 28 February 202.8

20 3. Some consequences and connections (statistics and probability) Corollary: If g is non-decreasing on R + with g(0) = 0, then Eg n Another peakedness result: a j X j Eg n b j X j Suppose that Y = (Y,..., Y n ) where Y j N(µ j, σ 2 ) are independent and µ... µ n ; i.e. µ K n where K n {x R n : x x n }. Let µ n = Π(Y K n ), the least squares projection of Y onto K n. It is well-known that ( sj=r ) µ n = min max Y j s i r i s r +, i =,..., n.. Seminar, Institut de Mathématiques de Toulouse; 28 February 202.9

21 3. Some consequences and connections (statistics and probability) Theorem 3. (Kelly) If Y N n (µ, σ 2 I) and µ K n, then µ k µ k is more peaked than Y k µ k for each k {,..., n}; that is P ( µ k µ k t) P ( Y k µ k t) for all t > 0, k {,..., n}. Question: Does Kelly s theorem continue to hold if the normal distribution is replaced by an arbitrary log-concave joint density symmetric about µ? Seminar, Institut de Mathématiques de Toulouse; 28 February

22 4. Strong log-concavity: definitions Definition. A density f on R is strongly log-concave if f(x) = h(x)cφ(cx) for some c > 0 where h is log-concave and φ(x) = (2π) /2 exp( x 2 /2). Sufficient condition: logf C 2 (R) with ( logf) (x) c 2 > 0 for all x. Definition 2. A density f on R d is strongly log-concave if f(x) = h(x)cγ(cx) for some c > 0 where h is log-concave and γ is the N d (0, ci d ) density. Sufficient condition: logf C 2 (R d ) with D 2 ( logf)(x) c 2 I d for some c > 0 for all x R d. These agree with strong convexity as defined by Rockafellar & Wets (998), p Seminar, Institut de Mathématiques de Toulouse; 28 February 202.2

23 5. Examples & conterexamples Examples Example. f(x) = h(x)φ(x)/ hφdx where h is the logistic density, h(x) = e x /( + e x ) 2. Example 2. f(x) = h(x)φ(x)/ hφdx where h is the Gumbel density. h(x) = exp(x e x ). Example 3. f(x) = h(x)h( x)/ h(y)h( y)dy where h is the Gumbel density. Counterexamples Counterexample. f logistic: f(x) = e x /( + e x ) 2 ; ( logf) (x) = f(x). Counterexample 2. f Subbotin, r [, 2) (2, ); f(x) = C r exp( x r /r); ( logf) (x) = (r 2) x r 2. Seminar, Institut de Mathématiques de Toulouse; 28 February

24 Ex. : Logistic (red) perturbation of N(0, ) (green): f (blue) Seminar, Institut de Mathématiques de Toulouse; 28 February

25 Ex. : ( logf), Logistic perturbation of N(0, ) Seminar, Institut de Mathématiques de Toulouse; 28 February

26 Ex. 2: Gumbel (red) perturbation of N(0, ) (green): f (blue) Seminar, Institut de Mathématiques de Toulouse; 28 February

27 Ex. 2: ( logf), Gumbel perturbation of N(0, ) Seminar, Institut de Mathématiques de Toulouse; 28 February

28 Ex. 3: Gumbel ( ) Gumbel( ) (purple); N(0, V f ) (blue) Seminar, Institut de Mathématiques de Toulouse; 28 February

29 Ex. 3: loggumbel( ) Gumbel( ) (purple); logn(0, V f ) (blue) Seminar, Institut de Mathématiques de Toulouse; 28 February

30 Ex. 3: D 2 ( loggumbel( ) Gumbel( )) (purple); D 2 ( logn(0, V f )) (blue) Seminar, Institut de Mathématiques de Toulouse; 28 February

31 Subbotin f r r = (blue), r =.5 (red), r = 2 (green), r = 3 (purple) Seminar, Institut de Mathématiques de Toulouse; 28 February

32 log f r : r = (blue), r =.5 (red), r = 2 (green), r = 3 (purple) Seminar, Institut de Mathématiques de Toulouse; 28 February 202.3

33 ( log f r ) : r = (blue), r =.5 (red), r = 2 (green), r = 3 (purple) Seminar, Institut de Mathématiques de Toulouse; 28 February

34 6. Some consequences, strong log-concavity First consequence Theorem. (Hargé, 2004). Suppose X N n (µ, Σ) with density γ and Y has density h γ with h log-concave, and let g : R n R be convex. Then Eg(Y E(Y )) Eg(X EX)). Equivalently, with µ = EX, ν = EY = E(Xh(X))/Eh(X), and g g( + µ) E{ g(x ν + µ)h(x)} E g(x) Eh(X). Seminar, Institut de Mathématiques de Toulouse; 28 February

35 6. Some consequences, strong log-concavity More consequences Corollary. (Brascamp-Lieb, 976). Suppose X f = exp( ϕ) with D 2 ϕ λi d, λ > 0, and let g C (R d ). Then V ar f (g(x)) E (D 2 ϕ) g(x), g(x) λ E g(x) 2. (Poincaré inequality for strongly log-concave densities; improvements by Hargé (2008)) Theorem. (Caffarelli, 2002). Suppose X N d (0, I) with density γ d and Y has density e v γ d with v convex. Let T = ϕ be the unique gradient of a convex map ϕ such that ϕ(x) d = Y. Then 0 D 2 ϕ I d. (cf. Villani (2003), pages ) Seminar, Institut de Mathématiques de Toulouse; 28 February

36 7. Questions & problems Does strong log-concavity occur naturally? Are there natural examples? Are there large classes of strongly log-concave densities in connection with other known classes such as P F (Pólya frequency functions of order infinity) or L. Bondesson s class HM of completely hyperbolically monotone densities? Does Kelly s peakedness result for projection onto the ordered cone K n continue to hold with Gaussian replaced by log-concave (or symmetric log concave)? Seminar, Institut de Mathématiques de Toulouse; 28 February

37 Selected references: Villani, C. (2002). Topics in Optimal Transportation. Amer. Math Soc., Providence. Dharmadhikari, S. and Joag-dev, K. (988). Unimodality, Convexity, and Applications. Academic Press. Marshall, A. W. and Olkin, I. (979). Inequalities: Theory of Majorization and Its Applications. Academic Press. Marshall, A. W., Olkin, I., and Arnold, B. C. (20). Inequalities: Theory of Majorization and Its Applications. Second edition, Springer. Rockfellar, R. T. and Wets, R. (998). Variational Analysis. Springer. Hargé, G. (2004). A convex/log-concave correlation inequality for Gaussian measure and an application to abstract Wiener spaces. Probab. Theory Related Fields 30, Brascamp, H. J. and Lieb, E. H. (976). On extensions of the Brunn- Minkowski and Prékopa-Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation. J. Functional Analysis 22, Hargé, G. (2008). Reinforcement of an inequality due to Brascamp and Lieb. J. Funct. Anal., 254, Seminar, Institut de Mathématiques de Toulouse; 28 February

Chernoff s distribution is log-concave. But why? (And why does it matter?)

Chernoff s distribution is log-concave. But why? (And why does it matter?) Chernoff s distribution is log-concave But why? (And why does it matter?) Jon A. Wellner University of Washington, Seattle University of Michigan April 1, 2011 Woodroofe Seminar Based on joint work with:

More information

Nonparametric estimation of log-concave densities

Nonparametric estimation of log-concave densities Nonparametric estimation of log-concave densities Jon A. Wellner University of Washington, Seattle Seminaire, Institut de Mathématiques de Toulouse 5 March 2012 Seminaire, Toulouse Based on joint work

More information

Nonparametric estimation under Shape Restrictions

Nonparametric estimation under Shape Restrictions Nonparametric estimation under Shape Restrictions Jon A. Wellner University of Washington, Seattle Statistical Seminar, Frejus, France August 30 - September 3, 2010 Outline: Five Lectures on Shape Restrictions

More information

Nonparametric estimation of log-concave densities

Nonparametric estimation of log-concave densities Nonparametric estimation of log-concave densities Jon A. Wellner University of Washington, Seattle Northwestern University November 5, 2010 Conference on Shape Restrictions in Non- and Semi-Parametric

More information

Nonparametric estimation of. s concave and log-concave densities: alternatives to maximum likelihood

Nonparametric estimation of. s concave and log-concave densities: alternatives to maximum likelihood Nonparametric estimation of s concave and log-concave densities: alternatives to maximum likelihood Jon A. Wellner University of Washington, Seattle Cowles Foundation Seminar, Yale University November

More information

Nonparametric estimation: s concave and log-concave densities: alternatives to maximum likelihood

Nonparametric estimation: s concave and log-concave densities: alternatives to maximum likelihood Nonparametric estimation: s concave and log-concave densities: alternatives to maximum likelihood Jon A. Wellner University of Washington, Seattle Statistics Seminar, York October 15, 2015 Statistics Seminar,

More information

Strong log-concavity is preserved by convolution

Strong log-concavity is preserved by convolution Strong log-concavity is preserved by convolution Jon A. Wellner Abstract. We review and formulate results concerning strong-log-concavity in both discrete and continuous settings. Although four different

More information

Shape constrained estimation: a brief introduction

Shape constrained estimation: a brief introduction Shape constrained estimation: a brief introduction Jon A. Wellner University of Washington, Seattle Cowles Foundation, Yale November 7, 2016 Econometrics lunch seminar, Yale Based on joint work with: Fadoua

More information

1 An Elementary Introduction to Monotone Transportation

1 An Elementary Introduction to Monotone Transportation An Elementary Introduction to Monotone Transportation after K. Ball [3] A summary written by Paata Ivanisvili Abstract We outline existence of the Brenier map. As an application we present simple proofs

More information

Bi-s -Concave Distributions

Bi-s -Concave Distributions Bi-s -Concave Distributions Jon A. Wellner (Seattle) Non- and Semiparametric Statistics In Honor of Arnold Janssen, On the occasion of his 65th Birthday Non- and Semiparametric Statistics: In Honor of

More information

Around the Brunn-Minkowski inequality

Around the Brunn-Minkowski inequality Around the Brunn-Minkowski inequality Andrea Colesanti Technische Universität Berlin - Institut für Mathematik January 28, 2015 Summary Summary The Brunn-Minkowski inequality Summary The Brunn-Minkowski

More information

Some stochastic inequalities for weighted sums

Some stochastic inequalities for weighted sums Some stochastic inequalities for weighted sums Yaming Yu Department of Statistics University of California Irvine, CA 92697, USA yamingy@uci.edu Abstract We compare weighted sums of i.i.d. positive random

More information

On Strong Unimodality of Multivariate Discrete Distributions

On Strong Unimodality of Multivariate Discrete Distributions R u t c o r Research R e p o r t On Strong Unimodality of Multivariate Discrete Distributions Ersoy Subasi a Mine Subasi b András Prékopa c RRR 47-2004, DECEMBER, 2004 RUTCOR Rutgers Center for Operations

More information

Stochastic Comparisons of Weighted Sums of Arrangement Increasing Random Variables

Stochastic Comparisons of Weighted Sums of Arrangement Increasing Random Variables Portland State University PDXScholar Mathematics and Statistics Faculty Publications and Presentations Fariborz Maseeh Department of Mathematics and Statistics 4-7-2015 Stochastic Comparisons of Weighted

More information

Local strong convexity and local Lipschitz continuity of the gradient of convex functions

Local strong convexity and local Lipschitz continuity of the gradient of convex functions Local strong convexity and local Lipschitz continuity of the gradient of convex functions R. Goebel and R.T. Rockafellar May 23, 2007 Abstract. Given a pair of convex conjugate functions f and f, we investigate

More information

NONPARAMETRIC ESTIMATION OF MULTIVARIATE CONVEX-TRANSFORMED DENSITIES. By Arseni Seregin, and Jon A. Wellner, University of Washington

NONPARAMETRIC ESTIMATION OF MULTIVARIATE CONVEX-TRANSFORMED DENSITIES. By Arseni Seregin, and Jon A. Wellner, University of Washington Submitted to the Annals of Statistics arxiv: math.st/0911.4151v1 NONPARAMETRIC ESTIMATION OF MULTIVARIATE CONVEX-TRANSFORMED DENSITIES By Arseni Seregin, and Jon A. Wellner, University of Washington We

More information

A concavity property for the reciprocal of Fisher information and its consequences on Costa s EPI

A concavity property for the reciprocal of Fisher information and its consequences on Costa s EPI A concavity property for the reciprocal of Fisher information and its consequences on Costa s EPI Giuseppe Toscani October 0, 204 Abstract. We prove that the reciprocal of Fisher information of a logconcave

More information

Quick Tour of Basic Probability Theory and Linear Algebra

Quick Tour of Basic Probability Theory and Linear Algebra Quick Tour of and Linear Algebra Quick Tour of and Linear Algebra CS224w: Social and Information Network Analysis Fall 2011 Quick Tour of and Linear Algebra Quick Tour of and Linear Algebra Outline Definitions

More information

Inverse Brascamp-Lieb inequalities along the Heat equation

Inverse Brascamp-Lieb inequalities along the Heat equation Inverse Brascamp-Lieb inequalities along the Heat equation Franck Barthe and Dario Cordero-Erausquin October 8, 003 Abstract Adapting Borell s proof of Ehrhard s inequality for general sets, we provide

More information

Spectral Gap and Concentration for Some Spherically Symmetric Probability Measures

Spectral Gap and Concentration for Some Spherically Symmetric Probability Measures Spectral Gap and Concentration for Some Spherically Symmetric Probability Measures S.G. Bobkov School of Mathematics, University of Minnesota, 127 Vincent Hall, 26 Church St. S.E., Minneapolis, MN 55455,

More information

Total positivity in Markov structures

Total positivity in Markov structures 1 based on joint work with Shaun Fallat, Kayvan Sadeghi, Caroline Uhler, Nanny Wermuth, and Piotr Zwiernik (arxiv:1510.01290) Faculty of Science Total positivity in Markov structures Steffen Lauritzen

More information

Convexification and Multimodality of Random Probability Measures

Convexification and Multimodality of Random Probability Measures Convexification and Multimodality of Random Probability Measures George Kokolakis & George Kouvaras Department of Applied Mathematics National Technical University of Athens, Greece Isaac Newton Institute,

More information

ECE 4400:693 - Information Theory

ECE 4400:693 - Information Theory ECE 4400:693 - Information Theory Dr. Nghi Tran Lecture 8: Differential Entropy Dr. Nghi Tran (ECE-University of Akron) ECE 4400:693 Lecture 1 / 43 Outline 1 Review: Entropy of discrete RVs 2 Differential

More information

Maximum likelihood estimation

Maximum likelihood estimation Maximum likelihood estimation Guillaume Obozinski Ecole des Ponts - ParisTech Master MVA Maximum likelihood estimation 1/26 Outline 1 Statistical concepts 2 A short review of convex analysis and optimization

More information

CONVOLUTIONS OF LOGARITHMICALLY. Milan Merkle. Abstract. We give a simple proof of the fact that the logarithmic concavity of real

CONVOLUTIONS OF LOGARITHMICALLY. Milan Merkle. Abstract. We give a simple proof of the fact that the logarithmic concavity of real Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 9 (998), 3{7. CONVOLUTIONS OF LOGARITHMICALLY CONCAVE FUNCTIONS Milan Merkle Abstract. We give a simple proof of the fact that the logarithmic concavity

More information

Some properties of skew-symmetric distributions

Some properties of skew-symmetric distributions Noname manuscript No. (will be inserted by the editor) Some properties of skew-symmetric distributions Adelchi Azzalini Giuliana Regoli 21st December 2010 Revised May 2011 Abstract The family of skew-symmetric

More information

Logarithmic Sobolev Inequalities

Logarithmic Sobolev Inequalities Logarithmic Sobolev Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France logarithmic Sobolev inequalities what they are, some history analytic, geometric, optimal transportation proofs

More information

High-dimensional distributions with convexity properties

High-dimensional distributions with convexity properties High-dimensional distributions with convexity properties Bo az Klartag Tel-Aviv University A conference in honor of Charles Fefferman, Princeton, May 2009 High-Dimensional Distributions We are concerned

More information

From the Brunn-Minkowski inequality to a class of Poincaré type inequalities

From the Brunn-Minkowski inequality to a class of Poincaré type inequalities arxiv:math/0703584v1 [math.fa] 20 Mar 2007 From the Brunn-Minkowski inequality to a class of Poincaré type inequalities Andrea Colesanti Abstract We present an argument which leads from the Brunn-Minkowski

More information

A glimpse into convex geometry. A glimpse into convex geometry

A glimpse into convex geometry. A glimpse into convex geometry A glimpse into convex geometry 5 \ þ ÏŒÆ Two basis reference: 1. Keith Ball, An elementary introduction to modern convex geometry 2. Chuanming Zong, What is known about unit cubes Convex geometry lies

More information

BORELL S GENERALIZED PRÉKOPA-LEINDLER INEQUALITY: A SIMPLE PROOF. Arnaud Marsiglietti. IMA Preprint Series #2461. (December 2015)

BORELL S GENERALIZED PRÉKOPA-LEINDLER INEQUALITY: A SIMPLE PROOF. Arnaud Marsiglietti. IMA Preprint Series #2461. (December 2015) BORELL S GENERALIZED PRÉKOPA-LEINDLER INEQUALITY: A SIMPLE PROOF By Arnaud Marsiglietti IMA Preprint Series #2461 December 215 INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS UNIVERSITY OF MINNESOTA 4 Lind

More information

Lecture 17: Differential Entropy

Lecture 17: Differential Entropy Lecture 17: Differential Entropy Differential entropy AEP for differential entropy Quantization Maximum differential entropy Estimation counterpart of Fano s inequality Dr. Yao Xie, ECE587, Information

More information

A Law of the Iterated Logarithm. for Grenander s Estimator

A Law of the Iterated Logarithm. for Grenander s Estimator A Law of the Iterated Logarithm for Grenander s Estimator Jon A. Wellner University of Washington, Seattle Probability Seminar October 24, 2016 Based on joint work with: Lutz Dümbgen and Malcolm Wolff

More information

A function(al) f is convex if dom f is a convex set, and. f(θx + (1 θ)y) < θf(x) + (1 θ)f(y) f(x) = x 3

A function(al) f is convex if dom f is a convex set, and. f(θx + (1 θ)y) < θf(x) + (1 θ)f(y) f(x) = x 3 Convex functions The domain dom f of a functional f : R N R is the subset of R N where f is well-defined. A function(al) f is convex if dom f is a convex set, and f(θx + (1 θ)y) θf(x) + (1 θ)f(y) for all

More information

Math 341: Convex Geometry. Xi Chen

Math 341: Convex Geometry. Xi Chen Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry

More information

Maximization of a Strongly Unimodal Multivariate Discrete Distribution

Maximization of a Strongly Unimodal Multivariate Discrete Distribution R u t c o r Research R e p o r t Maximization of a Strongly Unimodal Multivariate Discrete Distribution Mine Subasi a Ersoy Subasi b András Prékopa c RRR 12-2009, July 2009 RUTCOR Rutgers Center for Operations

More information

Probability Background

Probability Background Probability Background Namrata Vaswani, Iowa State University August 24, 2015 Probability recap 1: EE 322 notes Quick test of concepts: Given random variables X 1, X 2,... X n. Compute the PDF of the second

More information

Convex Geometry. Otto-von-Guericke Universität Magdeburg. Applications of the Brascamp-Lieb and Barthe inequalities. Exercise 12.

Convex Geometry. Otto-von-Guericke Universität Magdeburg. Applications of the Brascamp-Lieb and Barthe inequalities. Exercise 12. Applications of the Brascamp-Lieb and Barthe inequalities Exercise 12.1 Show that if m Ker M i {0} then both BL-I) and B-I) hold trivially. Exercise 12.2 Let λ 0, 1) and let f, g, h : R 0 R 0 be measurable

More information

Random Variables and Their Distributions

Random Variables and Their Distributions Chapter 3 Random Variables and Their Distributions A random variable (r.v.) is a function that assigns one and only one numerical value to each simple event in an experiment. We will denote r.vs by capital

More information

Iterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem

Iterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem Iterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem Charles Byrne (Charles Byrne@uml.edu) http://faculty.uml.edu/cbyrne/cbyrne.html Department of Mathematical Sciences

More information

Lecture 4: Convex Functions, Part I February 1

Lecture 4: Convex Functions, Part I February 1 IE 521: Convex Optimization Instructor: Niao He Lecture 4: Convex Functions, Part I February 1 Spring 2017, UIUC Scribe: Shuanglong Wang Courtesy warning: These notes do not necessarily cover everything

More information

Maximum likelihood estimation of a log-concave density based on censored data

Maximum likelihood estimation of a log-concave density based on censored data Maximum likelihood estimation of a log-concave density based on censored data Dominic Schuhmacher Institute of Mathematical Statistics and Actuarial Science University of Bern Joint work with Lutz Dümbgen

More information

Fisher information and Stam inequality on a finite group

Fisher information and Stam inequality on a finite group Fisher information and Stam inequality on a finite group Paolo Gibilisco and Tommaso Isola February, 2008 Abstract We prove a discrete version of Stam inequality for random variables taking values on a

More information

Steiner s formula and large deviations theory

Steiner s formula and large deviations theory Steiner s formula and large deviations theory Venkat Anantharam EECS Department University of California, Berkeley May 19, 2015 Simons Conference on Networks and Stochastic Geometry Blanton Museum of Art

More information

Dimensional behaviour of entropy and information

Dimensional behaviour of entropy and information Dimensional behaviour of entropy and information Sergey Bobkov and Mokshay Madiman Note: A slightly condensed version of this paper is in press and will appear in the Comptes Rendus de l Académies des

More information

Optimization. The value x is called a maximizer of f and is written argmax X f. g(λx + (1 λ)y) < λg(x) + (1 λ)g(y) 0 < λ < 1; x, y X.

Optimization. The value x is called a maximizer of f and is written argmax X f. g(λx + (1 λ)y) < λg(x) + (1 λ)g(y) 0 < λ < 1; x, y X. Optimization Background: Problem: given a function f(x) defined on X, find x such that f(x ) f(x) for all x X. The value x is called a maximizer of f and is written argmax X f. In general, argmax X f may

More information

Some Applications of Mass Transport to Gaussian-Type Inequalities

Some Applications of Mass Transport to Gaussian-Type Inequalities Arch. ational Mech. Anal. 161 (2002) 257 269 Digital Object Identifier (DOI) 10.1007/s002050100185 Some Applications of Mass Transport to Gaussian-Type Inequalities Dario Cordero-Erausquin Communicated

More information

Convex Functions. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)

Convex Functions. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST) Convex Functions Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Definition convex function Examples

More information

OPTIMISATION CHALLENGES IN MODERN STATISTICS. Co-authors: Y. Chen, M. Cule, R. Gramacy, M. Yuan

OPTIMISATION CHALLENGES IN MODERN STATISTICS. Co-authors: Y. Chen, M. Cule, R. Gramacy, M. Yuan OPTIMISATION CHALLENGES IN MODERN STATISTICS Co-authors: Y. Chen, M. Cule, R. Gramacy, M. Yuan How do optimisation problems arise in Statistics? Let X 1,...,X n be independent and identically distributed

More information

ON A LINEAR REFINEMENT OF THE PRÉKOPA-LEINDLER INEQUALITY

ON A LINEAR REFINEMENT OF THE PRÉKOPA-LEINDLER INEQUALITY ON A LINEAR REFINEMENT OF TE PRÉKOPA-LEINDLER INEQUALITY A. COLESANTI, E. SAORÍN GÓMEZ, AND J. YEPES NICOLÁS Abstract. If f, g : R n R 0 are non-negative measurable functions, then the Prékopa-Leindler

More information

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2 Order statistics Ex. 4.1 (*. Let independent variables X 1,..., X n have U(0, 1 distribution. Show that for every x (0, 1, we have P ( X (1 < x 1 and P ( X (n > x 1 as n. Ex. 4.2 (**. By using induction

More information

Lecture 1 October 9, 2013

Lecture 1 October 9, 2013 Probabilistic Graphical Models Fall 2013 Lecture 1 October 9, 2013 Lecturer: Guillaume Obozinski Scribe: Huu Dien Khue Le, Robin Bénesse The web page of the course: http://www.di.ens.fr/~fbach/courses/fall2013/

More information

Chapter 8: Differential entropy. University of Illinois at Chicago ECE 534, Natasha Devroye

Chapter 8: Differential entropy. University of Illinois at Chicago ECE 534, Natasha Devroye Chapter 8: Differential entropy Chapter 8 outline Motivation Definitions Relation to discrete entropy Joint and conditional differential entropy Relative entropy and mutual information Properties AEP for

More information

Entropy Power Inequalities: Results and Speculation

Entropy Power Inequalities: Results and Speculation Entropy Power Inequalities: Results and Speculation Venkat Anantharam EECS Department University of California, Berkeley December 12, 2013 Workshop on Coding and Information Theory Institute of Mathematical

More information

ST5215: Advanced Statistical Theory

ST5215: Advanced Statistical Theory Department of Statistics & Applied Probability Monday, September 26, 2011 Lecture 10: Exponential families and Sufficient statistics Exponential Families Exponential families are important parametric families

More information

Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed

Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed 18.466 Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed 1. MLEs in exponential families Let f(x,θ) for x X and θ Θ be a likelihood function, that is, for present purposes,

More information

Weak and strong moments of l r -norms of log-concave vectors

Weak and strong moments of l r -norms of log-concave vectors Weak and strong moments of l r -norms of log-concave vectors Rafał Latała based on the joint work with Marta Strzelecka) University of Warsaw Minneapolis, April 14 2015 Log-concave measures/vectors A measure

More information

Efficiency of linear estimators under heavy-tailedness: convolutions of [alpha]-symmetric distributions.

Efficiency of linear estimators under heavy-tailedness: convolutions of [alpha]-symmetric distributions. Efficiency of linear estimators under heavy-tailedness: convolutions of [alpha]-symmetric distributions. The Harvard community has made this article openly available. Please share how this access benefits

More information

Probability Lecture III (August, 2006)

Probability Lecture III (August, 2006) robability Lecture III (August, 2006) 1 Some roperties of Random Vectors and Matrices We generalize univariate notions in this section. Definition 1 Let U = U ij k l, a matrix of random variables. Suppose

More information

Log-concave Probability Distributions: Theory and Statistical Testing 1

Log-concave Probability Distributions: Theory and Statistical Testing 1 Log-concave Probability Distributions: Theory and Statistical Testing 1 Mark Yuying An Department of Economics, Duke University, Durham, NC 27708-0097. Telephone: (919) 660-1809. Email: man@ping.econ.duke.edu.

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journal of Inequalities in Pure and Applied Mathematics THE EXTENSION OF MAJORIZATION INEQUALITIES WITHIN THE FRAMEWORK OF RELATIVE CONVEXITY CONSTANTIN P. NICULESCU AND FLORIN POPOVICI University of Craiova

More information

Exercises: Brunn, Minkowski and convex pie

Exercises: Brunn, Minkowski and convex pie Lecture 1 Exercises: Brunn, Minkowski and convex pie Consider the following problem: 1.1 Playing a convex pie Consider the following game with two players - you and me. I am cooking a pie, which should

More information

BORIS MORDUKHOVICH Wayne State University Detroit, MI 48202, USA. Talk given at the SPCOM Adelaide, Australia, February 2015

BORIS MORDUKHOVICH Wayne State University Detroit, MI 48202, USA. Talk given at the SPCOM Adelaide, Australia, February 2015 CODERIVATIVE CHARACTERIZATIONS OF MAXIMAL MONOTONICITY BORIS MORDUKHOVICH Wayne State University Detroit, MI 48202, USA Talk given at the SPCOM 2015 Adelaide, Australia, February 2015 Based on joint papers

More information

BASICS OF CONVEX ANALYSIS

BASICS OF CONVEX ANALYSIS BASICS OF CONVEX ANALYSIS MARKUS GRASMAIR 1. Main Definitions We start with providing the central definitions of convex functions and convex sets. Definition 1. A function f : R n R + } is called convex,

More information

EXPONENTIAL PROBABILITY INEQUALITY FOR LINEARLY NEGATIVE QUADRANT DEPENDENT RANDOM VARIABLES

EXPONENTIAL PROBABILITY INEQUALITY FOR LINEARLY NEGATIVE QUADRANT DEPENDENT RANDOM VARIABLES Commun. Korean Math. Soc. (007), No. 1, pp. 137 143 EXPONENTIAL PROBABILITY INEQUALITY FOR LINEARLY NEGATIVE QUADRANT DEPENDENT RANDOM VARIABLES Mi-Hwa Ko 1, Yong-Kab Choi, and Yue-Soon Choi Reprinted

More information

SMOOTH OPTIMAL TRANSPORTATION ON HYPERBOLIC SPACE

SMOOTH OPTIMAL TRANSPORTATION ON HYPERBOLIC SPACE SMOOTH OPTIMAL TRANSPORTATION ON HYPERBOLIC SPACE JIAYONG LI A thesis completed in partial fulfilment of the requirement of Master of Science in Mathematics at University of Toronto. Copyright 2009 by

More information

Theory of Probability Fall 2008

Theory of Probability Fall 2008 MIT OpenCourseWare http://ocw.mit.edu 8.75 Theory of Probability Fall 008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Section Prekopa-Leindler inequality,

More information

A NOTE ON A DISTRIBUTION OF WEIGHTED SUMS OF I.I.D. RAYLEIGH RANDOM VARIABLES

A NOTE ON A DISTRIBUTION OF WEIGHTED SUMS OF I.I.D. RAYLEIGH RANDOM VARIABLES Sankhyā : The Indian Journal of Statistics 1998, Volume 6, Series A, Pt. 2, pp. 171-175 A NOTE ON A DISTRIBUTION OF WEIGHTED SUMS OF I.I.D. RAYLEIGH RANDOM VARIABLES By P. HITCZENKO North Carolina State

More information

Albert W. Marshall. Ingram Olkin Barry. C. Arnold. Inequalities: Theory. of Majorization and Its Applications. Second Edition.

Albert W. Marshall. Ingram Olkin Barry. C. Arnold. Inequalities: Theory. of Majorization and Its Applications. Second Edition. Albert W Marshall Ingram Olkin Barry C Arnold Inequalities: Theory of Majorization and Its Applications Second Edition f) Springer Contents I Theory of Majorization 1 Introduction 3 A Motivation and Basic

More information

Convex analysis and profit/cost/support functions

Convex analysis and profit/cost/support functions Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m Convex analysts may give one of two

More information

Nonparametric estimation under Shape Restrictions

Nonparametric estimation under Shape Restrictions Nonparametric estimation under Shape Restrictions Jon A. Wellner University of Washington, Seattle Statistical Seminar, Frejus, France August 30 - September 3, 2010 Outline: Five Lectures on Shape Restrictions

More information

A Brunn Minkowski inequality for the Hessian eigenvalue in three-dimensional convex domain

A Brunn Minkowski inequality for the Hessian eigenvalue in three-dimensional convex domain Advances in Mathematics 5 010 1616 1633 www.elsevier.com/locate/aim A Brunn Minkowski inequality for the Hessian eigenvalue in three-dimensional convex domain Pan Liu a, Xi-Nan Ma b,,luxu c a Department

More information

P (x). all other X j =x j. If X is a continuous random vector (see p.172), then the marginal distributions of X i are: f(x)dx 1 dx n

P (x). all other X j =x j. If X is a continuous random vector (see p.172), then the marginal distributions of X i are: f(x)dx 1 dx n JOINT DENSITIES - RANDOM VECTORS - REVIEW Joint densities describe probability distributions of a random vector X: an n-dimensional vector of random variables, ie, X = (X 1,, X n ), where all X is are

More information

Assignment 1: From the Definition of Convexity to Helley Theorem

Assignment 1: From the Definition of Convexity to Helley Theorem Assignment 1: From the Definition of Convexity to Helley Theorem Exercise 1 Mark in the following list the sets which are convex: 1. {x R 2 : x 1 + i 2 x 2 1, i = 1,..., 10} 2. {x R 2 : x 2 1 + 2ix 1x

More information

x log x, which is strictly convex, and use Jensen s Inequality:

x log x, which is strictly convex, and use Jensen s Inequality: 2. Information measures: mutual information 2.1 Divergence: main inequality Theorem 2.1 (Information Inequality). D(P Q) 0 ; D(P Q) = 0 iff P = Q Proof. Let ϕ(x) x log x, which is strictly convex, and

More information

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization MATHEMATICS OF OPERATIONS RESEARCH Vol. 29, No. 3, August 2004, pp. 479 491 issn 0364-765X eissn 1526-5471 04 2903 0479 informs doi 10.1287/moor.1040.0103 2004 INFORMS Some Properties of the Augmented

More information

3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions

3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions 3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions

More information

Notes on Random Vectors and Multivariate Normal

Notes on Random Vectors and Multivariate Normal MATH 590 Spring 06 Notes on Random Vectors and Multivariate Normal Properties of Random Vectors If X,, X n are random variables, then X = X,, X n ) is a random vector, with the cumulative distribution

More information

SWFR ENG 4TE3 (6TE3) COMP SCI 4TE3 (6TE3) Continuous Optimization Algorithm. Convex Optimization. Computing and Software McMaster University

SWFR ENG 4TE3 (6TE3) COMP SCI 4TE3 (6TE3) Continuous Optimization Algorithm. Convex Optimization. Computing and Software McMaster University SWFR ENG 4TE3 (6TE3) COMP SCI 4TE3 (6TE3) Continuous Optimization Algorithm Convex Optimization Computing and Software McMaster University General NLO problem (NLO : Non Linear Optimization) (N LO) min

More information

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2) 14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence

More information

WEAK CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS WITH NONLINEAR OPERATORS IN HILBERT SPACES

WEAK CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS WITH NONLINEAR OPERATORS IN HILBERT SPACES Fixed Point Theory, 12(2011), No. 2, 309-320 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html WEAK CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS WITH NONLINEAR OPERATORS IN HILBERT SPACES S. DHOMPONGSA,

More information

40.530: Statistics. Professor Chen Zehua. Singapore University of Design and Technology

40.530: Statistics. Professor Chen Zehua. Singapore University of Design and Technology Singapore University of Design and Technology Lecture 9: Hypothesis testing, uniformly most powerful tests. The Neyman-Pearson framework Let P be the family of distributions of concern. The Neyman-Pearson

More information

A Brief Introduction to Copulas

A Brief Introduction to Copulas A Brief Introduction to Copulas Speaker: Hua, Lei February 24, 2009 Department of Statistics University of British Columbia Outline Introduction Definition Properties Archimedean Copulas Constructing Copulas

More information

Murat Akman. The Brunn-Minkowski Inequality and a Minkowski Problem for Nonlinear Capacities. March 10

Murat Akman. The Brunn-Minkowski Inequality and a Minkowski Problem for Nonlinear Capacities. March 10 The Brunn-Minkowski Inequality and a Minkowski Problem for Nonlinear Capacities Murat Akman March 10 Postdoc in HA Group and Postdoc at the University of Connecticut Minkowski Addition of Sets Let E 1

More information

Lecture 25: Review. Statistics 104. April 23, Colin Rundel

Lecture 25: Review. Statistics 104. April 23, Colin Rundel Lecture 25: Review Statistics 104 Colin Rundel April 23, 2012 Joint CDF F (x, y) = P [X x, Y y] = P [(X, Y ) lies south-west of the point (x, y)] Y (x,y) X Statistics 104 (Colin Rundel) Lecture 25 April

More information

3. Probability and Statistics

3. Probability and Statistics FE661 - Statistical Methods for Financial Engineering 3. Probability and Statistics Jitkomut Songsiri definitions, probability measures conditional expectations correlation and covariance some important

More information

Brunn-Minkowski inequalities for two functionals involving the p-laplace operator

Brunn-Minkowski inequalities for two functionals involving the p-laplace operator Brunn-Minkowski inequalities for two functionals involving the p-laplace operator Andrea Colesanti Paola Cuoghi Paolo Salani Abstract In the family of n-dimensional convex bodies, we prove a Brunn-Minkowski

More information

Lecture 3: Expected Value. These integrals are taken over all of Ω. If we wish to integrate over a measurable subset A Ω, we will write

Lecture 3: Expected Value. These integrals are taken over all of Ω. If we wish to integrate over a measurable subset A Ω, we will write Lecture 3: Expected Value 1.) Definitions. If X 0 is a random variable on (Ω, F, P), then we define its expected value to be EX = XdP. Notice that this quantity may be. For general X, we say that EX exists

More information

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2 Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,

More information

Finite Dimensional Optimization Part III: Convex Optimization 1

Finite Dimensional Optimization Part III: Convex Optimization 1 John Nachbar Washington University March 21, 2017 Finite Dimensional Optimization Part III: Convex Optimization 1 1 Saddle points and KKT. These notes cover another important approach to optimization,

More information

On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings

On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings Int. J. Nonlinear Anal. Appl. 7 (2016) No. 1, 295-300 ISSN: 2008-6822 (electronic) http://dx.doi.org/10.22075/ijnaa.2015.341 On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous

More information

Convex Analysis and Economic Theory AY Elementary properties of convex functions

Convex Analysis and Economic Theory AY Elementary properties of convex functions Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally

More information

Nonparametric Estimation of the Dependence Function for a Multivariate Extreme Value Distribution

Nonparametric Estimation of the Dependence Function for a Multivariate Extreme Value Distribution Nonparametric Estimation of the Dependence Function for a Multivariate Extreme Value Distribution p. /2 Nonparametric Estimation of the Dependence Function for a Multivariate Extreme Value Distribution

More information

Richard F. Bass Krzysztof Burdzy University of Washington

Richard F. Bass Krzysztof Burdzy University of Washington ON DOMAIN MONOTONICITY OF THE NEUMANN HEAT KERNEL Richard F. Bass Krzysztof Burdzy University of Washington Abstract. Some examples are given of convex domains for which domain monotonicity of the Neumann

More information

Multivariate Analysis and Likelihood Inference

Multivariate Analysis and Likelihood Inference Multivariate Analysis and Likelihood Inference Outline 1 Joint Distribution of Random Variables 2 Principal Component Analysis (PCA) 3 Multivariate Normal Distribution 4 Likelihood Inference Joint density

More information

Statistics 581, Problem Set 1 Solutions Wellner; 10/3/ (a) The case r = 1 of Chebychev s Inequality is known as Markov s Inequality

Statistics 581, Problem Set 1 Solutions Wellner; 10/3/ (a) The case r = 1 of Chebychev s Inequality is known as Markov s Inequality Statistics 581, Problem Set 1 Solutions Wellner; 1/3/218 1. (a) The case r = 1 of Chebychev s Inequality is known as Markov s Inequality and is usually written P ( X ɛ) E( X )/ɛ for an arbitrary random

More information

Continuous Random Variables

Continuous Random Variables 1 / 24 Continuous Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay February 27, 2013 2 / 24 Continuous Random Variables

More information

(somewhat) expanded version of the note in C. R. Acad. Sci. Paris 340, (2005). A (ONE-DIMENSIONAL) FREE BRUNN-MINKOWSKI INEQUALITY

(somewhat) expanded version of the note in C. R. Acad. Sci. Paris 340, (2005). A (ONE-DIMENSIONAL) FREE BRUNN-MINKOWSKI INEQUALITY (somewhat expanded version of the note in C. R. Acad. Sci. Paris 340, 30 304 (2005. A (ONE-DIMENSIONAL FREE BRUNN-MINKOWSKI INEQUALITY M. Ledoux University of Toulouse, France Abstract. We present a one-dimensional

More information

Chapter 2: Fundamentals of Statistics Lecture 15: Models and statistics

Chapter 2: Fundamentals of Statistics Lecture 15: Models and statistics Chapter 2: Fundamentals of Statistics Lecture 15: Models and statistics Data from one or a series of random experiments are collected. Planning experiments and collecting data (not discussed here). Analysis:

More information

Convex Functions. Wing-Kin (Ken) Ma The Chinese University of Hong Kong (CUHK)

Convex Functions. Wing-Kin (Ken) Ma The Chinese University of Hong Kong (CUHK) Convex Functions Wing-Kin (Ken) Ma The Chinese University of Hong Kong (CUHK) Course on Convex Optimization for Wireless Comm. and Signal Proc. Jointly taught by Daniel P. Palomar and Wing-Kin (Ken) Ma

More information