Derivative-based global sensitivity measures for interactions

Size: px
Start display at page:

Download "Derivative-based global sensitivity measures for interactions"

Transcription

1 Derivative-based global sensitivity measures for interactions Olivier Roustant École Nationale Supérieure des Mines de Saint-Étienne Joint work with J. Fruth, B. Iooss and S. Kuhnt SAMO 13 Olivier Roustant (EMSE) DGSM for interactions SAMO 13 1 / 16

2 Outline 1 Background and motivation Variance-based and derivative-based sensitivity measures 1st-order analysis. Screening : Total indices & DGSM. 2nd-order analysis. Interaction screening. Crossed DGSM 2 The main result : A link between superset importance and crossed DGSM 3 Applications A 6-dimensional example When the gradient is supplied Olivier Roustant (EMSE) DGSM for interactions SAMO 13 2 / 16

3 Background and motivation Variance-based and derivative-based sensitivity measures Let X = (X 1,..., X d ) be a vector of independent input variables with distribution µ 1 µ d, and g : R d R such that g(x) L 2 (µ). Sobol-Hoeffding decomposition [Sobol, 1993, Efron and Stein, 1981] d g(x) = g 0 + g i (X i ) + g (X i, X j ) + + g 1,...,d (X 1,..., X d ) = i=1 I {1,...,d} g I (X I ) 1 i<j d (1) The g I s are centered and orthogonal. Olivier Roustant (EMSE) DGSM for interactions SAMO 13 3 / 16

4 Background and motivation Variance-based and derivative-based sensitivity measures Global sensitivity measures Variance-based measures Partial variances : D I = var(g I (X I )), and Sobol indices S I = D I /D D := var(g(x)) = I D I, 1 = I S I Olivier Roustant (EMSE) DGSM for interactions SAMO 13 4 / 16

5 Background and motivation Variance-based and derivative-based sensitivity measures Global sensitivity measures Variance-based measures Partial variances : D I = var(g I (X I )), and Sobol indices S I = D I /D D := var(g(x)) = I D I, 1 = I S I Total index : D T i = J {i} D J, S T i = DT i D. Olivier Roustant (EMSE) DGSM for interactions SAMO 13 4 / 16

6 Background and motivation Variance-based and derivative-based sensitivity measures Global sensitivity measures Variance-based measures Partial variances : D I = var(g I (X I )), and Sobol indices S I = D I /D D := var(g(x)) = I D I, 1 = I S I Total index : Di T = J {i} D J, Si T = DT i D. Superset importance [Liu and Owen, 2006] : D super I := J I D J, S super I = Dsuper I D D super := J {} D J "total interaction index" [Fruth et al., 2013] Olivier Roustant (EMSE) DGSM for interactions SAMO 13 4 / 16

7 Background and motivation Variance-based and derivative-based sensitivity measures Global sensitivity measures Variance-based measures Partial variances : D I = var(g I (X I )), and Sobol indices S I = D I /D D := var(g(x)) = I D I, 1 = I S I Total index : Di T = J {i} D J, Si T = DT i D. Superset importance [Liu and Owen, 2006] : D super I := J I D J, S super I = Dsuper I D D super := J {} D J "total interaction index" [Fruth et al., 2013] Derivative-based measures In sensitivity analysis [Sobol and Gresham, 1995] : ν i = ( g(x) x i ) 2 dµ(x), called DGSM Olivier Roustant (EMSE) DGSM for interactions SAMO 13 4 / 16

8 Background and motivation Variance-based and derivative-based sensitivity measures Global sensitivity measures Variance-based measures Partial variances : D I = var(g I (X I )), and Sobol indices S I = D I /D D := var(g(x)) = I D I, 1 = I S I Total index : Di T = J {i} D J, Si T = DT i D. Superset importance [Liu and Owen, 2006] : D super I := J I D J, S super I = Dsuper I D D super := J {} D J "total interaction index" [Fruth et al., 2013] Derivative-based measures In sensitivity analysis [Sobol and Gresham, 1995] : ν i = ( g(x) x i ) 2 dµ(x), called DGSM In statistical learning [Friedman and Popescu, 2008] : ν = ( 2 g(x) x i x j ) 2 dµ(x), νi = ( I g(x) x I ) 2 dµ(x). "crossed DGSM". Olivier Roustant (EMSE) DGSM for interactions SAMO 13 4 / 16

9 Background and motivation 1st-order analysis. Screening : Total indices & DGSM. First-order analysis considers single variables. One aim is screening : detection of non-influential input variables. Olivier Roustant (EMSE) DGSM for interactions SAMO 13 5 / 16

10 Background and motivation 1st-order analysis. Screening : Total indices & DGSM. First-order analysis considers single variables. One aim is screening : detection of non-influential input variables. Screening with total indices or DGSMs If either D T i = 0 or ν i = 0, than X i is non influential. Olivier Roustant (EMSE) DGSM for interactions SAMO 13 5 / 16

11 Background and motivation 1st-order analysis. Screening : Total indices & DGSM. First-order analysis considers single variables. One aim is screening : detection of non-influential input variables. Screening with total indices or DGSMs If either Di T = 0 or ν i = 0, than X i is non influential. There is a Poincaré-type inequality between total indices and DGSMs D i D T i C(µ i )ν i Proved by [Sobol and Kucherenko, 2009] for the uniform and normal distributions, [Lamboni et al., 2013] for the general case. Olivier Roustant (EMSE) DGSM for interactions SAMO 13 5 / 16

12 Background and motivation 1st-order analysis. Screening : Total indices & DGSM. Poincaré inequality (1-dimensional case) A distribution µ satisfies a Poincaré inequality if for all h in L 2 (µ) such that h(x)dµ(x) = 0, and h (x) L 2 (µ) : h(x) 2 dµ(x) C(µ) h (x) 2 dµ(x) The best constant is denoted C opt (µ). Olivier Roustant (EMSE) DGSM for interactions SAMO 13 6 / 16

13 Background and motivation 1st-order analysis. Screening : Total indices & DGSM. Poincaré inequality (1-dimensional case) A distribution µ satisfies a Poincaré inequality if for all h in L 2 (µ) such that h(x)dµ(x) = 0, and h (x) L 2 (µ) : h(x) 2 dµ(x) C(µ) h (x) 2 dµ(x) The best constant is denoted C opt (µ). Examples ([Sobol and Kucherenko, 2009], [Ané et al., 2000], [Lamboni et al., 2013], [Bobkov and Houdré, 1997, Bobkov, 1999]) Distribution C opt (µ) A case of equality Uniform U[a, b] (b a) 2 /π 2 g(x) = cos Normal N (µ, σ 2 ) σ 2 g(x) = x µ ( π(x a) b a ) Olivier Roustant (EMSE) DGSM for interactions SAMO 13 6 / 16

