• Keine Ergebnisse gefunden

Wissenschaftliches Rechnen II/Scientific Computing II

N/A
N/A
Protected

Academic year: 2021

Aktie "Wissenschaftliches Rechnen II/Scientific Computing II"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Wissenschaftliches Rechnen II/Scientific Computing II

Sommersemester 2016 Prof. Dr. Jochen Garcke Dipl.-Math. Sebastian Mayer

Exercise sheet 5 To be handed in on Thursday, 26.05.2016

1 Group exercises

G 1. (Regularization)

Let M be a compact, convex metric space and let R, ρ : M → [0, ∞) be two strictly convex continuous maps. Let λ > 0.

a) Let us write R λ (f ) = R(f) + λρ(f ). Show that

f min ∈M R λ (f ) (Opt)

has a unique minimizer.

b) Show that there is a constant C λ > 0 such that solving (Opt) is equivalent to solving

f∈M min R(f) s.t ρ(f) ≤ C λ .

c) Show that likewise to b) there is a constant ˜ C λ > 0 such that solving (Opt) is equivalent to solving

f∈M min ρ(f) s.t R(f) ≤ C ˜ λ .

d) Use the insights you gained through a)-c) to explain why regularization typically has a smoothing effect on the solution of the empirical risk minimization problem introduced in the lecture.

G 2. (Green’s function and kernels)

Consider on the interval Ω = [0, 1] the ordinary differential equation

− d 2

dx 2 u(x) = g(x), x ∈ Ω.

a) Determine the Green’s function for the ODE without boundary conditions.

b) Determine the Green’s function for the ODE with boundary condition u(0) = 0.

The kernels for which spaces have you just recovered?

G 3. Consider on the interval Ω = [0, 1] for m ∈ N the ordinary differential equation d m

dx m u(x) = g(x), x ∈ Ω.

with boundary condition u k (0) = 0 for k = 0, . . . , m − 1. Determine the Green’s function G m (x, y) of the ODE. Show the relation

G 2m (x, y) = Z 1

0

G m (x, z)G m (z, y)dz.

(2)

2 Homework

H 1. (Semiparametric representer theorem)

Suppose that in addition to the assumptions of Theorem 41 in the lecture we are gi- ven a set of M real-valued functions (ψ j ) M j=1 , each mapping from Ω to R, which have the property that the m × M -matrix (ψ j (x i )) i=1,...,N

j=1,...,M

has rank M. Prove the following statement:

Any function ˜ f = f + h, with f ∈ H and h ∈ span{ψ 1 , . . . , ψ M }, which minimizes the regularized risk

R reg,` ( ˜ f ) = 1 N

N

X

i=1

`(x i , y i , f ˜ (x i )) + λs(kf k H ), λ > 0,

admits a representation ˜ f (x) = P N

i=1 α i k(x i , x) + P M

j=1 β j ψ j (x) with α i , β j ∈ R .

Hint: start with a decomposition of ˜ f into a parametric part, a kernel part, and an orthogonal contribution and evaluate the loss and regularization terms independently.

(4 Punkte) H 2. (Sobolev space)

Let φ k (x) = x k−1 /(k − 1)! for k ∈ N. Show that the Sobolev space W m ([0, 1]) :=

n

f : f, f 0 , . . . , f m−1 absolutely continuous , f (m) ∈ L 2 ([0, 1]) o

endowed with the inner product hf, gi W

m

:=

m−1

X

k=0

[ d k

dx k f](0)[ d k

dx k g](0) + Z 1

0

f (m) (x)g (m) (x)dx

has the reproducing kernel R(x, y) = P m

k=1 φ k (x)φ k (y) + R 1

0 G m (y, z)G m (x, z)dz, where G m is the Green’s function computed in G3.

Hint: start with the Taylor expansion f (x) =

m−1

X

k=0

x k

k! f (k) (0) + Z 1

0

(x − u) m−1 +

(m − 1)! f (m) (u)du

and write the Sobolev space as a sum of two orthogonal spaces, for which you determine the kernels first.

(6 Punkte) H 3. (Green’s function)

Consider on the interval Ω = [0, 1] the ordinary differential equation

− d 2

dx 2 u(x) = g(x), x ∈ Ω.

with boundary conditions u(0) = u(1) = 0. Determine the Green’s function G(x, y). You can assume to know the following about the Green’s function G(x, y):

• G is continuous along the diagonal x = y,

• for any fixed y ∈ (0, 1), G 0 (·, y) has a jump discontinuity at x = y of the form

x→y lim

G 0 (x, y) = 1 + lim

x→y

+

G 0 (x, y).

(4 Punkte) H 4. (Regularized least-squares regression)

This is a programming exercise. As usual, you find the tasks in the accompanying note- book on the lecture’s website.

(6 Punkte)

2

Referenzen

ÄHNLICHE DOKUMENTE

Summer term 2018 Priv.-Doz..

The goal of this exercise sheet is to resolve singular initial conditions for parabolic equations, using a geometrically refined

Let B e n be the transformed version of the Bernoulli polynomial B n such that the domain is [0, 2π] instead of

Wissenschaftliches Rechnen II/Scientific Computing II.. Sommersemester

a) A greedy algorithm is an algorithm that tries to solve an optimization problem by making a locally optimal choice at each stage. Show that this is indeed true. Hint: Use G2.. c)

Exercise sheet 11 To be handed in on Thursday, 07.06.2016. Application of PCA

Prove the following simplyfied version of Lemma 2.16?. How should the algorithm be modified in

Vergabe von Terminen f¨ ur die m¨ undliche Pr¨ ufung: Termine f¨ ur die m¨ undliche Pr¨ ufung werden in der Vorlesung am Dienstag, 19.07.2016, vergeben. Appointments for oral