Course info

Description:

The five subjects to be covered by the course are described below.

1. Jesper Møller: Perfect simulation
2. Morten Nielsen: Sparse representation of data
3. Oliver Wilhelm Gnilke: Applications of error-correcting codes
4. Horia Cornean: Three ODE iteration methods, with rigorous error bounds
5. Rasmus Waagepetersen: Estimating functions and spatial point processes

 1.  Perfect simulation methods extend conventional Markov chain Monte Carlo methods by ensuring that the sample is not only approximately, but exactly from the stationary distribution. We review various such algorithms, including the Propp-Wilson algorithm (for simulation of e.g. the celebrated Ising model),  Fill's algorithm, and dominated coupling from the past.

2. Sparse approximation techniques have been at the core of a rapidly evolving and very active area of research since the 1990s. Their most visible technological success has certainly been in the compression of high-dimensional data with wavelets. However, approximating a signal or an image with a sparse linear expansion from a possibly overcomplete dictionary of basis functions (called atoms) has turned out to be an extremely useful tool to solve many other signal processing problems. In this talk, I will discuss some of the mathematical and computational aspects of sparse representations using redundant dictionaries in a Hilbert space. Our main focus will be on sparse representations using 'coherent' dictionaries in a finite dimensional space, but we will also mention some very recent results on infinite dimensional time-frequency dictionaries that have clusters of coherent atoms.

3. Codes are nowadays used for more than just error correction. We will give a short introduction into the theory of linear block codes, with special focus on generalized Reed-Solomon codes. Then we will present a handful of applications:

-Secret Sharing, are protocols that allows a message to be shared amongst a group of N people such that any subset of K-1 of them learn nothing about the message, but any set of K users can decode the message.

-Private Information Retrieval, are schemes for retrieving data from a database without the database learning which entry was accessed.

-Distributed Computation, are ways of outsourcing calculating a given function on sensitive data, using helper nodes, who cannot learn anything about the data.

We will discuss how the use of error correcting codes enables and enhances each of these applications. A solid knowledge of linear algebra, and a basic understanding of finite fields is encouraged, and we will provide material covering these essentials.

4. First, we review three basic numerical integration rules: trapezoidal, midpoint and Simpson. Second, we use these rules in order to derive three approximation schemes for solving initial value problems for first order ordinary differential equations: Euler's first order, Heun's second order, plus another scheme of order three. Third, we control how the local errors accumulate on a finite interval.

5. The score function given by the derivative of the log likelihood function is just one example of an estimating function. For some statistical models it is hard to compute the score function and the simpler estimating functions may become useful. We will review general theory regarding statistical inference using estimating functions and consider specific examples of estimating functions for spatial point processes.

Prerequisites: Basic knowledge in mathematics and statistics.

Evaluation: The participants are evaluated during each lecture by solving exercises which provide and prove an understanding of the presented theory. In order to pass the course, at least the exercises related to four of the five topics should be satisfactory evaluated.

Organizer: Professor Jesper Møller, jm@math.aau.dk

Lecturers: Professor Horia Cornean, Assistant Professor Oliver Wilhelm Gnilke, Professor Jesper Møller, Professor Morten Nielsen, and Professor Rasmus P. Waagepetersen, all from Department of Mathematical Sciences, AAU.

ECTS: 4.0

Time: Full days (8:15-16:15) on January 27, 30 and February 3, 6, 10, 2020 and half days (12:30-16:15) on January 28,  and February 4, 7, 11. Please note this exception: (08:15-12:00) on January 31.

Place:  Aalborg University

27 January: Fredrik Bajers Vej 7A, room 4-106

28 January: Skjernvej 4, room 2.120

30 January: Skjernvej 4, room 2.115

31 January: Skjernvej 4, room 2.115

All course days in February: Skjernvej 4, room 2.120

Zip code:  9220 Aalborg

City: Aalborg Number of seats: 30

Deadline: January 13, 2020.  

Important information concerning PhD courses:

We have over some time experienced problems with no-show for both project and general courses. It has now reached a point where we are forced to take action. Therefore, the Doctoral School has decided to introduce a no-show fee of DKK 5,000 for each course where the student does not show up. Cancellations are accepted no later than 2 weeks before start of the course. Registered illness is of course an acceptable reason for not showing up on those days. Furthermore, all courses open for registration approximately four months before start. This can hopefully also provide new students a chance to register for courses during the year. We look forward to your registrations.