14 Background and motivation 1st-order analysis. Screening : Total indices & DGSM. Poincaré inequality (1-dimensional case) A distribution µ satisfies a Poincaré inequality if for all h in L 2 (µ) such that h(x)dµ(x) = 0, and h (x) L 2 (µ) : h(x) 2 dµ(x) C(µ) h (x) 2 dµ(x) The best constant is denoted C opt (µ). Examples ([Sobol and Kucherenko, 2009], [Ané et al., 2000], [Lamboni et al., 2013], [Bobkov and Houdré, 1997, Bobkov, 1999]) Distribution C opt (µ) A case of equality Uniform U[a, b] (b a) 2 /π 2 g(x) = cos Normal N (µ, σ 2 ) σ 2 g(x) = x µ Properties of µ ( π(x a) b a A Poincaré constant C(µ) [ ] 2 Continuous 4 sup x R ) min(f(x),1 F(x)) f (x) log-concave 1/f (m) 2 ( log-concave, truncated on [a, b] (F(b) F(a)) 2 /f q ( F (a)+f(b) 2 Olivier Roustant (EMSE) DGSM for interactions SAMO 13 6 / 16 )) 2

15 Background and motivation 2nd-order analysis. Interaction screening. Crossed DGSM Second-order analysis considers pairs of variables. It allows interaction screening : To detect {X i, X j } that do not interact together (D super = 0). Olivier Roustant (EMSE) DGSM for interactions SAMO 13 7 / 16

16 Background and motivation 2nd-order analysis. Interaction screening. Crossed DGSM Second-order analysis considers pairs of variables. It allows interaction screening : To detect {X i, X j } that do not interact together (D super = 0). 2nd-order analysis and additive structures If either ν = 0 or D super = 0, then g can be written as a sum of two functions, one that does not depend on x i, the other that does not depend on x j [Hooker, 2004, Friedman and Popescu, 2008] : g(x) = g i (x i ) + g j (x j ) Olivier Roustant (EMSE) DGSM for interactions SAMO 13 7 / 16

17 Background and motivation 2nd-order analysis. Interaction screening. Crossed DGSM Second-order analysis considers pairs of variables. It allows interaction screening : To detect {X i, X j } that do not interact together (D super = 0). 2nd-order analysis and additive structures If either ν = 0 or D super = 0, then g can be written as a sum of two functions, one that does not depend on x i, the other that does not depend on x j [Hooker, 2004, Friedman and Popescu, 2008] : g(x) = g i (x i ) + g j (x j ) [Hooker, 2004] uses it in machine learning [Muehlenstaedt et al., 2012] use it in computer experiments (see after). Olivier Roustant (EMSE) DGSM for interactions SAMO 13 7 / 16

18 Background and motivation 2nd-order analysis. Interaction screening. Crossed DGSM An application of 2nd-order analysis Here, the estimated interaction structure is used to define a suitable covariance kernel for the Ishigami function f (x 1, x 2, x 3 ) = sin(x 1 ) + 7 sin(x 2 ) x 4 3 sin(x 1 ) FIGURE: Left : Kriging with standard kernel ; Middle : Kriging with a block-additive structure estimated from the FANOVA graph (right). See [Muehlenstaedt et al., 2012] for more details. Olivier Roustant (EMSE) DGSM for interactions SAMO 13 8 / 16

19 The main result : A link between superset importance and crossed DGSM Theorem - A link between superset importance and crossed DGSM Assume that all µ i (i = 1,..., d) satisfy a Poincaré inequality. Then for all pairs {i, j} (1 i, j n), D D super C(µ i )C(µ j )ν. and C opt (µ i )C opt (µ j ) is the best constant. Generalizes to more than pairs. Olivier Roustant (EMSE) DGSM for interactions SAMO 13 9 / 16

20 The main result : A link between superset importance and crossed DGSM Theorem - A link between superset importance and crossed DGSM Assume that all µ i (i = 1,..., d) satisfy a Poincaré inequality. Then for all pairs {i, j} (1 i, j n), D D super C(µ i )C(µ j )ν. and C opt (µ i )C opt (µ j ) is the best constant. Generalizes to more than pairs. Sketch of Proof. Denote g super (x) := J {} g J(x J ). Then : Olivier Roustant (EMSE) DGSM for interactions SAMO 13 9 / 16

21 The main result : A link between superset importance and crossed DGSM Theorem - A link between superset importance and crossed DGSM Assume that all µ i (i = 1,..., d) satisfy a Poincaré inequality. Then for all pairs {i, j} (1 i, j n), D D super C(µ i )C(µ j )ν. and C opt (µ i )C opt (µ j ) is the best constant. Generalizes to more than pairs. Sketch of Proof. Denote g super (x) := J {} g J(x J ). Then : 1 D super = var(g super (x)) = ( 2 g super (x)) dµ(x) Olivier Roustant (EMSE) DGSM for interactions SAMO 13 9 / 16

22 The main result : A link between superset importance and crossed DGSM Theorem - A link between superset importance and crossed DGSM Assume that all µ i (i = 1,..., d) satisfy a Poincaré inequality. Then for all pairs {i, j} (1 i, j n), D D super C(µ i )C(µ j )ν. and C opt (µ i )C opt (µ j ) is the best constant. Generalizes to more than pairs. Sketch of Proof. Denote g super (x) := J {} g J(x J ). Then : 1 D super = var(g super (x)) = ( 2 g super (x)) dµ(x) 2 ν = ( ) 2 2 g(x) ( ) 2 x i x j dµ(x) = 2 g super (x) dµ(x) x i x j Olivier Roustant (EMSE) DGSM for interactions SAMO 13 9 / 16

23 The main result : A link between superset importance and crossed DGSM Theorem - A link between superset importance and crossed DGSM Assume that all µ i (i = 1,..., d) satisfy a Poincaré inequality. Then for all pairs {i, j} (1 i, j n), D D super C(µ i )C(µ j )ν. and C opt (µ i )C opt (µ j ) is the best constant. Generalizes to more than pairs. Sketch of Proof. Denote g super (x) := J {} g J(x J ). Then : 1 D super = var(g super (x)) = ( 2 g super (x)) dµ(x) 2 ν = ( ) 2 2 g(x) ( ) 2 x i x j dµ(x) = 2 g super (x) dµ(x) x i x j Finally combine (by integrating) the two Poincaré inequalities : ( 2 g super (x)) ( g super ) 2 (x) dµi (x i ) C(µ i ) dµ i (x i ) x i ( g super x i (x) ) 2 ( dµ j (x j ) C(µ j ) x j g super x i ) 2 (x) dµ j (x j ) Olivier Roustant (EMSE) DGSM for interactions SAMO 13 9 / 16

24 Applications Applications In applications, we would base the results on the upper bounds : ST i U i := C(µ i ) ν i D U := C(µ i )C(µ j ) ν D S super Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

25 Applications Applications In applications, we would base the results on the upper bounds : ST i U i := C(µ i ) ν i D U := C(µ i )C(µ j ) ν D S super The estimation of Di T and D super can be done by MC (or QMC) from [Jansen, 1999] [Liu and Owen, 2006] : D T i = 1 2 [f (x) f (zi, x i )] 2 dµ(x)dµ i (z i ) D super = 1 [f (x) f (xi, z j, x ) 4 f (z i, x j, x ) + f (z i, z j, x ) ] 2 dµ(x)dµi (z i )dµ j (z j ) Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

