Adapting quasi-monte Carlo methods to simulation problems in weighted Korobov spaces

Size: px
Start display at page:

Download "Adapting quasi-monte Carlo methods to simulation problems in weighted Korobov spaces"

Transcription

1 Adapting quasi-monte Carlo methods to simulation problems in weighted Korobov spaces Christian Irrgeher joint work with G. Leobacher RICAM Special Semester Workshop 1 Uniform distribution and quasi-monte Carlo methods October 2013, Linz Christian Irrgeher (JKU Linz) 1

2 Problem formulation Efficient computation of E(g(B)) B... standard Brownian motion with index set [0, T] g... suitable function Christian Irrgeher (JKU Linz) 2

3 Problem formulation Efficient computation of E(g(B)) B... standard Brownian motion with index set [0, T] g... suitable function Examples in finance, biology, physics,... e.g.: Financial derivative pricing Gaussian financial market models European-style options Christian Irrgeher (JKU Linz) 2

4 Numerical simulation quasi-monte Carlo (QMC) 1. Discretization E(g(B)) E(gd (B T d (X1,..., X d ) are independent N (0, 1),..., B d T )) = E(f d (X 1,..., X d )) =: I(f d ) d Christian Irrgeher (JKU Linz) 3

5 Numerical simulation quasi-monte Carlo (QMC) 1. Discretization E(g(B)) E(gd (B T d (X1,..., X d ) are independent N (0, 1) 2. QMC integration I(fd ) 1 N N j=1 f d(x j ) =: Q d,n (f d ) {x1,..., x N } R d deterministic point set,..., B d T )) = E(f d (X 1,..., X d )) =: I(f d ) d Christian Irrgeher (JKU Linz) 3

6 Numerical simulation quasi-monte Carlo (QMC) 1. Discretization E(g(B)) E(gd (B T d (X1,..., X d ) are independent N (0, 1) 2. QMC integration I(fd ) 1 N N j=1 f d(x j ) =: Q d,n (f d ) {x1,..., x N } R d deterministic point set,..., B d T )) = E(f d (X 1,..., X d )) =: I(f d ) d Error of QMC algorithm Q d,n err := E(g(B)) Q d,n (f d ) Christian Irrgeher (JKU Linz) 3

7 Error estimate First estimate: err E(g(B)) I ( ) f d + I ( ) f d Qd,N (f d ) discretization error integration error Christian Irrgeher (JKU Linz) 4

8 Error estimate First estimate: err E(g(B)) I ( ) f d + I ( ) f d Qd,N (f d ) discretization error integration error Analysis of both errors emphasis on integration error but discretization error not negligible Christian Irrgeher (JKU Linz) 4

9 Discretization error Discretization (with step size 1/d) Euler-Maruyama method Milstein method... Christian Irrgeher (JKU Linz) 5

10 Discretization error Discretization (with step size 1/d) Euler-Maruyama method Milstein method... Discretization error err disc c 1 d p with convergence rate p > 0 and constant c 1 > 0 Christian Irrgeher (JKU Linz) 5

11 Discretization error Discretization (with step size 1/d) Euler-Maruyama method Milstein method... Discretization error err disc c 1 d p with convergence rate p > 0 and constant c 1 > 0 Convergence rate depends on discretization method function g Christian Irrgeher (JKU Linz) 5

12 Gaussian measure and Hermite polynomials Density of the (standard) Gaussian measure ϕ(x) = 1 2π e x x 2 Christian Irrgeher (JKU Linz) 6

13 Gaussian measure and Hermite polynomials Density of the (standard) Gaussian measure ϕ(x) = 1 2π e x x 2 L 2 (R d, ϕ) = {f : R d R : f measurable, R d f(x) 2 ϕ(x)dx < } Christian Irrgeher (JKU Linz) 6

14 Gaussian measure and Hermite polynomials Density of the (standard) Gaussian measure ϕ(x) = 1 2π e x x 2 L 2 (R d, ϕ) = {f : R d R : f measurable, R d f(x) 2 ϕ(x)dx < } Univariate Hermite polynomials H k (x) = ( 1)k e x2 2 k! d k dx k e x 2 2 Christian Irrgeher (JKU Linz) 6

15 Gaussian measure and Hermite polynomials Density of the (standard) Gaussian measure ϕ(x) = 1 2π e x x 2 L 2 (R d, ϕ) = {f : R d R : f measurable, R d f(x) 2 ϕ(x)dx < } Univariate Hermite polynomials H k (x) = ( 1)k e x2 2 k! Multivariate Hermite polynomials d k dx k e x 2 2 d H k (x) = H kj (x j ) j=1 Christian Irrgeher (JKU Linz) 6

16 Gaussian measure and Hermite polynomials Density of the (standard) Gaussian measure ϕ(x) = 1 2π e x x 2 L 2 (R d, ϕ) = {f : R d R : f measurable, R d f(x) 2 ϕ(x)dx < } Univariate Hermite polynomials H k (x) = ( 1)k e x2 2 k! Multivariate Hermite polynomials {H k } k is an ONB of L 2 (R d, ϕ) d k dx k e x 2 2 d H k (x) = H kj (x j ) j=1 Christian Irrgeher (JKU Linz) 6

17 Hermite expansion Hermite expansion of f L 2 (R d, ϕ) f(x) = ˆf(k)H k (x) in L 2 k N d 0 k-th Hermite coefficient ˆf(k) = R d f(x)h k (x)ϕ(x)dx Christian Irrgeher (JKU Linz) 7

18 Hermite expansion Hermite expansion of f L 2 (R d, ϕ) f(x) = ˆf(k)H k (x) in L 2 k N d 0 k-th Hermite coefficient ˆf(k) = R d f(x)h k (x)ϕ(x)dx Theorem Let f L 2 (R d, ϕ) C(R d ) and k N ˆf(k) d <. Then 0 f(x) = ˆf(k)H k (x) for all x R d. k N d 0 Christian Irrgeher (JKU Linz) 7