26 Applications A 6-dimensional example A 6-dimensional example We consider the 6-dimensional function in L 2 ([Muehlenstaedt et al., 2012]) : a(x 1,..., X 6 ) = cos([1, X 1, X 5, X 3 ]φ) + sin([1, X 4, X 2, X 6 ]γ) with φ = [ 0.8, 1.1, 1.1, 1] T, γ = [ 0.5, 0.9, 1, 1.1] T, and where X 1,..., X 6 are assumed i.i.d uniform on [ 1, 1]. Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

27 Applications A 6-dimensional example A 6-dimensional example We consider the 6-dimensional function in L 2 ([Muehlenstaedt et al., 2012]) : a(x 1,..., X 6 ) = cos([1, X 1, X 5, X 3 ]φ) + sin([1, X 4, X 2, X 6 ]γ) with φ = [ 0.8, 1.1, 1.1, 1] T, γ = [ 0.5, 0.9, 1, 1.1] T, and where X 1,..., X 6 are assumed i.i.d uniform on [ 1, 1]. First-order analysis Input S i Si T Ŝi T sd U i Û i sd X (0.012) (0.007) X (0.009) (0.005) X (0.01) (0.006) X (0.008) (0.004) X (0.011) (0.007) X (0.011) (0.007) Screening does not discard any inputs here. Ranking is different (cf. [Sobol and Kucherenko, 2009]) Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

28 Applications A 6-dimensional example Second-order analysis Inputs pair S S super Ŝ super sd U Û sd X 1 : X (0) 0 0 (0) X 1 : X (0.005) (0.003) X 1 : X (0) 0 0 (0) X 1 : X (0.006) (0.004) X 1 : X (0) 0 0 (0) X 2 : X (0) 0 0 (0) X 2 : X (0.004) (0.002) X 2 : X (0) 0 0 (0) X 2 : X (0.005) (0.003) X 3 : X (0) 0 0 (0) X 3 : X (0.005) (0.003) X 3 : X (0) 0 0 (0) X 4 : X (0) 0 0 (0) X 4 : X (0.004) (0.002) X 5 : X (0) 0 0 (0) Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

29 Applications A 6-dimensional example Visualization of the second-order analysis FIGURE: FANOVA graphs of Ŝsuper (left) and Û (right). Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

30 Applications When the gradient is supplied An advantageous situation : When the gradient is supplied Suppose that one run gives both f (x) and f (x) = ( f (x) x i )1 i d. Then crossed DGSM estimation requires d/2 fewer evaluations : Function only Gradient supplied Total indices (d + 1)N no change DGSMs (d + 1)N N superset importance crossed DGSMs (d d(d 1) 2 )N no change (d d(d 1) 2 )N (d + 1)N TABLE: Computational cost for Monte Carlo estimation. N is the sample size. Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

31 Applications When the gradient is supplied Convergence study when the gradient is supplied Example for the 6-dimensional function a x1x3 x1x5 x2x Number of model evaluations Number of model evaluations Number of model evaluations x2x6 x3x5 x4x Number of model evaluations Number of model evaluations Number of model evaluations FIGURE: Blue : U (upper bounds for crossed DGSM) ; Red : S super. Dotted : True value ; Solid : MC estimates. Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

32 Conclusion Conclusion This work is about 2nd-order analysis, which considers pairs of inputs. There is a Poincaré-type inequality between superset importance (total interaction index) & crossed DGSM : D ( D super 2 ) 2 g(x) C(µ i )C(µ j ) dµ(x) x i x j Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

33 Conclusion Conclusion This work is about 2nd-order analysis, which considers pairs of inputs. There is a Poincaré-type inequality between superset importance (total interaction index) & crossed DGSM : D ( D super 2 ) 2 g(x) C(µ i )C(µ j ) dµ(x) x i x j Crossed DGSM can be used for interaction screening detection of additive structures. Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

34 Conclusion Conclusion This work is about 2nd-order analysis, which considers pairs of inputs. There is a Poincaré-type inequality between superset importance (total interaction index) & crossed DGSM : D ( D super 2 ) 2 g(x) C(µ i )C(µ j ) dµ(x) x i x j Crossed DGSM can be used for interaction screening detection of additive structures. Crossed DGSM are especially useful when the gradient is supplied. Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

35 Conclusion Conclusion This work is about 2nd-order analysis, which considers pairs of inputs. There is a Poincaré-type inequality between superset importance (total interaction index) & crossed DGSM : D ( D super 2 ) 2 g(x) C(µ i )C(µ j ) dµ(x) x i x j Crossed DGSM can be used for interaction screening detection of additive structures. Crossed DGSM are especially useful when the gradient is supplied. Limitations : As for DGSM, crossed DGSM must NOT be used to rank interactions. They may be give poor results for functions with sharp variations, as well as when some of the C(µ i ) s are large. Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

36 References Ané, C., Blachère, S., Chafaï, D., Fougères, P., Gentil, I., Malrieu, F., Roberto, C., and Scheffer, G. (2000). Sur les inégalités de Sobolev logarithmiques, volume 10 of Panoramas et Synthèses. Société Mathématique de France, Paris. Bobkov, S. G. (1999). Isoperimetric and analytic inequalities for log-concave probability measures. The Annals of Probability, 27(4) : Bobkov, S. G. and Houdré, C. (1997). Isoperimetric constants for product probability measures. The Annals of Probability, 25(1) : Efron, B. and Stein, C. (1981). The jackknife estimate of variance. The Annals of Statistics, 9(3) : Friedman, J. and Popescu, B. (2008). Predictive Learning via Rule Ensembles. The Annals of Applied Statistics, 2(3) : Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

37 References Fruth, J., Roustant, O., and Kuhnt, S. (2013). Total interaction index : A variance-based sensitivity index for interaction screening. Submitted. Hooker, G. (2004). Discovering additive structure in black box functions. In Proceedings of KDD 2004, pages ACM DL. Jansen, M. (1999). Analysis of variance designs for model output. Computer Physics Communication, 117 : Lamboni, M., Iooss, B., Popelin, A.-L., and Gamboa, F. (2013). Derivative-based global sensitivity measures : General links with Sobol indices and numerical tests. Mathematics and Computers in Simulation, 87 : Liu, R. and Owen, A. (2006). Estimating mean dimensionality of analysis of variance decompositions. Journal of the American Statistical Association, 101(474) : Muehlenstaedt, T., Roustant, O., Carraro, L., and Kuhnt, S. (2012). Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

38 References Data-driven Kriging models based on FANOVA-decomposition. Statistics & Computing, 22 : Sobol, I. (1993). Sensitivity estimates for non linear mathematical models. Mathematical Modelling and Computational Experiments, 1 : Sobol, I. and Gresham, A. (1995). On an alternative global sensitivity estimators. In Proceedings of SAMO 1995, pages 40 42, Belgirate. Sobol, I. and Kucherenko, S. (2009). Derivative-based global sensitivity measures and the link with global sensitivity indices. Mathematics and Computers in Simulation, 79 : Olivier Roustant (EMSE) DGSM for interactions SAMO / 16

Poincaré inequalities revisited for dimension reduction

Poincaré inequalities revisited for dimension reduction Poincaré inequalities revisited for dimension reduction Olivier Roustant*, Franck Barthe** and Bertrand Iooss**, *** * Mines Saint-Étienne ** Institut de Mathématiques de Toulouse *** EDF, Chatou March

More information

Total interaction index: A variance-based sensitivity index for second-order interaction screening

Total interaction index: A variance-based sensitivity index for second-order interaction screening Total interaction index: A variance-based sensitivity index for second-order interaction screening J. Fruth a, O. Roustant b, S. Kuhnt a,c a Faculty of Statistics, TU Dortmund University, Vogelpothsweg

More information

Total interaction index: A variance-based sensitivity index for interaction screening

Total interaction index: A variance-based sensitivity index for interaction screening Total interaction index: A variance-based sensitivity index for interaction screening Jana Fruth, Olivier Roustant, Sonja Kuhnt To cite this version: Jana Fruth, Olivier Roustant, Sonja Kuhnt. Total interaction

More information

Bootstrap & Confidence/Prediction intervals

Bootstrap & Confidence/Prediction intervals Bootstrap & Confidence/Prediction intervals Olivier Roustant Mines Saint-Étienne 2017/11 Olivier Roustant (EMSE) Bootstrap & Confidence/Prediction intervals 2017/11 1 / 9 Framework Consider a model with

More information

New results for the functional ANOVA and. Sobol indices

New results for the functional ANOVA and. Sobol indices Generalized Sobol Indices 1 New results for the functional ANOVA and Sobol indices Art B. Owen Stanford University Generalized Sobol Indices 2 Ilya Meerovich Sobol At MCM 2001, Salzburg Known for Sobol

More information

Gaussian process regression for Sensitivity analysis

Gaussian process regression for Sensitivity analysis Gaussian process regression for Sensitivity analysis GPSS Workshop on UQ, Sheffield, September 2016 Nicolas Durrande, Mines St-Étienne, durrande@emse.fr GPSS workshop on UQ GPs for sensitivity analysis

More information

Sobol-Hoeffding Decomposition with Application to Global Sensitivity Analysis

Sobol-Hoeffding Decomposition with Application to Global Sensitivity Analysis Sobol-Hoeffding decomposition Application to Global SA Computation of the SI Sobol-Hoeffding Decomposition with Application to Global Sensitivity Analysis Olivier Le Maître with Colleague & Friend Omar

More information

Convergence Rates of Kernel Quadrature Rules

Convergence Rates of Kernel Quadrature Rules Convergence Rates of Kernel Quadrature Rules Francis Bach INRIA - Ecole Normale Supérieure, Paris, France ÉCOLE NORMALE SUPÉRIEURE NIPS workshop on probabilistic integration - Dec. 2015 Outline Introduction

More information

INTERPOLATION BETWEEN LOGARITHMIC SOBOLEV AND POINCARÉ INEQUALITIES

INTERPOLATION BETWEEN LOGARITHMIC SOBOLEV AND POINCARÉ INEQUALITIES INTERPOLATION BETWEEN LOGARITHMIC SOBOLEV AND POINCARÉ INEQUALITIES ANTON ARNOLD, JEAN-PHILIPPE BARTIER, AND JEAN DOLBEAULT Abstract. This paper is concerned with intermediate inequalities which interpolate

More information

Data-driven Kriging models based on FANOVA-decomposition

Data-driven Kriging models based on FANOVA-decomposition Data-driven Kriging models based on FANOVA-decomposition Thomas Muehlenstaedt, Olivier Roustant, Laurent Carraro, Sonja Kuhnt To cite this version: Thomas Muehlenstaedt, Olivier Roustant, Laurent Carraro,

More information

Invariances in spectral estimates. Paris-Est Marne-la-Vallée, January 2011

Invariances in spectral estimates. Paris-Est Marne-la-Vallée, January 2011 Invariances in spectral estimates Franck Barthe Dario Cordero-Erausquin Paris-Est Marne-la-Vallée, January 2011 Notation Notation Given a probability measure ν on some Euclidean space, the Poincaré constant

More information

HYPERCONTRACTIVE MEASURES, TALAGRAND S INEQUALITY, AND INFLUENCES

HYPERCONTRACTIVE MEASURES, TALAGRAND S INEQUALITY, AND INFLUENCES HYPERCONTRACTIVE MEASURES, TALAGRAND S INEQUALITY, AND INFLUENCES D. Cordero-Erausquin, M. Ledoux University of Paris 6 and University of Toulouse, France Abstract. We survey several Talagrand type inequalities

More information

Multi-fidelity sensitivity analysis

Multi-fidelity sensitivity analysis Multi-fidelity sensitivity analysis Loic Le Gratiet 1,2, Claire Cannamela 2 & Bertrand Iooss 3 1 Université Denis-Diderot, Paris, France 2 CEA, DAM, DIF, F-91297 Arpajon, France 3 EDF R&D, 6 quai Watier,