19 Korobov space of functions on R Let α > 1, γ > 0. Define for k N 0 : { 1 if k = 0 r(α, γ, k) := γk α if k 0 Christian Irrgeher (JKU Linz) 8

20 Korobov space of functions on R Let α > 1, γ > 0. Define for k N 0 : r(α, γ, k) := Introduce inner product: { 1 if k = 0 γk α if k 0 f, g α,γ := r(α, γ, k) 1 ˆf(k)ĝ(k) k=0 Christian Irrgeher (JKU Linz) 8

21 Korobov space of functions on R Let α > 1, γ > 0. Define for k N 0 : r(α, γ, k) := { 1 if k = 0 γk α if k 0 Introduce inner product: f, g α,γ := r(α, γ, k) 1 ˆf(k)ĝ(k) k=0 Corresponding norm: f α,γ = f, f α,γ Christian Irrgeher (JKU Linz) 8

22 Korobov space of functions on R Let α > 1, γ > 0. Define for k N 0 : r(α, γ, k) := { 1 if k = 0 γk α if k 0 Introduce inner product: f, g α,γ := r(α, γ, k) 1 ˆf(k)ĝ(k) k=0 Corresponding norm: f α,γ = Function space: f, f α,γ H α,γ (R, ϕ) := {f L 2 (R, ϕ) C(R) : f α,γ < } Christian Irrgeher (JKU Linz) 8

23 Korobov space of functions on R H α,γ (R, ϕ) is a reproducing kernel Hilbert space Christian Irrgeher (JKU Linz) 9

24 Korobov space of functions on R H α,γ (R, ϕ) is a reproducing kernel Hilbert space Reproducing kernel function K α,γ : R R R Kα,γ (, y) H α,γ (R, ϕ) y R f, Kα,γ (, y) α,γ = f(y) y R f H α,γ (R, ϕ) Christian Irrgeher (JKU Linz) 9

25 Korobov space of functions on R H α,γ (R, ϕ) is a reproducing kernel Hilbert space Reproducing kernel function K α,γ : R R R Kα,γ (, y) H α,γ (R, ϕ) y R f, Kα,γ (, y) α,γ = f(y) y R f H α,γ (R, ϕ) Series representation of the reproducing kernel K α,γ (x, y) = 1 + γ k α H k (x)h k (y) k=1 Christian Irrgeher (JKU Linz) 9

26 Korobov space of functions on R There are interesting functions in this space. Define differential operator D x := d dx x Christian Irrgeher (JKU Linz) 10

27 Korobov space of functions on R There are interesting functions in this space. Define differential operator D x := d dx x Theorem (I. & Leobacher) Let β > 2 be an integer and f : R R be a β times differentiable function such that (i) D j xf(x)ϕ(x) 1 2 L 1 (R) for each j {1,..., β} and (ii) D j xf(x) = O ( e x2 /(2c) ) as x for each j {0,..., β 1} and some c > 1. Then f H α,γ (R, ϕ) with 1 < α < β 1. Christian Irrgeher (JKU Linz) 10

28 Korobov space of functions on R d For non-increasing weights γ = (γ 1,..., γ d ) H α,γ (R d, ϕ) := H α,γ1 (R, ϕ)... H α,γd (R, ϕ) Christian Irrgeher (JKU Linz) 11

29 Korobov space of functions on R d For non-increasing weights γ = (γ 1,..., γ d ) H α,γ (R d, ϕ) := H α,γ1 (R, ϕ)... H α,γd (R, ϕ) Inner product: f, g α,γ = k N d r(α, γ, k) 1 ˆf(k)ĝ(k) 0 with r(α, γ, k) = d j=1 r(α, γ j, k j ) Christian Irrgeher (JKU Linz) 11

30 Korobov space of functions on R d For non-increasing weights γ = (γ 1,..., γ d ) H α,γ (R d, ϕ) := H α,γ1 (R, ϕ)... H α,γd (R, ϕ) Inner product: f, g α,γ = k N d 0 r(α, γ, k) 1 ˆf(k)ĝ(k) with r(α, γ, k) = d j=1 r(α, γ j, k j ) H α,γ (R d, ϕ) is a weighted reproducing kernel Hilbert space Reproducing kernel Kα,γ (x, y) = d j=1 K α,γ j (x j, y j ) Influence of variables is given by the choice of weights γ Christian Irrgeher (JKU Linz) 11

31 Integration Error Let f d H α,γ (R d, ϕ). I(fd ) = f R d d (x)ϕ(x)dx = f R d d, K α,γ (, x) α,γ ϕ(x)dx = f d, K R d α,γ (, x)ϕ(x)dx α,γ Qd,N (f d ) = f d, 1 N N n=1 K α,γ(, x n ) α,γ Christian Irrgeher (JKU Linz) 12

32 Integration Error Let f d H α,γ (R d, ϕ). I(fd ) = R d f d (x)ϕ(x)dx = R d f d, K α,γ (, x) α,γ ϕ(x)dx = f d, R d K α,γ (, x)ϕ(x)dx α,γ Qd,N (f d ) = f d, 1 N N n=1 K α,γ(, x n ) α,γ Integration error err QMC = I(f d ) Q d,n (f d ) f α,γ d K α,γ (, x)ϕ(x)dx 1 N K α,γ (, x n ) R d N α,γ n=1 }{{} =:e d,n (x 1,...,x N ) Christian Irrgeher (JKU Linz) 12

33 Worst case error of integration Considering the Gaussian-weighted root-mean-square error for QMC integration: ( ē d,n := e 2 d,n(x 1,..., x N )ϕ(x 1 )... ϕ(x N )d(x 1,..., x N ) R dn ) 1 2 Christian Irrgeher (JKU Linz) 13

34 Worst case error of integration Considering the Gaussian-weighted root-mean-square error for QMC integration: ( ē d,n := e 2 d,n(x 1,..., x N )ϕ(x 1 )... ϕ(x N )d(x 1,..., x N ) R dn Theorem (I. & Leobacher) The Gaussian-weighted root-mean-square error for QMC integration in the Korobov space H α,γ (R d, ϕ) is ē d,n = 1 d (1 + γ j ζ(α)) 1 N j= ) 1 2 Christian Irrgeher (JKU Linz) 13

35 Worst case error of integration and tractability There exists a point set {x 1,..., x N } such that e d,n 1 ( ζ(α) exp N 2 d ) γ j j=1 Christian Irrgeher (JKU Linz) 14

36 Worst case error of integration and tractability There exists a point set {x 1,..., x N } such that e d,n 1 ( ζ(α) exp N 2 Strong tractability, if lim sup d dj=1 γ j <. d ) γ j j=1 Christian Irrgeher (JKU Linz) 14

37 Worst case error of integration and tractability There exists a point set {x 1,..., x N } such that e d,n 1 ( ζ(α) exp N 2 Strong tractability, if lim sup d dj=1 γ j <. d ) γ j j=1 Polynomial tractability, if lim sup d d j=1 γ j ln(d) <. Christian Irrgeher (JKU Linz) 14

38 Worst case error of integration and tractability There exists a point set {x 1,..., x N } such that e d,n 1 ( ζ(α) exp N 2 Strong tractability, if lim sup d dj=1 γ j <. d ) γ j j=1 Polynomial tractability, if lim sup d d j=1 γ j ln(d) <. err c 1 d p + f d α,γ c 2 N 1/2 d q f d α,γ can grow in d Christian Irrgeher (JKU Linz) 14

39 Orthogonal transforms For any orthogonal transform U on R d : f d (x)ϕ(x)dx = f d (Ux)ϕ(x)dx R d R d Christian Irrgeher (JKU Linz) 15

40 Orthogonal transforms For any orthogonal transform U on R d : f d (x)ϕ(x)dx = f d (Ux)ϕ(x)dx R d R d Every orthogonal transform corresponds to an Brownian path construction (Papageorgiou 2002) Christian Irrgeher (JKU Linz) 15

41 Orthogonal transforms For any orthogonal transform U on R d : f d (x)ϕ(x)dx = f d (Ux)ϕ(x)dx R d R d Every orthogonal transform corresponds to an Brownian path construction (Papageorgiou 2002) Classical construction methods Forward construction Brownian bridge construction PCA construction Christian Irrgeher (JKU Linz) 15

42 Orthogonal transforms For any orthogonal transform U on R d : f d (x)ϕ(x)dx = f d (Ux)ϕ(x)dx R d R d Every orthogonal transform corresponds to an Brownian path construction (Papageorgiou 2002) Classical construction methods Forward construction Brownian bridge construction PCA construction Equivalence principle (Wang & Sloan 2011) Roughly spoken: every construction that is good for one function is bad for another Christian Irrgeher (JKU Linz) 15

43 Orthogonal transforms Bound of the integration error: err QMC f d U α,γ e d,n Christian Irrgeher (JKU Linz) 16

44 Orthogonal transforms Bound of the integration error: err QMC f d U α,γ e d,n In general, f d α,γ f d U α,γ Christian Irrgeher (JKU Linz) 16

45 Orthogonal transforms Bound of the integration error: err QMC f d U α,γ e d,n In general, f d α,γ f d U α,γ Goal: Find U such that f d U α,γ grows slower in d than f d α,γ or is even bounded. LT-method (Imai & Tan 2007) Regression algorithm (I. & Leobacher 2012) Christian Irrgeher (JKU Linz) 16

46 Example Compute E(exp(B 1 )) Simulation of B on time grid 1 d, 2 d,..., d d using forward method Christian Irrgeher (JKU Linz) 17

47 Example Compute E(exp(B 1 )) Simulation of B on time grid 1 d, 2 d,..., d d using forward method Discrete problem f d (x) = exp( 1 d dj=1 x j ) Christian Irrgeher (JKU Linz) 17

48 Example Compute E(exp(B 1 )) Simulation of B on time grid 1 d, 2 d,..., d d using forward method Discrete problem f d (x) = exp( 1 d dj=1 x j ) Hermite coefficients of f d : f d (k) = e d k /2 k! Christian Irrgeher (JKU Linz) 17

49 Example Compute E(exp(B 1 )) Simulation of B on time grid 1 d, 2 d,..., d d using forward method Discrete problem f d (x) = exp( 1 d dj=1 x j ) Hermite coefficients of f d : f d (k) = e d k /2 k! f d 2 α,γ = k N d 0 r(α, γ, k) 1 f d (k) 2 exp(1 + 1 d dj=1 γ 1 j ) Christian Irrgeher (JKU Linz) 17

50 Example Compute E(exp(B 1 )) Simulation of B on time grid 1 d, 2 d,..., d d using forward method Discrete problem f d (x) = exp( 1 d dj=1 x j ) Hermite coefficients of f d : f d (k) = e d k /2 k! f d 2 α,γ = k N d 0 r(α, γ, k) 1 f d (k) 2 exp(1 + 1 d dj=1 γ 1 j ) If γ j = j 2, ed,n is bounded by cn 1/2 with constant c > 0, But fd α,γ = O(e d ) Christian Irrgeher (JKU Linz) 17

51 Example Compute E(exp(B 1 )) Simulation of B on time grid 1 d, 2 d,..., d d construction using Brownian bridge Christian Irrgeher (JKU Linz) 18

52 Example Compute E(exp(B 1 )) Simulation of B on time grid 1 d, 2 d,..., d d construction Discrete problem (f d U)(x) = exp(x 1 ) using Brownian bridge Christian Irrgeher (JKU Linz) 18

53 Example Compute E(exp(B 1 )) Simulation of B on time grid 1 d, 2 d,..., d d using Brownian bridge construction Discrete problem (f d U)(x) = exp(x 1 ) Hermite coefficients of f d U: e 1 f d U(k) = k1 if k! 2 =... = k d = 0 0 else Christian Irrgeher (JKU Linz) 18

54 Example Compute E(exp(B 1 )) Simulation of B on time grid 1 d, 2 d,..., d d using Brownian bridge construction Discrete problem (f d U)(x) = exp(x 1 ) Hermite coefficients of f d U: e 1 f d U(k) = k1 if k! 2 =... = k d = 0 0 else Norm is independent of d f d U 2 α,γ = k N d 0 r(α, γ, k) f d U(k) 2 = e + = e + γ 1 1 e2 c(α) k=1 γ 1 1 kα 1 e k 1! Christian Irrgeher (JKU Linz) 18

55 Hermite coefficients and orthogonal transforms Define: AU : L 2 (R d, ϕ) L 2 (R d, ϕ) by A U f = f U Hm := span{h k (x) : k = m} AU,m := A Hm U Christian Irrgeher (JKU Linz) 19

56 Hermite coefficients and orthogonal transforms Define: AU : L 2 (R d, ϕ) L 2 (R d, ϕ) by A U f = f U Hm := span{h k (x) : k = m} AU,m := A Hm U Then: AU is a Hilbert space automorphism of L 2 (R d, ϕ) AU,m is a Hilbert space automorphism of H m L 2 (R d, ϕ) = m 0 H m AU = m 0 A U,m Christian Irrgeher (JKU Linz) 19

57 Hermite coefficients and orthogonal transforms in H m H k (x) = k G(x, t) t k with exponential generating function G t=0 Christian Irrgeher (JKU Linz) 20

58 Hermite coefficients and orthogonal transforms in H m H k (x) = k G(x, t) t k with exponential generating function G t=0 For any (β 1,..., β m ) {1,..., d} m : t βm = G(Ux, t) = t β1 t=0 d ξ 1,...,ξ m=1 ( ) U βmξ m U β1 ξ 1 G(x, t) t ξm t ξ1 t=0 Christian Irrgeher (JKU Linz) 20

59 Hermite coefficients and orthogonal transforms in H m H k (x) = k G(x, t) t k with exponential generating function G t=0 For any (β 1,..., β m ) {1,..., d} m : t βm = G(Ux, t) = t β1 t=0 d ξ 1,...,ξ m=1 ( ) U βmξ m U β1 ξ 1 G(x, t) t ξm t ξ1 t=0 Many (β 1,..., β m ) correspond to the same multi-index k Christian Irrgeher (JKU Linz) 20

60 Hermite coefficients and orthogonal transforms in H m Space K m := l 2 ({1,..., d} m ) takes account of the order of differentiation Christian Irrgeher (JKU Linz) 21

61 Hermite coefficients and orthogonal transforms in H m Space K m := l 2 ({1,..., d} m ) takes account of the order of differentiation Isometries: Jm : H m K m J m : K m H m Christian Irrgeher (JKU Linz) 21

62 Hermite coefficients and orthogonal transforms in H m Space K m := l 2 ({1,..., d} m ) takes account of the order of differentiation Isometries: Jm : H m K m J m : K m H m H m J m A U,m H m J m K m U m K m Christian Irrgeher (JKU Linz) 21

63 Hermite coefficients and orthogonal transforms in L 2 L 2 (R d, ϕ) J A U L 2 (R d, ϕ) J K K m 0 U m with K = K m, m 0 J = J m, J = Jm. m 0 m 0 Christian Irrgeher (JKU Linz) 22

64 Hermite coefficients and orthogonal transforms in L 2 L 2 (R d, ϕ) J A U L 2 (R d, ϕ) J K K m 0 U m with K = K m, m 0 J = J m, J = Jm. m 0 m 0 Thus A = J ( m 0 U m) J Christian Irrgeher (JKU Linz) 22

65 Remarks and open problems Is A U well defined on the Korobov space? Other weight structures (choice of weights) Sobolev space setting (RKHS, tractability) Concrete point sets (worst case error analysis, tractability) Christian Irrgeher (JKU Linz) 23

66 Thank you for your attention Christian Irrgeher (JKU Linz) 24

QMC methods in quantitative finance. and perspectives

QMC methods in quantitative finance. and perspectives , tradition and perspectives Johannes Kepler University Linz (JKU) WU Research Seminar What is the content of the talk Valuation of financial derivatives in stochastic market models using (QMC-)simulation

More information

Fast evaluation of mixed derivatives and calculation of optimal weights for integration. Hernan Leovey

Fast evaluation of mixed derivatives and calculation of optimal weights for integration. Hernan Leovey Fast evaluation of mixed derivatives and calculation of optimal weights for integration Humboldt Universität zu Berlin 02.14.2012 MCQMC2012 Tenth International Conference on Monte Carlo and Quasi Monte

More information

Quasi-Monte Carlo Methods for Applications in Statistics

Quasi-Monte Carlo Methods for Applications in Statistics Quasi-Monte Carlo Methods for Applications in Statistics Weights for QMC in Statistics Vasile Sinescu (UNSW) Weights for QMC in Statistics MCQMC February 2012 1 / 24 Quasi-Monte Carlo Methods for Applications

More information

Discretization of SDEs: Euler Methods and Beyond

Discretization of SDEs: Euler Methods and Beyond Discretization of SDEs: Euler Methods and Beyond 09-26-2006 / PRisMa 2006 Workshop Outline Introduction 1 Introduction Motivation Stochastic Differential Equations 2 The Time Discretization of SDEs Monte-Carlo

More information

APPLIED MATHEMATICS REPORT AMR04/16 FINITE-ORDER WEIGHTS IMPLY TRACTABILITY OF MULTIVARIATE INTEGRATION. I.H. Sloan, X. Wang and H.

APPLIED MATHEMATICS REPORT AMR04/16 FINITE-ORDER WEIGHTS IMPLY TRACTABILITY OF MULTIVARIATE INTEGRATION. I.H. Sloan, X. Wang and H. APPLIED MATHEMATICS REPORT AMR04/16 FINITE-ORDER WEIGHTS IMPLY TRACTABILITY OF MULTIVARIATE INTEGRATION I.H. Sloan, X. Wang and H. Wozniakowski Published in Journal of Complexity, Volume 20, Number 1,

More information

Lattice rules and sequences for non periodic smooth integrands

Lattice rules and sequences for non periodic smooth integrands Lattice rules and sequences for non periodic smooth integrands dirk.nuyens@cs.kuleuven.be Department of Computer Science KU Leuven, Belgium Joint work with Josef Dick (UNSW) and Friedrich Pillichshammer

More information

Digital lattice rules

Digital lattice rules Digital lattice rules Multivariate integration and discrepancy estimates A thesis presented to The University of New South Wales in fulfilment of the thesis requirement for the degree of Doctor of Philosophy

More information

Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed?

Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed? Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed? Xiaoqun Wang 1,2 and Ian H. Sloan 2 1 Department of Mathematical Sciences, Tsinghua University, Beijing 100084,

More information

Tutorial on quasi-monte Carlo methods

Tutorial on quasi-monte Carlo methods Tutorial on quasi-monte Carlo methods Josef Dick School of Mathematics and Statistics, UNSW, Sydney, Australia josef.dick@unsw.edu.au Comparison: MCMC, MC, QMC Roughly speaking: Markov chain Monte Carlo

More information

Kernel-based Approximation. Methods using MATLAB. Gregory Fasshauer. Interdisciplinary Mathematical Sciences. Michael McCourt.

Kernel-based Approximation. Methods using MATLAB. Gregory Fasshauer. Interdisciplinary Mathematical Sciences. Michael McCourt. SINGAPORE SHANGHAI Vol TAIPEI - Interdisciplinary Mathematical Sciences 19 Kernel-based Approximation Methods using MATLAB Gregory Fasshauer Illinois Institute of Technology, USA Michael McCourt University

More information

Tractability of Multivariate Problems

Tractability of Multivariate Problems Erich Novak University of Jena Chemnitz, Summer School 2010 1 Plan for the talk Example: approximation of C -functions What is tractability? Tractability by smoothness? Tractability by sparsity, finite

More information

Quasi-Monte Carlo integration over the Euclidean space and applications

Quasi-Monte Carlo integration over the Euclidean space and applications Quasi-Monte Carlo integration over the Euclidean space and applications f.kuo@unsw.edu.au University of New South Wales, Sydney, Australia joint work with James Nichols (UNSW) Journal of Complexity 30

More information

New Multilevel Algorithms Based on Quasi-Monte Carlo Point Sets

New Multilevel Algorithms Based on Quasi-Monte Carlo Point Sets New Multilevel Based on Quasi-Monte Carlo Point Sets Michael Gnewuch Institut für Informatik Christian-Albrechts-Universität Kiel 1 February 13, 2012 Based on Joint Work with Jan Baldeaux (UTS Sydney)

More information

Sobolevology. 1. Definitions and Notation. When α = 1 this seminorm is the same as the Lipschitz constant of the function f. 2.

Sobolevology. 1. Definitions and Notation. When α = 1 this seminorm is the same as the Lipschitz constant of the function f. 2. Sobolevology 1. Definitions and Notation 1.1. The domain. is an open subset of R n. 1.2. Hölder seminorm. For α (, 1] the Hölder seminorm of exponent α of a function is given by f(x) f(y) [f] α = sup x

More information

Let R be the line parameterized by x. Let f be a complex function on R that is integrable. The Fourier transform ˆf = F f is. e ikx f(x) dx. (1.

Let R be the line parameterized by x. Let f be a complex function on R that is integrable. The Fourier transform ˆf = F f is. e ikx f(x) dx. (1. Chapter 1 Fourier transforms 1.1 Introduction Let R be the line parameterized by x. Let f be a complex function on R that is integrable. The Fourier transform ˆf = F f is ˆf(k) = e ikx f(x) dx. (1.1) It

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

Kernel Method: Data Analysis with Positive Definite Kernels

Kernel Method: Data Analysis with Positive Definite Kernels Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University

More information

Ian Sloan and Lattice Rules

Ian Sloan and Lattice Rules www.oeaw.ac.at Ian Sloan and Lattice Rules P. Kritzer, H. Niederreiter, F. Pillichshammer RICAM-Report 2016-34 www.ricam.oeaw.ac.at Ian Sloan and Lattice Rules Peter Kritzer, Harald Niederreiter, Friedrich

More information

Quadrature using sparse grids on products of spheres

Quadrature using sparse grids on products of spheres Quadrature using sparse grids on products of spheres Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at ANZIAM NSW/ACT Annual Meeting, Batemans Bay. Joint

More information

STRONG TRACTABILITY OF MULTIVARIATE INTEGRATION USING QUASI MONTE CARLO ALGORITHMS

STRONG TRACTABILITY OF MULTIVARIATE INTEGRATION USING QUASI MONTE CARLO ALGORITHMS MATHEMATICS OF COMPUTATION Volume 72, Number 242, Pages 823 838 S 0025-5718(02)01440-0 Article electronically published on June 25, 2002 STRONG TRACTABILITY OF MULTIVARIATE INTEGRATION USING QUASI MONTE

More information

Reproducing Kernel Hilbert Spaces

Reproducing Kernel Hilbert Spaces Reproducing Kernel Hilbert Spaces Lorenzo Rosasco 9.520 Class 03 February 9, 2011 About this class Goal To introduce a particularly useful family of hypothesis spaces called Reproducing Kernel Hilbert

More information

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product

Finite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )

More information

Exponential Convergence and Tractability of Multivariate Integration for Korobov Spaces

Exponential Convergence and Tractability of Multivariate Integration for Korobov Spaces Exponential Convergence and Tractability of Multivariate Integration for Korobov Spaces Josef Dick, Gerhard Larcher, Friedrich Pillichshammer and Henryk Woźniakowski March 12, 2010 Abstract In this paper

More information

Pseudorandom Sequences II: Exponential Sums and Uniform Distribution

Pseudorandom Sequences II: Exponential Sums and Uniform Distribution Pseudorandom Sequences II: Exponential Sums and Uniform Distribution Arne Winterhof Austrian Academy of Sciences Johann Radon Institute for Computational and Applied Mathematics Linz Carleton University

More information

APPLIED MATHEMATICS REPORT AMR04/2 DIAPHONY, DISCREPANCY, SPECTRAL TEST AND WORST-CASE ERROR. J. Dick and F. Pillichshammer

APPLIED MATHEMATICS REPORT AMR04/2 DIAPHONY, DISCREPANCY, SPECTRAL TEST AND WORST-CASE ERROR. J. Dick and F. Pillichshammer APPLIED MATHEMATICS REPORT AMR4/2 DIAPHONY, DISCREPANCY, SPECTRAL TEST AND WORST-CASE ERROR J. Dick and F. Pillichshammer January, 24 Diaphony, discrepancy, spectral test and worst-case error Josef Dick

More information

On lower bounds for integration of multivariate permutation-invariant functions

On lower bounds for integration of multivariate permutation-invariant functions On lower bounds for of multivariate permutation-invariant functions Markus Weimar Philipps-University Marburg Oberwolfach October 2013 Research supported by Deutsche Forschungsgemeinschaft DFG (DA 360/19-1)

More information

Part III. Quasi Monte Carlo methods 146/349

Part III. Quasi Monte Carlo methods 146/349 Part III Quasi Monte Carlo methods 46/349 Outline Quasi Monte Carlo methods 47/349 Quasi Monte Carlo methods Let y = (y,...,y N ) be a vector of independent uniform random variables in Γ = [0,] N, u(y)

More information

96 CHAPTER 4. HILBERT SPACES. Spaces of square integrable functions. Take a Cauchy sequence f n in L 2 so that. f n f m 1 (b a) f n f m 2.

96 CHAPTER 4. HILBERT SPACES. Spaces of square integrable functions. Take a Cauchy sequence f n in L 2 so that. f n f m 1 (b a) f n f m 2. 96 CHAPTER 4. HILBERT SPACES 4.2 Hilbert Spaces Hilbert Space. An inner product space is called a Hilbert space if it is complete as a normed space. Examples. Spaces of sequences The space l 2 of square

More information

Math 5520 Homework 2 Solutions

Math 5520 Homework 2 Solutions Math 552 Homework 2 Solutions March, 26. Consider the function fx) = 2x ) 3 if x, 3x ) 2 if < x 2. Determine for which k there holds f H k, 2). Find D α f for α k. Solution. We show that k = 2. The formulas

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

FAST QMC MATRIX-VECTOR MULTIPLICATION

FAST QMC MATRIX-VECTOR MULTIPLICATION FAST QMC MATRIX-VECTOR MULTIPLICATION JOSEF DICK, FRANCES Y. KUO, QUOC T. LE GIA, CHRISTOPH SCHWAB Abstract. Quasi-Monte Carlo (QMC) rules 1/N N 1 n=0 f(y na) can be used to approximate integrals of the

More information

Quadrature using sparse grids on products of spheres

Quadrature using sparse grids on products of spheres Quadrature using sparse grids on products of spheres Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at 3rd Workshop on High-Dimensional Approximation UNSW,

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

Quantization of stochastic processes with applications on Euler-Maruyama schemes

Quantization of stochastic processes with applications on Euler-Maruyama schemes UPTEC F15 063 Examensarbete 30 hp Oktober 2015 Quantization of stochastic processes with applications on Euler-Maruyama schemes Viktor Edward Abstract Quantization of stochastic processes with applications

More information

arxiv: v2 [math.na] 15 Oct 2015

arxiv: v2 [math.na] 15 Oct 2015 Optimal quasi-monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions Aicke Hinrichs a, Lev Markhasin b, Jens Oettershagen c, Tino Ullrich c arxiv:1501.01800v2

More information

Nested Uncertain Differential Equations and Its Application to Multi-factor Term Structure Model

Nested Uncertain Differential Equations and Its Application to Multi-factor Term Structure Model Nested Uncertain Differential Equations and Its Application to Multi-factor Term Structure Model Xiaowei Chen International Business School, Nankai University, Tianjin 371, China School of Finance, Nankai

More information

Randomized Quasi-Monte Carlo for MCMC

Randomized Quasi-Monte Carlo for MCMC Randomized Quasi-Monte Carlo for MCMC Radu Craiu 1 Christiane Lemieux 2 1 Department of Statistics, Toronto 2 Department of Statistics, Waterloo Third Workshop on Monte Carlo Methods Harvard, May 2007

More information

THE PROBLEMS FOR THE SECOND TEST FOR BRIEF SOLUTIONS

THE PROBLEMS FOR THE SECOND TEST FOR BRIEF SOLUTIONS THE PROBLEMS FOR THE SECOND TEST FOR 18.102 BRIEF SOLUTIONS RICHARD MELROSE Question.1 Show that a subset of a separable Hilbert space is compact if and only if it is closed and bounded and has the property

More information

What s new in high-dimensional integration? designing for applications

What s new in high-dimensional integration? designing for applications What s new in high-dimensional integration? designing for applications Ian H. Sloan i.sloan@unsw.edu.au The University of New South Wales UNSW Australia ANZIAM NSW/ACT, November, 2015 The theme High dimensional

More information

Karhunen-Loève decomposition of Gaussian measures on Banach spaces

Karhunen-Loève decomposition of Gaussian measures on Banach spaces Karhunen-Loève decomposition of Gaussian measures on Banach spaces Jean-Charles Croix jean-charles.croix@emse.fr Génie Mathématique et Industriel (GMI) First workshop on Gaussian processes at Saint-Etienne

More information

Reproducing Kernel Hilbert Spaces

Reproducing Kernel Hilbert Spaces Reproducing Kernel Hilbert Spaces Lorenzo Rosasco 9.520 Class 03 February 11, 2009 About this class Goal To introduce a particularly useful family of hypothesis spaces called Reproducing Kernel Hilbert

More information

Malliavin Calculus: Analysis on Gaussian spaces

Malliavin Calculus: Analysis on Gaussian spaces Malliavin Calculus: Analysis on Gaussian spaces Josef Teichmann ETH Zürich Oxford 2011 Isonormal Gaussian process A Gaussian space is a (complete) probability space together with a Hilbert space of centered

More information

Monte Carlo Solution of Integral Equations

Monte Carlo Solution of Integral Equations 1 Monte Carlo Solution of Integral Equations of the second kind Adam M. Johansen a.m.johansen@warwick.ac.uk www2.warwick.ac.uk/fac/sci/statistics/staff/academic/johansen/talks/ March 7th, 2011 MIRaW Monte

More information

Integration of permutation-invariant. functions

Integration of permutation-invariant. functions permutation-invariant Markus Weimar Philipps-University Marburg Joint work with Dirk Nuyens and Gowri Suryanarayana (KU Leuven, Belgium) MCQMC2014, Leuven April 06-11, 2014 un Outline Permutation-invariant

More information

Numerical Methods in Economics MIT Press, Chapter 9 Notes Quasi-Monte Carlo Methods. Kenneth L. Judd Hoover Institution.

Numerical Methods in Economics MIT Press, Chapter 9 Notes Quasi-Monte Carlo Methods. Kenneth L. Judd Hoover Institution. 1 Numerical Methods in Economics MIT Press, 1998 Chapter 9 Notes Quasi-Monte Carlo Methods Kenneth L. Judd Hoover Institution October 26, 2002 2 Quasi-Monte Carlo Methods Observation: MC uses random sequences

More information

RANDOM FIELDS AND GEOMETRY. Robert Adler and Jonathan Taylor

RANDOM FIELDS AND GEOMETRY. Robert Adler and Jonathan Taylor RANDOM FIELDS AND GEOMETRY from the book of the same name by Robert Adler and Jonathan Taylor IE&M, Technion, Israel, Statistics, Stanford, US. ie.technion.ac.il/adler.phtml www-stat.stanford.edu/ jtaylor

More information

Uncertainty Propagation and Global Sensitivity Analysis in Hybrid Simulation using Polynomial Chaos Expansion

Uncertainty Propagation and Global Sensitivity Analysis in Hybrid Simulation using Polynomial Chaos Expansion Uncertainty Propagation and Global Sensitivity Analysis in Hybrid Simulation using Polynomial Chaos Expansion EU-US-Asia workshop on hybrid testing Ispra, 5-6 October 2015 G. Abbiati, S. Marelli, O.S.

More information

Introduction to numerical schemes

Introduction to numerical schemes 236861 Numerical Geometry of Images Tutorial 2 Introduction to numerical schemes Heat equation The simple parabolic PDE with the initial values u t = K 2 u 2 x u(0, x) = u 0 (x) and some boundary conditions

More information

Hot new directions for QMC research in step with applications

Hot new directions for QMC research in step with applications Hot new directions for QMC research in step with applications Frances Kuo f.kuo@unsw.edu.au University of New South Wales, Sydney, Australia Frances Kuo @ UNSW Australia p.1 Outline Motivating example

More information

Differentiation and Integration

Differentiation and Integration Differentiation and Integration (Lectures on Numerical Analysis for Economists II) Jesús Fernández-Villaverde 1 and Pablo Guerrón 2 February 12, 2018 1 University of Pennsylvania 2 Boston College Motivation

More information

RegML 2018 Class 2 Tikhonov regularization and kernels

RegML 2018 Class 2 Tikhonov regularization and kernels RegML 2018 Class 2 Tikhonov regularization and kernels Lorenzo Rosasco UNIGE-MIT-IIT June 17, 2018 Learning problem Problem For H {f f : X Y }, solve min E(f), f H dρ(x, y)l(f(x), y) given S n = (x i,

More information

Bayes spaces: use of improper priors and distances between densities

Bayes spaces: use of improper priors and distances between densities Bayes spaces: use of improper priors and distances between densities J. J. Egozcue 1, V. Pawlowsky-Glahn 2, R. Tolosana-Delgado 1, M. I. Ortego 1 and G. van den Boogaart 3 1 Universidad Politécnica de

More information

Bernoulli polynomials

Bernoulli polynomials Bernoulli polynomials Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto February 2, 26 Bernoulli polynomials For k, the Bernoulli polynomial B k (x) is defined by ze xz

More information

Fall TMA4145 Linear Methods. Solutions to exercise set 9. 1 Let X be a Hilbert space and T a bounded linear operator on X.

Fall TMA4145 Linear Methods. Solutions to exercise set 9. 1 Let X be a Hilbert space and T a bounded linear operator on X. TMA445 Linear Methods Fall 26 Norwegian University of Science and Technology Department of Mathematical Sciences Solutions to exercise set 9 Let X be a Hilbert space and T a bounded linear operator on

More information

Progress in high-dimensional numerical integration and its application to stochastic optimization

Progress in high-dimensional numerical integration and its application to stochastic optimization Progress in high-dimensional numerical integration and its application to stochastic optimization W. Römisch Humboldt-University Berlin Department of Mathematics www.math.hu-berlin.de/~romisch Short course,

More information

Reproducing Kernel Hilbert Spaces

Reproducing Kernel Hilbert Spaces Reproducing Kernel Hilbert Spaces Lorenzo Rosasco 9.520 Class 03 February 12, 2007 About this class Goal To introduce a particularly useful family of hypothesis spaces called Reproducing Kernel Hilbert

More information

Direct Learning: Linear Classification. Donglin Zeng, Department of Biostatistics, University of North Carolina

Direct Learning: Linear Classification. Donglin Zeng, Department of Biostatistics, University of North Carolina Direct Learning: Linear Classification Logistic regression models for classification problem We consider two class problem: Y {0, 1}. The Bayes rule for the classification is I(P(Y = 1 X = x) > 1/2) so

More information

Econ 2148, fall 2017 Gaussian process priors, reproducing kernel Hilbert spaces, and Splines

Econ 2148, fall 2017 Gaussian process priors, reproducing kernel Hilbert spaces, and Splines Econ 2148, fall 2017 Gaussian process priors, reproducing kernel Hilbert spaces, and Splines Maximilian Kasy Department of Economics, Harvard University 1 / 37 Agenda 6 equivalent representations of the

More information

MIT 9.520/6.860, Fall 2018 Statistical Learning Theory and Applications. Class 04: Features and Kernels. Lorenzo Rosasco

MIT 9.520/6.860, Fall 2018 Statistical Learning Theory and Applications. Class 04: Features and Kernels. Lorenzo Rosasco MIT 9.520/6.860, Fall 2018 Statistical Learning Theory and Applications Class 04: Features and Kernels Lorenzo Rosasco Linear functions Let H lin be the space of linear functions f(x) = w x. f w is one

More information

Approximation numbers of Sobolev embeddings - Sharp constants and tractability

Approximation numbers of Sobolev embeddings - Sharp constants and tractability Approximation numbers of Sobolev embeddings - Sharp constants and tractability Thomas Kühn Universität Leipzig, Germany Workshop Uniform Distribution Theory and Applications Oberwolfach, 29 September -

More information

QMC designs and covering of spheres by spherical caps

QMC designs and covering of spheres by spherical caps QMC designs and covering of spheres by spherical caps Ian H. Sloan University of New South Wales, Sydney, Australia Joint work with Johann Brauchart, Josef Dick, Ed Saff (Vanderbilt), Rob Womersley and

More information

Dual Spaces. René van Hassel

Dual Spaces. René van Hassel Dual Spaces René van Hassel October 1, 2006 2 1 Spaces A little scheme of the relation between spaces in the Functional Analysis. FA spaces Vector space Topological Space Topological Metric Space Vector

More information

Infinite-Dimensional Integration on Weighted Hilbert Spaces

Infinite-Dimensional Integration on Weighted Hilbert Spaces Infinite-Dimensional Integration on Weighted Hilbert Spaces Michael Gnewuch Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, New Yor, NY 10027, USA Abstract We study the numerical

More information

MATH 590: Meshfree Methods

MATH 590: Meshfree Methods MATH 590: Meshfree Methods Chapter 14: The Power Function and Native Space Error Estimates Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu

More information

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation

More information

Elements of Positive Definite Kernel and Reproducing Kernel Hilbert Space

Elements of Positive Definite Kernel and Reproducing Kernel Hilbert Space Elements of Positive Definite Kernel and Reproducing Kernel Hilbert Space Statistical Inference with Reproducing Kernel Hilbert Space Kenji Fukumizu Institute of Statistical Mathematics, ROIS Department

More information

EECS 598: Statistical Learning Theory, Winter 2014 Topic 11. Kernels

EECS 598: Statistical Learning Theory, Winter 2014 Topic 11. Kernels EECS 598: Statistical Learning Theory, Winter 2014 Topic 11 Kernels Lecturer: Clayton Scott Scribe: Jun Guo, Soumik Chatterjee Disclaimer: These notes have not been subjected to the usual scrutiny reserved

More information

Some Aspects of Solutions of Partial Differential Equations

Some Aspects of Solutions of Partial Differential Equations Some Aspects of Solutions of Partial Differential Equations K. Sakthivel Department of Mathematics Indian Institute of Space Science & Technology(IIST) Trivandrum - 695 547, Kerala Sakthivel@iist.ac.in

More information

CIS 520: Machine Learning Oct 09, Kernel Methods

CIS 520: Machine Learning Oct 09, Kernel Methods CIS 520: Machine Learning Oct 09, 207 Kernel Methods Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture They may or may not cover all the material discussed

More information

3. Some tools for the analysis of sequential strategies based on a Gaussian process prior

3. Some tools for the analysis of sequential strategies based on a Gaussian process prior 3. Some tools for the analysis of sequential strategies based on a Gaussian process prior E. Vazquez Computer experiments June 21-22, 2010, Paris 21 / 34 Function approximation with a Gaussian prior Aim:

More information

Lecture 21: Counting and Sampling Problems

Lecture 21: Counting and Sampling Problems princeton univ. F 14 cos 521: Advanced Algorithm Design Lecture 21: Counting and Sampling Problems Lecturer: Sanjeev Arora Scribe: Today s topic of counting and sampling problems is motivated by computational

More information

Quasi-Monte Carlo methods with applications in finance

Quasi-Monte Carlo methods with applications in finance Finance Stoch (2009) 13: 307 349 DOI 10.1007/s00780-009-0095-y Quasi-Monte Carlo methods with applications in finance Pierre L Ecuyer Received: 30 May 2008 / Accepted: 20 August 2008 / Published online:

More information

Numerical Integration of SDEs: A Short Tutorial

Numerical Integration of SDEs: A Short Tutorial Numerical Integration of SDEs: A Short Tutorial Thomas Schaffter January 19, 010 1 Introduction 1.1 Itô and Stratonovich SDEs 1-dimensional stochastic differentiable equation (SDE) is given by [6, 7] dx

More information

arxiv: v3 [math.na] 18 Sep 2016

arxiv: v3 [math.na] 18 Sep 2016 Infinite-dimensional integration and the multivariate decomposition method F. Y. Kuo, D. Nuyens, L. Plaskota, I. H. Sloan, and G. W. Wasilkowski 9 September 2016 arxiv:1501.05445v3 [math.na] 18 Sep 2016

More information

Optimal Randomized Algorithms for Integration on Function Spaces with underlying ANOVA decomposition

Optimal Randomized Algorithms for Integration on Function Spaces with underlying ANOVA decomposition Optimal Randomized on Function Spaces with underlying ANOVA decomposition Michael Gnewuch 1 University of Kaiserslautern, Germany October 16, 2013 Based on Joint Work with Jan Baldeaux (UTS Sydney) & Josef

More information

Inverse Problems D-MATH FS 2013 Prof. R. Hiptmair. Series 1

Inverse Problems D-MATH FS 2013 Prof. R. Hiptmair. Series 1 Inverse Problems D-MATH FS 2013 Prof. R. Hiptmair Series 1 1. Differentiation in L 2 per([0, 1]) In class we investigated the inverse problem related to differentiation of continous periodic functions.

More information

Oslo Class 2 Tikhonov regularization and kernels

Oslo Class 2 Tikhonov regularization and kernels RegML2017@SIMULA Oslo Class 2 Tikhonov regularization and kernels Lorenzo Rosasco UNIGE-MIT-IIT May 3, 2017 Learning problem Problem For H {f f : X Y }, solve min E(f), f H dρ(x, y)l(f(x), y) given S n

More information

ERROR ESTIMATES FOR THE ANOVA METHOD WITH POLYNOMIAL CHAOS INTERPOLATION: TENSOR PRODUCT FUNCTIONS

ERROR ESTIMATES FOR THE ANOVA METHOD WITH POLYNOMIAL CHAOS INTERPOLATION: TENSOR PRODUCT FUNCTIONS ERROR ESTIMATES FOR THE ANOVA METHOD WITH POLYNOMIAL CHAOS INTERPOLATION: TENSOR PRODUCT FUNCTIONS ZHONGQIANG ZHANG, MINSEOK CHOI AND GEORGE EM KARNIADAKIS Abstract. We focus on the analysis of variance

More information

Liberating the Dimension for Function Approximation and Integration

Liberating the Dimension for Function Approximation and Integration Liberating the Dimension for Function Approximation and Integration G W Wasilkowski Abstract We discuss recent results on the complexity and tractability of problems dealing with -variate functions Such

More information

CS 7140: Advanced Machine Learning

CS 7140: Advanced Machine Learning Instructor CS 714: Advanced Machine Learning Lecture 3: Gaussian Processes (17 Jan, 218) Jan-Willem van de Meent (j.vandemeent@northeastern.edu) Scribes Mo Han (han.m@husky.neu.edu) Guillem Reus Muns (reusmuns.g@husky.neu.edu)

More information

Function Spaces. 1 Hilbert Spaces

Function Spaces. 1 Hilbert Spaces Function Spaces A function space is a set of functions F that has some structure. Often a nonparametric regression function or classifier is chosen to lie in some function space, where the assume structure

More information

Improved Discrepancy Bounds for Hybrid Sequences. Harald Niederreiter. RICAM Linz and University of Salzburg

Improved Discrepancy Bounds for Hybrid Sequences. Harald Niederreiter. RICAM Linz and University of Salzburg Improved Discrepancy Bounds for Hybrid Sequences Harald Niederreiter RICAM Linz and University of Salzburg MC vs. QMC methods Hybrid sequences The basic sequences Deterministic discrepancy bounds The proof

More information

Can we do statistical inference in a non-asymptotic way? 1

Can we do statistical inference in a non-asymptotic way? 1 Can we do statistical inference in a non-asymptotic way? 1 Guang Cheng 2 Statistics@Purdue www.science.purdue.edu/bigdata/ ONR Review Meeting@Duke Oct 11, 2017 1 Acknowledge NSF, ONR and Simons Foundation.

More information

HEAT KERNEL ANALYSIS ON INFINITE-DIMENSIONAL GROUPS. Masha Gordina. University of Connecticut.

HEAT KERNEL ANALYSIS ON INFINITE-DIMENSIONAL GROUPS. Masha Gordina. University of Connecticut. HEAT KERNEL ANALYSIS ON INFINITE-DIMENSIONAL GROUPS Masha Gordina University of Connecticut http://www.math.uconn.edu/~gordina 6th Cornell Probability Summer School July 2010 SEGAL-BARGMANN TRANSFORM AND

More information

MATH 590: Meshfree Methods

MATH 590: Meshfree Methods MATH 590: Meshfree Methods Chapter 2 Part 3: Native Space for Positive Definite Kernels Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2014 fasshauer@iit.edu MATH

More information

Lecture on Parameter Estimation for Stochastic Differential Equations. Erik Lindström

Lecture on Parameter Estimation for Stochastic Differential Equations. Erik Lindström Lecture on Parameter Estimation for Stochastic Differential Equations Erik Lindström Recap We are interested in the parameters θ in the Stochastic Integral Equations X(t) = X(0) + t 0 µ θ (s, X(s))ds +

More information

Reproducing Kernels of Generalized Sobolev Spaces via a Green Function Approach with Distributional Operators

Reproducing Kernels of Generalized Sobolev Spaces via a Green Function Approach with Distributional Operators Noname manuscript No. (will be inserted by the editor) Reproducing Kernels of Generalized Sobolev Spaces via a Green Function Approach with Distributional Operators Gregory E. Fasshauer Qi Ye Abstract

More information

Analysis II: Basic knowledge of real analysis: Part V, Power Series, Differentiation, and Taylor Series

Analysis II: Basic knowledge of real analysis: Part V, Power Series, Differentiation, and Taylor Series .... Analysis II: Basic knowledge of real analysis: Part V, Power Series, Differentiation, and Taylor Series Kenichi Maruno Department of Mathematics, The University of Texas - Pan American March 4, 20

More information

Sobolev spaces, Trace theorems and Green s functions.

Sobolev spaces, Trace theorems and Green s functions. Sobolev spaces, Trace theorems and Green s functions. Boundary Element Methods for Waves Scattering Numerical Analysis Seminar. Orane Jecker October 21, 2010 Plan Introduction 1 Useful definitions 2 Distributions

More information

Numerical Approximation of Stochastic Elliptic Partial Differential Equations

Numerical Approximation of Stochastic Elliptic Partial Differential Equations Numerical Approximation of Stochastic Elliptic Partial Differential Equations Hermann G. Matthies, Andreas Keese Institut für Wissenschaftliches Rechnen Technische Universität Braunschweig wire@tu-bs.de

More information

High dimensional integration of kinks and jumps smoothing by preintegration. Andreas Griewank, Frances Y. Kuo, Hernan Leövey and Ian H.

High dimensional integration of kinks and jumps smoothing by preintegration. Andreas Griewank, Frances Y. Kuo, Hernan Leövey and Ian H. High dimensional integration of kinks and jumps smoothing by preintegration Andreas Griewank, Frances Y. Kuo, Hernan Leövey and Ian H. Sloan August 2017 arxiv:1712.00920v1 [math.na] 4 Dec 2017 Abstract

More information

Hands-on Generating Random

Hands-on Generating Random CVIP Laboratory Hands-on Generating Random Variables Shireen Elhabian Aly Farag October 2007 The heart of Monte Carlo simulation for statistical inference. Generate synthetic data to test our algorithms,

More information

Introduction to Smoothing spline ANOVA models (metamodelling)

Introduction to Smoothing spline ANOVA models (metamodelling) Introduction to Smoothing spline ANOVA models (metamodelling) M. Ratto DYNARE Summer School, Paris, June 215. Joint Research Centre www.jrc.ec.europa.eu Serving society Stimulating innovation Supporting

More information

Introduction to multiscale modeling and simulation. Explicit methods for ODEs : forward Euler. y n+1 = y n + tf(y n ) dy dt = f(y), y(0) = y 0

Introduction to multiscale modeling and simulation. Explicit methods for ODEs : forward Euler. y n+1 = y n + tf(y n ) dy dt = f(y), y(0) = y 0 Introduction to multiscale modeling and simulation Lecture 5 Numerical methods for ODEs, SDEs and PDEs The need for multiscale methods Two generic frameworks for multiscale computation Explicit methods

More information

Math 118, Handout 4: Hermite functions and the Fourier transform. n! where D = d/dx, are a basis of eigenfunctions for the Fourier transform

Math 118, Handout 4: Hermite functions and the Fourier transform. n! where D = d/dx, are a basis of eigenfunctions for the Fourier transform The Hermite functions defined by h n (x) = ( )n e x2 /2 D n e x2 where D = d/dx, are a basis of eigenfunctions for the Fourier transform f(k) = f(x)e ikx dx on L 2 (R). Since h 0 (x) = e x2 /2 h (x) =

More information

Monte-Carlo MMD-MA, Université Paris-Dauphine. Xiaolu Tan

Monte-Carlo MMD-MA, Université Paris-Dauphine. Xiaolu Tan Monte-Carlo MMD-MA, Université Paris-Dauphine Xiaolu Tan tan@ceremade.dauphine.fr Septembre 2015 Contents 1 Introduction 1 1.1 The principle.................................. 1 1.2 The error analysis

More information

Mixtures of Truncated Basis Functions

Mixtures of Truncated Basis Functions Mixtures of Truncated Basis Functions Helge Langseth, Thomas D. Nielsen, Rafael Rumí, and Antonio Salmerón This work is supported by an Abel grant from Iceland, Liechtenstein, and Norway through the EEA

More information

TOOLS FROM HARMONIC ANALYSIS

TOOLS FROM HARMONIC ANALYSIS TOOLS FROM HARMONIC ANALYSIS BRADLY STADIE Abstract. The Fourier transform can be thought of as a map that decomposes a function into oscillatory functions. In this paper, we will apply this decomposition

More information

Your first day at work MATH 806 (Fall 2015)

Your first day at work MATH 806 (Fall 2015) Your first day at work MATH 806 (Fall 2015) 1. Let X be a set (with no particular algebraic structure). A function d : X X R is called a metric on X (and then X is called a metric space) when d satisfies

More information

MULTIDIMENSIONAL WICK-ITÔ FORMULA FOR GAUSSIAN PROCESSES

MULTIDIMENSIONAL WICK-ITÔ FORMULA FOR GAUSSIAN PROCESSES MULTIDIMENSIONAL WICK-ITÔ FORMULA FOR GAUSSIAN PROCESSES D. NUALART Department of Mathematics, University of Kansas Lawrence, KS 6645, USA E-mail: nualart@math.ku.edu S. ORTIZ-LATORRE Departament de Probabilitat,

More information