More information

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0 8.7 Taylor s Inequality Math 00 Section 005 Calculus II Name: ANSWER KEY Taylor s Inequality: If f (n+) is continuous and f (n+) < M between the center a and some point x, then f(x) T n (x) M x a n+ (n

More information

Étude de classes de noyaux adaptées à la simplification et à l interprétation des modèles d approximation.

Étude de classes de noyaux adaptées à la simplification et à l interprétation des modèles d approximation. Étude de classes de noyaux adaptées à la simplification et à l interprétation des modèles d approximation. Soutenance de thèse de N. Durrande Ecole des Mines de St-Etienne, 9 november 2011 Directeurs Laurent

More information

Effective dimension of some weighted pre-sobolev spaces with dominating mixed partial derivatives

Effective dimension of some weighted pre-sobolev spaces with dominating mixed partial derivatives Effective dimension of some weighted pre-sobolev spaces with dominating mixed partial derivatives Art B. Owen Stanford University August 2018 Abstract This paper considers two notions of effective dimension

More information

Statistical Models and Methods for Computer Experiments

Statistical Models and Methods for Computer Experiments Statistical Models and Methods for Computer Experiments Olivier ROUSTANT Ecole des Mines de St-Etienne Habilitation à Diriger des Recherches 8 th November 2011 Outline Foreword 1. Computer Experiments:

More information

Learning Target: I can sketch the graphs of rational functions without a calculator. a. Determine the equation(s) of the asymptotes.

Learning Target: I can sketch the graphs of rational functions without a calculator. a. Determine the equation(s) of the asymptotes. Learning Target: I can sketch the graphs of rational functions without a calculator Consider the graph of y= f(x), where f(x) = 3x 3 (x+2) 2 a. Determine the equation(s) of the asymptotes. b. Find the

More information

On Shapley value for measuring importance. of dependent inputs

On Shapley value for measuring importance. of dependent inputs Shapley value & variable importance 1 On Shapley value for measuring importance of dependent inputs Art B. Owen, Stanford joint with Clémentine Prieur, Grenoble Based on forthcoming JUQ article (2017).

More information

VARIANCE COMPONENTS AND GENERALIZED SOBOL INDICES. Copright on this work belongs to SIAM.

VARIANCE COMPONENTS AND GENERALIZED SOBOL INDICES. Copright on this work belongs to SIAM. VARIANCE COMPONENTS AND GENERALIZED SOBOL INDICES ART B. OWEN Abstract. This paper introduces generalized Sobol indices, compares strategies for their estimation, and makes a systematic search for efficient

More information

A modified Poincaré inequality and its application to First Passage Percolation

A modified Poincaré inequality and its application to First Passage Percolation A modified Poincaré inequality and its application to First Passage Percolation Michel Benaïm Institut de Mathématiques Université de Neuchâtel 11 rue Emile Argand 000 Neuchâtel SUISSE e-mail: michel.benaim@unine.ch

More information

ANOVA kernels and RKHS of zero mean functions for model-based sensitivity analysis

ANOVA kernels and RKHS of zero mean functions for model-based sensitivity analysis ANOVA kernels and RKHS of zero mean functions for model-based sensitivity analysis Nicolas Durrande, David Ginsbourger, Olivier Roustant, Laurent Carraro To cite this version: Nicolas Durrande, David Ginsbourger,

More information

VARIANCE COMPONENTS AND GENERALIZED SOBOL INDICES. Art B. Owen. Department of Statistics STANFORD UNIVERSITY Stanford, California

VARIANCE COMPONENTS AND GENERALIZED SOBOL INDICES. Art B. Owen. Department of Statistics STANFORD UNIVERSITY Stanford, California VARIANCE COMPONENTS AND GENERALIZED SOBOL INDICES By Art B. Owen Technical Report No. 2012-07 April 2012 Department of Statistics STANFORD UNIVERSITY Stanford, California 94305-4065 VARIANCE COMPONENTS

More information

Design of experiments for smoke depollution of diesel engine outputs

Design of experiments for smoke depollution of diesel engine outputs ControlledCO 2 Diversifiedfuels Fuel-efficientvehicles Cleanrefining Extendedreserves Design of experiments for smoke depollution of diesel engine outputs M. CANAUD (1), F. WAHL (1), C. HELBERT (2), L.

More information

MODIFIED LOG-SOBOLEV INEQUALITIES AND ISOPERIMETRY

MODIFIED LOG-SOBOLEV INEQUALITIES AND ISOPERIMETRY MODIFIED LOG-SOBOLEV INEQUALITIES AND ISOPERIMETRY ALEXANDER V. KOLESNIKOV Abstract. We find sufficient conditions for a probability measure µ to satisfy an inequality of the type f f f F dµ C f c dµ +

More information

Concepts in Global Sensitivity Analysis IMA UQ Short Course, June 23, 2015

Concepts in Global Sensitivity Analysis IMA UQ Short Course, June 23, 2015 Concepts in Global Sensitivity Analysis IMA UQ Short Course, June 23, 2015 A good reference is Global Sensitivity Analysis: The Primer. Saltelli, et al. (2008) Paul Constantine Colorado School of Mines

More information

From the Prékopa-Leindler inequality to modified logarithmic Sobolev inequality

From the Prékopa-Leindler inequality to modified logarithmic Sobolev inequality From the Prékopa-Leindler inequality to modified logarithmic Sobolev inequality Ivan Gentil Ceremade UMR CNRS no. 7534, Université Paris-Dauphine, Place du maréchal de Lattre de Tassigny, 75775 Paris Cédex

More information

On the analogue of the concavity of entropy power in the Brunn-Minkowski theory

On the analogue of the concavity of entropy power in the Brunn-Minkowski theory On the analogue of the concavity of entropy power in the Brunn-Minkowski theory Matthieu Fradelizi and Arnaud Marsiglietti Université Paris-Est, LAMA (UMR 8050), UPEMLV, UPEC, CNRS, F-77454, Marne-la-Vallée,

More information

On the analogue of the concavity of entropy power in the Brunn-Minkowski theory

On the analogue of the concavity of entropy power in the Brunn-Minkowski theory On the analogue of the concavity of entropy power in the Brunn-Minkowski theory Matthieu Fradelizi and Arnaud Marsiglietti Laboratoire d Analyse et de Mathématiques Appliquées, Université Paris-Est Marne-la-Vallée,

More information

11.10a Taylor and Maclaurin Series

11.10a Taylor and Maclaurin Series 11.10a 1 11.10a Taylor and Maclaurin Series Let y = f(x) be a differentiable function at x = a. In first semester calculus we saw that (1) f(x) f(a)+f (a)(x a), for all x near a The right-hand side of

More information

Lesson 9 Exploring Graphs of Quadratic Functions

Lesson 9 Exploring Graphs of Quadratic Functions Exploring Graphs of Quadratic Functions Graph the following system of linear inequalities: { y > 1 2 x 5 3x + 2y 14 a What are three points that are solutions to the system of inequalities? b Is the point

More information

What is on today. 1 Linear approximation. MA 123 (Calculus I) Lecture 17: November 2, 2017 Section A2. Professor Jennifer Balakrishnan,

What is on today. 1 Linear approximation. MA 123 (Calculus I) Lecture 17: November 2, 2017 Section A2. Professor Jennifer Balakrishnan, Professor Jennifer Balakrishnan, jbala@bu.edu What is on today 1 Linear approximation 1 1.1 Linear approximation and concavity....................... 2 1.2 Change in y....................................

More information

Calculus I Homework: Linear Approximation and Differentials Page 1

Calculus I Homework: Linear Approximation and Differentials Page 1 Calculus I Homework: Linear Approximation and Differentials Page Example (3..8) Find the linearization L(x) of the function f(x) = (x) /3 at a = 8. The linearization is given by which approximates the

More information

Convex inequalities, isoperimetry and spectral gap III

Convex inequalities, isoperimetry and spectral gap III Convex inequalities, isoperimetry and spectral gap III Jesús Bastero (Universidad de Zaragoza) CIDAMA Antequera, September 11, 2014 Part III. K-L-S spectral gap conjecture KLS estimate, through Milman's

More information

Convergence of Eigenspaces in Kernel Principal Component Analysis

Convergence of Eigenspaces in Kernel Principal Component Analysis Convergence of Eigenspaces in Kernel Principal Component Analysis Shixin Wang Advanced machine learning April 19, 2016 Shixin Wang Convergence of Eigenspaces April 19, 2016 1 / 18 Outline 1 Motivation

More information

Gibbs Sampling in Linear Models #2

Gibbs Sampling in Linear Models #2 Gibbs Sampling in Linear Models #2 Econ 690 Purdue University Outline 1 Linear Regression Model with a Changepoint Example with Temperature Data 2 The Seemingly Unrelated Regressions Model 3 Gibbs sampling

More information

Kullback-Leibler Designs

Kullback-Leibler Designs Kullback-Leibler Designs Astrid JOURDAN Jessica FRANCO Contents Contents Introduction Kullback-Leibler divergence Estimation by a Monte-Carlo method Design comparison Conclusion 2 Introduction Computer

More information

Calculus I Homework: Linear Approximation and Differentials Page 1

Calculus I Homework: Linear Approximation and Differentials Page 1 Calculus I Homework: Linear Approximation and Differentials Page Questions Example Find the linearization L(x) of the function f(x) = (x) /3 at a = 8. Example Find the linear approximation of the function

More information

Concentration inequalities: basics and some new challenges

Concentration inequalities: basics and some new challenges Concentration inequalities: basics and some new challenges M. Ledoux University of Toulouse, France & Institut Universitaire de France Measure concentration geometric functional analysis, probability theory,

More information

Math 261 Calculus I. Test 1 Study Guide. Name. Decide whether the limit exists. If it exists, find its value. 1) lim x 1. f(x) 2) lim x -1/2 f(x)

Math 261 Calculus I. Test 1 Study Guide. Name. Decide whether the limit exists. If it exists, find its value. 1) lim x 1. f(x) 2) lim x -1/2 f(x) Math 261 Calculus I Test 1 Study Guide Name Decide whether the it exists. If it exists, find its value. 1) x 1 f(x) 2) x -1/2 f(x) Complete the table and use the result to find the indicated it. 3) If

More information

14 Increasing and decreasing functions

14 Increasing and decreasing functions 14 Increasing and decreasing functions 14.1 Sketching derivatives READING Read Section 3.2 of Rogawski Reading Recall, f (a) is the gradient of the tangent line of f(x) at x = a. We can use this fact to

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

Final Exam A Name. 20 i C) Solve the equation by factoring. 4) x2 = x + 30 A) {-5, 6} B) {5, 6} C) {1, 30} D) {-5, -6} -9 ± i 3 14

Final Exam A Name. 20 i C) Solve the equation by factoring. 4) x2 = x + 30 A) {-5, 6} B) {5, 6} C) {1, 30} D) {-5, -6} -9 ± i 3 14 Final Exam A Name First, write the value(s) that make the denominator(s) zero. Then solve the equation. 1 1) x + 3 + 5 x - 3 = 30 (x + 3)(x - 3) 1) A) x -3, 3; B) x -3, 3; {4} C) No restrictions; {3} D)

More information

Spring 2012 Math 541B Exam 1

Spring 2012 Math 541B Exam 1 Spring 2012 Math 541B Exam 1 1. A sample of size n is drawn without replacement from an urn containing N balls, m of which are red and N m are black; the balls are otherwise indistinguishable. Let X denote

More information

MATH 2053 Calculus I Review for the Final Exam

MATH 2053 Calculus I Review for the Final Exam MATH 05 Calculus I Review for the Final Exam (x+ x) 9 x 9 1. Find the limit: lim x 0. x. Find the limit: lim x + x x (x ).. Find lim x (x 5) = L, find such that f(x) L < 0.01 whenever 0 < x

More information

Sample Geometry. Edps/Soc 584, Psych 594. Carolyn J. Anderson

Sample Geometry. Edps/Soc 584, Psych 594. Carolyn J. Anderson Sample Geometry Edps/Soc 584, Psych 594 Carolyn J. Anderson Department of Educational Psychology I L L I N O I S university of illinois at urbana-champaign c Board of Trustees, University of Illinois Spring

More information

Topics and Concepts. 1. Limits

Topics and Concepts. 1. Limits Topics and Concepts 1. Limits (a) Evaluating its (Know: it exists if and only if the it from the left is the same as the it from the right) (b) Infinite its (give rise to vertical asymptotes) (c) Limits

More information

Algorithms for Uncertainty Quantification

Algorithms for Uncertainty Quantification Algorithms for Uncertainty Quantification Lecture 9: Sensitivity Analysis ST 2018 Tobias Neckel Scientific Computing in Computer Science TUM Repetition of Previous Lecture Sparse grids in Uncertainty Quantification

More information

Section 4.2: The Mean Value Theorem

Section 4.2: The Mean Value Theorem Section 4.2: The Mean Value Theorem Before we continue with the problem of describing graphs using calculus we shall briefly pause to examine some interesting applications of the derivative. In previous

More information

Stein s method, logarithmic Sobolev and transport inequalities

Stein s method, logarithmic Sobolev and transport inequalities Stein s method, logarithmic Sobolev and transport inequalities M. Ledoux University of Toulouse, France and Institut Universitaire de France Stein s method, logarithmic Sobolev and transport inequalities

More information

Concentration, self-bounding functions

Concentration, self-bounding functions Concentration, self-bounding functions S. Boucheron 1 and G. Lugosi 2 and P. Massart 3 1 Laboratoire de Probabilités et Modèles Aléatoires Université Paris-Diderot 2 Economics University Pompeu Fabra 3

More information

A Note on Jackknife Based Estimates of Sampling Distributions. Abstract

A Note on Jackknife Based Estimates of Sampling Distributions. Abstract A Note on Jackknife Based Estimates of Sampling Distributions C. Houdré Abstract Tail estimates of statistics are given; they depend on jackknife estimates of variance of the statistics of interest. 1

More information

Limits and Continuity. 2 lim. x x x 3. lim x. lim. sinq. 5. Find the horizontal asymptote (s) of. Summer Packet AP Calculus BC Page 4

Limits and Continuity. 2 lim. x x x 3. lim x. lim. sinq. 5. Find the horizontal asymptote (s) of. Summer Packet AP Calculus BC Page 4 Limits and Continuity t+ 1. lim t - t + 4. lim x x x x + - 9-18 x-. lim x 0 4-x- x 4. sinq lim - q q 5. Find the horizontal asymptote (s) of 7x-18 f ( x) = x+ 8 Summer Packet AP Calculus BC Page 4 6. x

More information

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 = Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values

More information

MA 123 September 8, 2016

MA 123 September 8, 2016 Instantaneous velocity and its Today we first revisit the notion of instantaneous velocity, and then we discuss how we use its to compute it. Learning Catalytics session: We start with a question about

More information

Kolmogorov Berry-Esseen bounds for binomial functionals

Kolmogorov Berry-Esseen bounds for binomial functionals Kolmogorov Berry-Esseen bounds for binomial functionals Raphaël Lachièze-Rey, Univ. South California, Univ. Paris 5 René Descartes, Joint work with Giovanni Peccati, University of Luxembourg, Singapore

More information

Calculus I Announcements

Calculus I Announcements Slide 1 Calculus I Announcements Read sections 4.2,4.3,4.4,4.1 and 5.3 Do the homework from sections 4.2,4.3,4.4,4.1 and 5.3 Exam 3 is Thursday, November 12th See inside for a possible exam question. Slide

More information

Nonlinear diffusions, hypercontractivity and the optimal L p -Euclidean logarithmic Sobolev inequality

Nonlinear diffusions, hypercontractivity and the optimal L p -Euclidean logarithmic Sobolev inequality Nonlinear diffusions, hypercontractivity and the optimal L p -Euclidean logarithmic Sobolev inequality Manuel DEL PINO a Jean DOLBEAULT b,2, Ivan GENTIL c a Departamento de Ingeniería Matemática, F.C.F.M.,

More information

Modified logarithmic Sobolev inequalities and transportation inequalities

Modified logarithmic Sobolev inequalities and transportation inequalities Probab. Theory Relat. Fields 133, 409 436 005 Digital Object Identifier DOI 10.1007/s00440-005-043-9 Ivan Gentil Arnaud Guillin Laurent Miclo Modified logarithmic Sobolev inequalities and transportation

More information

Final Exam C Name i D) 2. Solve the equation by factoring. 4) x2 = x + 72 A) {1, 72} B) {-8, 9} C) {-8, -9} D) {8, 9} 9 ± i

Final Exam C Name i D) 2. Solve the equation by factoring. 4) x2 = x + 72 A) {1, 72} B) {-8, 9} C) {-8, -9} D) {8, 9} 9 ± i Final Exam C Name First, write the value(s) that make the denominator(s) zero. Then solve the equation. 7 ) x + + 3 x - = 6 (x + )(x - ) ) A) No restrictions; {} B) x -, ; C) x -; {} D) x -, ; {2} Add

More information

+ 1 for x > 2 (B) (E) (B) 2. (C) 1 (D) 2 (E) Nonexistent

+ 1 for x > 2 (B) (E) (B) 2. (C) 1 (D) 2 (E) Nonexistent dx = (A) 3 sin(3x ) + C 1. cos ( 3x) 1 (B) sin(3x ) + C 3 1 (C) sin(3x ) + C 3 (D) sin( 3x ) + C (E) 3 sin(3x ) + C 6 3 2x + 6x 2. lim 5 3 x 0 4x + 3x (A) 0 1 (B) 2 (C) 1 (D) 2 (E) Nonexistent is 2 x 3x

More information

Sobol Indices: an Introduction and. Some Recent Results

Sobol Indices: an Introduction and. Some Recent Results Sobol indices 1 Sobol Indices: an Introduction and Some Recent Results Art B. Owen Stanford University Sobol indices 2 Ilya Meerovich Sobol At MCM 2001, Salzburg Known for Sobol sequences and Sobol indices

More information

MIDTERM 2. Section: Signature:

MIDTERM 2. Section: Signature: MIDTERM 2 Math 3A 11/17/2010 Name: Section: Signature: Read all of the following information before starting the exam: Check your exam to make sure all pages are present. When you use a major theorem (like

More information

Multivariate statistical methods and data mining in particle physics

Multivariate statistical methods and data mining in particle physics Multivariate statistical methods and data mining in particle physics RHUL Physics www.pp.rhul.ac.uk/~cowan Academic Training Lectures CERN 16 19 June, 2008 1 Outline Statement of the problem Some general

More information

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x

More information

Study Guide/Practice Exam 2 Solution. This study guide/practice exam is longer and harder than the actual exam. Problem A: Power Series. x 2i /i!

Study Guide/Practice Exam 2 Solution. This study guide/practice exam is longer and harder than the actual exam. Problem A: Power Series. x 2i /i! Study Guide/Practice Exam 2 Solution This study guide/practice exam is longer and harder than the actual exam Problem A: Power Series (1) Find a series representation of f(x) = e x2 Explain why the series

More information

Polynomial chaos expansions for sensitivity analysis

Polynomial chaos expansions for sensitivity analysis c DEPARTMENT OF CIVIL, ENVIRONMENTAL AND GEOMATIC ENGINEERING CHAIR OF RISK, SAFETY & UNCERTAINTY QUANTIFICATION Polynomial chaos expansions for sensitivity analysis B. Sudret Chair of Risk, Safety & Uncertainty

More information

To get horizontal and slant asymptotes algebraically we need to know about end behaviour for rational functions.

To get horizontal and slant asymptotes algebraically we need to know about end behaviour for rational functions. Concepts: Horizontal Asymptotes, Vertical Asymptotes, Slant (Oblique) Asymptotes, Transforming Reciprocal Function, Sketching Rational Functions, Solving Inequalities using Sign Charts. Rational Function

More information

Concentration inequalities and the entropy method

Concentration inequalities and the entropy method Concentration inequalities and the entropy method Gábor Lugosi ICREA and Pompeu Fabra University Barcelona what is concentration? We are interested in bounding random fluctuations of functions of many

More information

Linear Dimensionality Reduction

Linear Dimensionality Reduction Outline Hong Chang Institute of Computing Technology, Chinese Academy of Sciences Machine Learning Methods (Fall 2012) Outline Outline I 1 Introduction 2 Principal Component Analysis 3 Factor Analysis

More information

HW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.

HW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given. HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard

More information

Calculus 221 worksheet

Calculus 221 worksheet Calculus 221 worksheet Graphing A function has a global maximum at some a in its domain if f(x) f(a) for all other x in the domain of f. Global maxima are sometimes also called absolute maxima. A function

More information

A new method to bound rate of convergence

A new method to bound rate of convergence A new method to bound rate of convergence Arup Bose Indian Statistical Institute, Kolkata, abose@isical.ac.in Sourav Chatterjee University of California, Berkeley Empirical Spectral Distribution Distribution

More information

2.2 The Limit of a Function

2.2 The Limit of a Function 2.2 The Limit of a Function Introductory Example: Consider the function f(x) = x is near 0. x f(x) x f(x) 1 3.7320508 1 4.236068 0.5 3.8708287 0.5 4.1213203 0.1 3.9748418 0.1 4.0248457 0.05 3.9874607 0.05

More information

HYPERCONTRACTIVITY FOR PERTURBED DIFFUSION SEMIGROUPS. Ecole Polytechnique and Université Paris X

HYPERCONTRACTIVITY FOR PERTURBED DIFFUSION SEMIGROUPS. Ecole Polytechnique and Université Paris X HYPERCONTRACTIVITY FOR PERTURBED DIFFUSION SEMIGROUPS. PATRICK CATTIAUX Ecole Polytechnique and Université Paris X Abstract. µ being a nonnegative measure satisfying some Log-Sobolev inequality, we give

More information

Expansion and Isoperimetric Constants for Product Graphs

Expansion and Isoperimetric Constants for Product Graphs Expansion and Isoperimetric Constants for Product Graphs C. Houdré and T. Stoyanov May 4, 2004 Abstract Vertex and edge isoperimetric constants of graphs are studied. Using a functional-analytic approach,

More information

Cross Validation and Maximum Likelihood estimations of hyper-parameters of Gaussian processes with model misspecification

Cross Validation and Maximum Likelihood estimations of hyper-parameters of Gaussian processes with model misspecification Cross Validation and Maximum Likelihood estimations of hyper-parameters of Gaussian processes with model misspecification François Bachoc Josselin Garnier Jean-Marc Martinez CEA-Saclay, DEN, DM2S, STMF,

More information

Learning gradients: prescriptive models

Learning gradients: prescriptive models Department of Statistical Science Institute for Genome Sciences & Policy Department of Computer Science Duke University May 11, 2007 Relevant papers Learning Coordinate Covariances via Gradients. Sayan

More information

Math 180, Final Exam, Fall 2012 Problem 1 Solution

Math 180, Final Exam, Fall 2012 Problem 1 Solution Math 80, Final Exam, Fall 0 Problem Solution. Find the derivatives of the following functions: (a) ln(ln(x)) (b) x 6 + sin(x) e x (c) tan(x ) + cot(x ) (a) We evaluate the derivative using the Chain Rule.

More information

Two-sample hypothesis testing for random dot product graphs

Two-sample hypothesis testing for random dot product graphs Two-sample hypothesis testing for random dot product graphs Minh Tang Department of Applied Mathematics and Statistics Johns Hopkins University JSM 2014 Joint work with Avanti Athreya, Vince Lyzinski,

More information

4. We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x

4. We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x 4 We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x x, x > 0 Since tan x = cos x, from the quotient rule, tan x = sin

More information

Applications of Linear Programming

Applications of Linear Programming Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 9 Non-linear programming In case of LP, the goal

More information

Calculus I. 1. Limits and Continuity

Calculus I. 1. Limits and Continuity 2301107 Calculus I 1. Limits and Continuity Outline 1.1. Limits 1.1.1 Motivation:Tangent 1.1.2 Limit of a function 1.1.3 Limit laws 1.1.4 Mathematical definition of a it 1.1.5 Infinite it 1.1. Continuity

More information

Sections 4.1 & 4.2: Using the Derivative to Analyze Functions

Sections 4.1 & 4.2: Using the Derivative to Analyze Functions Sections 4.1 & 4.2: Using the Derivative to Analyze Functions f (x) indicates if the function is: Increasing or Decreasing on certain intervals. Critical Point c is where f (c) = 0 (tangent line is horizontal),

More information

8.1 Concentration inequality for Gaussian random matrix (cont d)

8.1 Concentration inequality for Gaussian random matrix (cont d) MGMT 69: Topics in High-dimensional Data Analysis Falll 26 Lecture 8: Spectral clustering and Laplacian matrices Lecturer: Jiaming Xu Scribe: Hyun-Ju Oh and Taotao He, October 4, 26 Outline Concentration

More information

Heat Flows, Geometric and Functional Inequalities

Heat Flows, Geometric and Functional Inequalities Heat Flows, Geometric and Functional Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France heat flow and semigroup interpolations Duhamel formula (19th century) pde, probability, dynamics

More information

WEEK 8. CURVE SKETCHING. 1. Concavity

WEEK 8. CURVE SKETCHING. 1. Concavity WEEK 8. CURVE SKETCHING. Concavity Definition. (Concavity). The graph of a function y = f(x) is () concave up on an interval I if for any two points a, b I, the straight line connecting two points (a,

More information

Local and Global Sensitivity Analysis

Local and Global Sensitivity Analysis Omar 1,2 1 Duke University Department of Mechanical Engineering & Materials Science omar.knio@duke.edu 2 KAUST Division of Computer, Electrical, Mathematical Science & Engineering omar.knio@kaust.edu.sa

More information

Sequential approaches to reliability estimation and optimization based on kriging

Sequential approaches to reliability estimation and optimization based on kriging Sequential approaches to reliability estimation and optimization based on kriging Rodolphe Le Riche1,2 and Olivier Roustant2 1 CNRS ; 2 Ecole des Mines de Saint-Etienne JSO 2012, ONERA Palaiseau 1 Intro

More information

Exam 3 Solutions. Multiple Choice Questions

Exam 3 Solutions. Multiple Choice Questions MA 4 Exam 3 Solutions Fall 26 Exam 3 Solutions Multiple Choice Questions. The average value of the function f (x) = x + sin(x) on the interval [, 2π] is: A. 2π 2 2π B. π 2π 2 + 2π 4π 2 2π 4π 2 + 2π 2.

More information

Gaussian Process Regression and Emulation

Gaussian Process Regression and Emulation Gaussian Process Regression and Emulation STAT8810, Fall 2017 M.T. Pratola September 22, 2017 Today Experimental Design; Sensitivity Analysis Designing Your Experiment If you will run a simulator model,

More information

ON A METHOD TO DISPROVE GENERALIZED BRUNN MINKOWSKI INEQUALITIES

ON A METHOD TO DISPROVE GENERALIZED BRUNN MINKOWSKI INEQUALITIES ON A METHOD TO DISPROVE GENERALIZED BRUNN MINKOWSKI INEQUALITIES NICOLAS JUILLET Abstract. We present a general method to disprove generalized Brunn Minkowski inequalities. We initially developed this

More information

18Ï È² 7( &: ÄuANOVAp.O`û5 571 Based on this ANOVA model representation, Sobol (1993) proposed global sensitivity index, S i1...i s = D i1...i s /D, w

18Ï È² 7( &: ÄuANOVAp.O`û5 571 Based on this ANOVA model representation, Sobol (1993) proposed global sensitivity index, S i1...i s = D i1...i s /D, w A^VÇÚO 1 Êò 18Ï 2013c12 Chinese Journal of Applied Probability and Statistics Vol.29 No.6 Dec. 2013 Optimal Properties of Orthogonal Arrays Based on ANOVA High-Dimensional Model Representation Chen Xueping

More information

Test 2 Review Math 1111 College Algebra

Test 2 Review Math 1111 College Algebra Test 2 Review Math 1111 College Algebra 1. Begin by graphing the standard quadratic function f(x) = x 2. Then use transformations of this graph to graph the given function. g(x) = x 2 + 2 *a. b. c. d.

More information

AP Calculus Chapter 3 Testbank (Mr. Surowski)

AP Calculus Chapter 3 Testbank (Mr. Surowski) AP Calculus Chapter 3 Testbank (Mr. Surowski) Part I. Multiple-Choice Questions (5 points each; please circle the correct answer.). If f(x) = 0x 4 3 + x, then f (8) = (A) (B) 4 3 (C) 83 3 (D) 2 3 (E) 2

More information

Resources: http://www.calcchat.com/book/calculus-9e/ http://apcentral.collegeboard.com/apc/public/courses/teachers_corner/27.html http://www.calculus.org/ http://cow.math.temple.edu/ http://www.mathsisfun.com/calculus/

More information

The Sobol decomposition

The Sobol decomposition Introduction Generalized decomposition Generalized sensitivity indices Examples of distribution The Sobol decomposition Suppose x =(x1,,x p ) [0, 1] p η : [0, 1] p R adeterministicfunction ANOVA decomposition

More information

Pre-AP Algebra 2 Lesson 1-5 Linear Functions

Pre-AP Algebra 2 Lesson 1-5 Linear Functions Lesson 1-5 Linear Functions Objectives: Students will be able to graph linear functions, recognize different forms of linear functions, and translate linear functions. Students will be able to recognize

More information

Matrix Factorization with Applications to Clustering Problems: Formulation, Algorithms and Performance

Matrix Factorization with Applications to Clustering Problems: Formulation, Algorithms and Performance Date: Mar. 3rd, 2017 Matrix Factorization with Applications to Clustering Problems: Formulation, Algorithms and Performance Presenter: Songtao Lu Department of Electrical and Computer Engineering Iowa

More information

Introduction to Self-normalized Limit Theory

Introduction to Self-normalized Limit Theory Introduction to Self-normalized Limit Theory Qi-Man Shao The Chinese University of Hong Kong E-mail: qmshao@cuhk.edu.hk Outline What is the self-normalization? Why? Classical limit theorems Self-normalized

More information