Search result: Catalogue data in Spring Semester 2021

Mathematics Master Information
Electives
For the Master's degree in Applied Mathematics the following additional condition (not manifest in myStudies) must be obeyed: At least 15 of the required 28 credits from core courses and electives must be acquired in areas of applied mathematics and further application-oriented fields.
Electives: Pure Mathematics
Selection: Algebra, Number Thy, Topology, Discrete Mathematics, Logic
NumberTitleTypeECTSHoursLecturers
401-4116-12LLectures on Drinfeld Modules Information W6 credits3VR. Pink
AbstractDrinfeld modules: Basic theory, analytic uniformization, moduli spaces, good/bad/semistable reduction, Tate modules, Galois representations, endomorphism rings, etc.
Objective
ContentA central role in the arithmetic of fields of positive characteristic p is played by the Frobenius map x ---> x^p. The theory of Drinfeld modules exploits this map in a systematic fashion. Drinfeld modules of rank 1 can be viewed as analogues of the multiplicative group and are used in the class field theory of global function fields. Drinfeld modules of arbitrary rank possess a rich theory which has many aspects in common with that of elliptic curves, including analytic uniformization, moduli spaces, good/bad/semistable reduction, Tate modules, Galois representations.

A full understanding of Drinfeld modules requires some knowledge in the arithmetic of function fields and, for comparison, the arithmetic of elliptic curves, which cannot all be presented in the framework of this course. Relevant results from these areas will be presented only cursorily when they are needed, but a fair amount of the theory can be developed without them.
LiteratureDrinfeld, V. G.: Elliptic modules (Russian), Mat. Sbornik 94 (1974), 594--627, translated in Math. USSR Sbornik 23 (1974), 561--592.

Deligne, P., Husemöller, D: Survey of Drinfeld modules, Contemp. Math. 67, 1987, 25-91.

Goss, D.: Basic structures in function field arithmetic. Springer-Verlag, 1996.

Drinfeld modules, modular schemes and applications. Proceedings of the workshop held in Alden-Biesen, September 9¿14, 1996. Edited by E.-U. Gekeler, M. van der Put, M. Reversat and J. Van Geel. World Scientific Publishing Co., Inc., River Edge, NJ, 1997.

Thakur, Dinesh S.: Function field arithmetic. World Scientific Publishing Co., Inc., River Edge, NJ, 2004.

Further literature will be indicated during the course
401-3109-65LProbabilistic Number Theory Information W8 credits4GE. Kowalski
AbstractThe course presents some results of probabilistic number theory in a unified manner, including distribution properties of the number of prime divisors of integers, probabilistic properties of the zeta function and statistical distribution of exponential sums.
ObjectiveThe goal of the course is to present some results of probabilistic number theory in a unified manner.
ContentThe main concepts will be presented in parallel with the proof of a few main theorems:
(1) the Erdős-Wintner and Erdős-Kac theorems concerning the distribution of values of arithmetic functions;
(2) the distribution of values of the Riemann zeta function, including Selberg's central limit theorem for the Riemann zeta function on the critical line;
(3) the Chebychev bias for primes in arithmetic progressions;
(4) functional limit theorems for the paths of partial sums of families of exponential sums.
Lecture notesThe lecture notes for the class are available at

Link
Prerequisites / NoticePrerequisites: Complex analysis, measure and integral, and at least the basic language of probability theory (the main concepts, such as convergence in law, will be recalled).
Some knowledge of number theory is useful but the main results will also be summarized.
401-3362-21LSpectral Theory of Eisenstein Series Information W4 credits2VP. D. Nelson
AbstractWe plan to discuss the basic theory of Eisenstein series and the spectral decomposition of the space of automorphic forms, with focus on the groups GL(2) and GL(n).
Objective
Prerequisites / NoticeSome familiarity with basics on Lie groups and functional analysis would be helpful, and some prior exposure to modular forms or homogeneous spaces may provide useful motivation.
401-3058-00LCombinatorics IW4 credits2GN. Hungerbühler
AbstractThe course Combinatorics I and II is an introduction into the field of enumerative combinatorics.
ObjectiveUpon completion of the course, students are able to classify combinatorial problems and to apply adequate techniques to solve them.
ContentContents of the lectures Combinatorics I and II: congruence transformation of the plane, symmetry groups of geometric figures, Euler's function, Cayley graphs, formal power series, permutation groups, cycles, Bunside's lemma, cycle index, Polya's theorems, applications to graph theory and isomers.
Prerequisites / NoticeRecognition of credits as an elective course in the Mathematics Bachelor's or Master's Programmes is only possible if you have not received credits for the course unit 401-3052-00L Combinatorics (which was for the last time taught in the spring semester 2008).
Selection: Geometry
NumberTitleTypeECTSHoursLecturers
401-4118-21LSpectral Theory of Hyperbolic Surfaces Information W4 credits2VC. Burrin
AbstractThe Laplacian plays a prominent role in many parts of mathematics. On a flat surface like the torus, understanding its spectrum is the topic of Fourier analysis, whose 19th century development allowed to solve the heat and wave equations. On the sphere, one studies spherical harmonics. In this course, we will study the spectrum of hyperbolic surfaces and its Maass forms (eigenfunctions).
ObjectiveWe will start from scratch, with an overview of hyperbolic geometry and harmonic analysis on the hyperbolic plane. The objectives are to prove the spectral theorem and Selberg's trace formula, and explore applications in geometry and number theory.
ContentTentative syllabus:
Hyperbolic geometry (the hyperbolic plane and Fuchsian groups)
Construction of arithmetic hyperbolic surfaces
Harmonic analysis on the hyperbolic plane
The spectral theorem
Selberg's trace formula
Applications in geometry (isoperimetric inequalities, geodesic length spectrum)
and number theory (links to the Riemann zeta function and Riemann hypothesis)

Possible further topics (if time permits):
Eisenstein series
Explicit constructions of Maass forms (after Maass)
A special case of the Jacquet-Langlands correspondence (after the exposition of Bergeron, see references)
LiteratureNicolas Bergeron, The Spectrum of Hyperbolic Surfaces, Springer Universitext 2011.
Armand Borel, Automorphic forms on SL(2,R), Cambridge University Press 1997.
Peter Buser, Geometry and spectra of compact Riemann surfaces, Birkhäuser 1992.
Henryk Iwaniec, Spectral methods of automorphic forms. Graduate studies in mathematics, AMS 2002.
Prerequisites / NoticeKnowledge of the material covered in the first two years of bachelor studies is assumed. Prior knowledge of differential geometry, functional analysis, or Riemann surfaces is not required.
401-4206-17LGroups Acting on Trees Information W6 credits3GB. Brück
AbstractAs a main theme, we will see how an action of a group on a tree enables us to break the group into smaller pieces, and thus gain better understanding of its structure.
ObjectiveLearn basics of Bass-Serre theory; get to know concepts from geometric group theory.
ContentAs a mathematical object, a tree is a graph without any loops. It turns out that if a group acts on such an object, the algebraic structure of the group has a nice description in terms of the combinatorics of the graph. In particular, groups acting on trees can be decomposed in a certain way into simpler pieces.These decompositions can be described combinatorially, but are closely related to concepts from topology such as fundamental groups and covering spaces.

This interplay between (elementary) concepts of algebra, combinatorics and geometry/topology is typical for geometric group theory. The course can also serve as an introduction to basic concepts of this field.

Topics that will be covered in the lecture include:
- Trees and their automorphisms
- Different characterisations of free groups
- Amalgamated products and HNN extensions
- Graphs of groups
- Kurosh's theorem on subgroups of free (amalgamated) products
LiteratureJ.-P. Serre, Trees. (Translated from the French by John Stillwell). Springer-Verlag, 1980. ISBN 3-540-10103-9

O. Bogopolski. Introduction to group theory. EMS Textbooks in Mathematics. European Mathematical Society (EMS), Zürich, 2008. x+177 pp. ISBN: 978-3-03719-041-8

C. T. C. Wall. The geometry of abstract groups and their splittings. Revista Matemática Complutense vol. 16(2003), no. 1, pp. 5-101
Prerequisites / NoticeBasic knowledge of group theory; being familiar with fundamental groups (e.g. the Seifert-van-Kampen Theorem) and covering theory is definitely helpful, although not strictly necessary.
In particular, the standard material of the first two years of the Mathematics Bachelor is sufficient.
401-3056-00LFinite Geometries I
Does not take place this semester.
W4 credits2GN. Hungerbühler
AbstractFinite geometries I, II: Finite geometries combine aspects of geometry, discrete mathematics and the algebra of finite fields. In particular, we will construct models of axioms of incidence and investigate closing theorems. Applications include test design in statistics, block design, and the construction of orthogonal Latin squares.
ObjectiveFinite geometries I, II: Students will be able to construct and analyse models of finite geometries. They are familiar with closing theorems of the axioms of incidence and are able to design statistical tests by using the theory of finite geometries. They are able to construct orthogonal Latin squares and know the basic elements of the theory of block design.
ContentFinite geometries I, II: finite fields, rings of polynomials, finite affine planes, axioms of incidence, Euler's thirty-six officers problem, design of statistical tests, orthogonal Latin squares, transformation of finite planes, closing theorems of Desargues and Pappus-Pascal, hierarchy of closing theorems, finite coordinate planes, division rings, finite projective planes, duality principle, finite Moebius planes, error correcting codes, block design
Literature- Max Jeger, Endliche Geometrien, ETH Skript 1988

- Albrecht Beutelspacher: Einführung in die endliche Geometrie I,II. Bibliographisches Institut 1983

- Margaret Lynn Batten: Combinatorics of Finite Geometries. Cambridge University Press

- Dembowski: Finite Geometries.
401-3574-61LIntroduction to Knot Theory Information
Does not take place this semester.
W6 credits3G
AbstractIntroduction to the mathematical theory of knots. We will discuss some elementary topics in knot theory and we will repeatedly centre on how this knowledge can be used in secondary school.
ObjectiveThe aim of this lecture course is to give an introduction to knot theory. In the course we will discuss the definition of a knot and what is meant by equivalence. The focus of the course will be on knot invariants. We will consider various knot invariants amongst which we will also find the so called knot polynomials. In doing so we will again and again show how this knowledge can be transferred down to secondary school.
ContentDefinition of a knot and of equivalent knots.
Definition of a knot invariant and some elementary examples.
Various operations on knots.
Knot polynomials (Jones, ev. Alexander.....)
LiteratureAn extensive bibliography will be handed out in the course.
Prerequisites / NoticePrerequisites are some elementary knowledge of algebra and topology.
Selection: Analysis
NumberTitleTypeECTSHoursLecturers
401-4422-21LAn Introduction to the Calculus of VariationsW4 credits2VA. Figalli
AbstractCalculus of variations is a fundamental tool in mathematical analysis, used to investigate the existence, uniqueness, and properties of minimizers to variational problems.
Classic examples include, for instance, the existence of the shortest curve between two points, the equilibrium shape of an elastic membrane, and so on.
Objective
ContentIn the course, we will study both 1-dimensional and multi-dimensional problems.
Prerequisites / NoticeBasic knowledge of Sobolev spaces is important, so some extra additional readings would be required for those unfamiliar with the topic.
401-3378-19LEntropy in Dynamics Information W8 credits4GM. Einsiedler
AbstractDefinition and basic property of measure theoretic dynamical entropy (elementary and conditionally). Ergodic theorem for entropy. Topological entropy and variational principle. Measures of maximal entropy. Equidistribution of periodic points. Measure rigidity for commuting maps on the circle group.
ObjectiveThe course will lead to a firm understanding of measure theoretic dynamical entropy and its applications within dynamics. We will start with the basic properties of (conditional) entropy, relate it to the question of effective coding techniques, discuss and prove the Shannon-McMillan-Breiman theorem that is also known as the ergodic theorem for entropy. Moreover, we will discuss a topological counter part and relate this topological entropy to the measure theoretic entropy by the variational principle. We will use these methods to classify certain natural homogeneous measures, prove equidistribution of periodic points on compact quotients of hyperbolic surfaces, and establish a measure rigidity theorem for commuting maps on the circle group.
Lecture notesEntropy book under construction, available online under
Link
Prerequisites / NoticeNo prior knowledge of dynamical systems will be assumed but measure theory will be assumed and very important. Doctoral students are welcome to attend the course for 2KP.
Selection: Further Realms
NumberTitleTypeECTSHoursLecturers
401-3502-21LReading Course Restricted registration - show details
To start an individual reading course, contact an authorised supervisor
Link
and register your reading course in myStudies.
W2 credits4ASupervisors
AbstractFor this Reading Course proactive students make an individual agreement with a lecturer to acquire knowledge through independent literature study.
Objective
401-3503-21LReading Course Restricted registration - show details
To start an individual reading course, contact an authorised supervisor
Link
and register your reading course in myStudies.
W3 credits6ASupervisors
AbstractFor this Reading Course proactive students make an individual agreement with a lecturer to acquire knowledge through independent literature study.
Objective
401-3504-21LReading Course Restricted registration - show details
To start an individual reading course, contact an authorised supervisor
Link
and register your reading course in myStudies.
W4 credits9ASupervisors
AbstractFor this Reading Course proactive students make an individual agreement with a lecturer to acquire knowledge through independent literature study.
Objective
Electives: Applied Mathematics and Further Application-Oriented Fields
¬
Selection: Numerical Analysis
NumberTitleTypeECTSHoursLecturers
401-4658-00LComputational Methods for Quantitative Finance: PDE Methods Information Restricted registration - show details W6 credits3V + 1UC. Marcati, A. Stein
AbstractIntroduction to principal methods of option pricing. Emphasis on PDE-based methods. Prerequisite MATLAB and Python programming
and knowledge of numerical mathematics at ETH BSc level.
ObjectiveIntroduce the main methods for efficient numerical valuation of derivative contracts in a
Black Scholes as well as in incomplete markets due Levy processes or due to stochastic volatility
models. Develop implementation of pricing methods in MATLAB and Python.
Finite-Difference/ Finite Element based methods for the solution of the pricing integrodifferential equation.
Content1. Review of option pricing. Wiener and Levy price process models. Deterministic, local and stochastic
volatility models.
2. Finite Difference Methods for option pricing. Relation to bi- and multinomial trees.
European contracts.
3. Finite Difference methods for Asian, American and Barrier type contracts.
4. Finite element methods for European and American style contracts.
5. Pricing under local and stochastic volatility in Black-Scholes Markets.
6. Finite Element Methods for option pricing under Levy processes. Treatment of
integrodifferential operators.
7. Stochastic volatility models for Levy processes.
8. Techniques for multidimensional problems. Baskets in a Black-Scholes setting and
stochastic volatility models in Black Scholes and Levy markets.
9. Introduction to sparse grid option pricing techniques.
Lecture notesThere will be english lecture notes as well as MATLAB or Python software for registered participants in the course.
LiteratureMain reference (course text):
N. Hilber, O. Reichmann, Ch. Schwab and Ch. Winter: Computational Methods for Quantitative Finance, Springer Finance, Springer, 2013.

Supplementary texts:
R. Cont and P. Tankov : Financial Modelling with Jump Processes, Chapman and Hall Publ. 2004.

Y. Achdou and O. Pironneau : Computational Methods for Option Pricing, SIAM Frontiers in Applied Mathematics, SIAM Publishers, Philadelphia 2005.

D. Lamberton and B. Lapeyre : Introduction to stochastic calculus Applied to Finance (second edition), Chapman & Hall/CRC Financial Mathematics Series, Taylor & Francis Publ. Boca Raton, London, New York 2008.

J.-P. Fouque, G. Papanicolaou and K.-R. Sircar : Derivatives in financial markets with stochastic volatility, Cambridge Univeristy Press, Cambridge, 2000.
Prerequisites / NoticeKnowledge of Numerical Analysis/ Scientific Computing Techniques
corresponding roughly to BSc MATH or BSc RW/CSE at ETH is expected.
Basic programming skills in MATLAB or Python are required for the exercises,
and are _not_ taught in this course.
401-4656-21LDeep Learning in Scientific Computing Restricted registration - show details
Aimed at students in a Master's Programme in Mathematics, Engineering and Physics.
W6 credits2V + 1US. Mishra
AbstractMachine Learning, particularly deep learning is being increasingly applied to perform, enhance and accelerate computer simulations of models in science and engineering. This course aims to present a highly topical selection of themes in the general area of deep learning in scientific computing, with an emphasis on the application of deep learning algorithms for systems, modeled by PDEs.
ObjectiveThe objective of this course will be to introduce students to advanced applications of deep learning in scientific computing. The focus will be on the design and implementation of algorithms as well as on the underlying theory that guarantees reliability of the algorithms. We will provide several examples of applications in science and engineering where deep learning based algorithms outperform state of the art methods.
ContentA selection of the following topics will be presented in the lectures.

1. Issues with traditional methods for scientific computing such as Finite Element, Finite Volume etc, particularly for PDE models with high-dimensional state and parameter spaces.

2. Introduction to Deep Learning: Artificial Neural networks, Supervised learning, Stochastic gradient descent algorithms for training, different architectures: Convolutional Neural Networks, Recurrent Neural Networks, ResNets.

3. Theoretical Foundations: Universal approximation properties of the Neural networks, Bias-Variance decomposition, Bounds on approximation and generalization errors.

4. Supervised deep learning for solutions fields and observables of high-dimensional parametric PDEs. Use of low-discrepancy sequences and multi-level training to reduce generalization error.

5. Uncertainty Quantification for PDEs with supervised learning algorithms.

6. Deep Neural Networks as Reduced order models and prediction of solution fields.

7. Active Learning algorithms for PDE constrained optimization.

8. Recurrent Neural Networks and prediction of time series for dynamical systems.

9. Physics Informed Neural networks (PINNs) for the forward problem for PDEs. Applications to high-dimensional PDEs.

10. PINNs for inverse problems for PDEs, parameter identification, optimal control and data assimilation.

All the algorithms will be illustrated on a variety of PDEs: diffusion models, Black-Scholes type PDEs from finance, wave equations, Euler and Navier-Stokes equations, hyperbolic systems of conservation laws, Dispersive PDEs among others.
Lecture notesLecture notes will be provided at the end of the course.
LiteratureAll the material in the course is based on research articles written in last 1-2 years. The relevant references will be provided.
Prerequisites / NoticeThe students should be familiar with numerical methods for PDEs, for instance in courses such as Numerical Methods for PDEs for CSE, Numerical analysis of Elliptic and Parabolic PDEs, Numerical methods for hyperbolic PDEs, Computational methods for Engineering Applications.

Some familiarity with basic concepts in machine learning will be beneficial. The exercises in the course rely on standard machine learning frameworks such as KERAS, TENSORFLOW or PYTORCH. So, competence in Python is helpful.
401-4652-21LNonlocal Inverse ProblemsW4 credits2VJ. Railo
AbstractThis course is an introduction to the Calderón problem and nonlocal inverse problems for the fractional Schrödinger equation. These are examples of nonlinear inverse problems. The classical Calderón problem models electrical impedance tomography (EIT) and fractional operators appear, for example, in some mathematical models in finance.
ObjectiveStudents become familiar with the Calderón problem and some nonlocal phenomena
related to the fractional Laplacian. Advanced students should be able to read
research articles on the fractional Calderón problems after the course.
ContentIn the beginning of the course, we will introduce some basic theory for the
classical Calderón problem. The focus of the course will be in the study of
nonlocal inverse problems for the fractional Schrödinger equation with lower
order perturbations. We discuss necessary preliminaries on Sobolev spaces,
Fourier analysis, functional analysis and theory of PDEs. Our scope will be in
the uniqueness properties.

Classical Calderón problem (about 1/3): Conductivity and Schrödinger equations,
Dirichlet-to-Neumann maps, Cauchy data, and related boundary value inverse
problems. The methods include, for example, complex geometric optics (CGO)
solutions.

Fractional Calderón problem (about 2/3): Nonlocal unique continuation
principles (UCP), Runge approximation properties, and uniqueness for the
fractional Calderón problem. The methods include, for example,
Caffarelli-Silvestre extensions, the fractional Poincaré inequality and Riesz
transforms.
Lecture notesLecture notes and exercises
Literature1. M. Salo: Calderón problem. Lecture notes, University of Helsinki (2008).
(Available at Link.)
2. T. Ghosh, M. Salo, G. Uhlmann: The Calderón problem for the fractional
Schrödinger equation. Analysis & PDE 13 (2020), no. 2, 455-475.
3. A. Rüland, M. Salo: The fractional Calderón problem: low regularity and
stability. Nonlinear Analysis 193 (2020), special issue "Nonlocal and
Fractional Phenomena", 111529.
4. Other literature will be specified in the course.
Prerequisites / NoticeFunctional Analysis I & II or similar knowledge. Any additional knowledge of
Fourier analysis, Sobolev spaces, distributions and PDEs will be an asset.
401-3426-21LTime-Frequency AnalysisW4 credits2GR. Alaifari
AbstractThis course gives a basic introduction to time-frequency analysis from the viewpoint of applied harmonic analysis.
ObjectiveBy the end of the course students should be familiar with the concept of the short-time Fourier transform, the Bargmann transform, quadratic time-frequency representations (ambiguity function and Wigner distribution), Gabor frames and modulation spaces. The connection and comparison to time-scale representations will also be subject of this course.
ContentTime-frequency analysis lies at the heart of many applications in signal processing and aims at capturing time and frequency information simultaneously (as opposed to the classical Fourier transform). This course gives a basic introduction that starts with studying the short-time Fourier transform and the special role of the Gauss window. We will visit quadratic representations and then focus on discrete time-frequency representations, where Gabor frames will be introduced. Later, we aim at a more quantitative analysis of time-frequency information through modulation spaces. At the end, we touch on wavelets (time-scale representation) as a counterpart to the short-time Fourier transform.
LiteratureGröchenig, K. (2001). Foundations of time-frequency analysis. Springer Science & Business Media.
Prerequisites / NoticeFunctional analysis, Fourier analysis, complex analysis, operator theory
Selection: Probability Theory, Statistics
NumberTitleTypeECTSHoursLecturers
401-4611-21LRough Path Theory Information W4 credits2VA. Allan, J. Teichmann
AbstractThe aim of this course is to provide an introduction to the theory of rough paths, with a particular focus on their integration theory and associated rough differential equations, and how the theory relates to and enhances the field of stochastic calculus.
ObjectiveOur first motivation will be to understand the limitations of classical notions of integration to handle paths of very low regularity, and to see how the rough integral succeeds where other notions fail. We will construct rough integrals and establish solutions of differential equations driven by rough paths, as well as the continuity of these objects with respect to the paths involved, and their consistency with stochastic integration and SDEs. Various applications and extensions of the theory will then be discussed.
Lecture notesLecture notes will be provided by the lecturer.
LiteratureP. K. Friz and M. Hairer, A course on rough paths with an introduction to regularity structures, Springer (2014).
P. K. Friz and N. B. Victoir. Multidimensional stochastic processes as rough paths, Cambridge University Press (2010).
Prerequisites / NoticeThe aim will be to make the course as self-contained as possible, but some knowledge of stochastic analysis is highly recommended. The course “Brownian Motion and Stochastic Calculus” would be ideal, but not strictly required.
401-4626-00LAdvanced Statistical Modelling: Mixed Models
Does not take place this semester.
W4 credits2VM. Mächler
AbstractMixed Models = (*| generalized| non-) linear Mixed-effects Models, extend traditional regression models by adding "random effect" terms.

In applications, such models are called "hierarchical models", "repeated measures" or "split plot designs". Mixed models are widely used and appropriate in an aera of complex data measured from living creatures from biology to human sciences.
Objective- Becoming aware how mixed models are more realistic and more powerful in many cases than traditional ("fixed-effects only") regression models.

- Learning to fit such models to data correctly, critically interpreting results for such model fits, and hence learning to work the creative cycle of responsible statistical data analysis:
"fit -> interpret & diagnose -> modify the fit -> interpret & ...."

- Becoming aware of computational and methodological limitations of these models, even when using state-of-the art software.
ContentThe lecture will build on various examples, use R and notably the `lme4` package, to illustrate concepts. The relevant R scripts are made available online.

Inference (significance of factors, confidence intervals) will focus on the more realistic *un*balanced situation where classical (ANOVA, sum of squares etc) methods are known to be deficient. Hence, Maximum Likelihood (ML) and its variant, "REML", will be used for estimation and inference.
Lecture notesWe will work with an unfinished book proposal from Prof Douglas Bates, Wisconsin, USA which itself is a mixture of theory and worked R code examples.

These lecture notes and all R scripts are made available from
Link
Literature(see web page and lecture notes)
Prerequisites / Notice- We assume a good working knowledge about multiple linear regression ("the general linear model') and an intermediate (not beginner's) knowledge about model based statistics (estimation, confidence intervals,..).

Typically this means at least two classes of (math based) statistics, say
1. Intro to probability and statistics
2. (Applied) regression including Matrix-Vector notation Y = X b + E

- Basic (1 semester) "Matrix calculus" / linear algebra is also assumed.

- If familiarity with [R](Link) is not given, it should be acquired during the course (by the student on own initiative).
401-4627-00LEmpirical Process Theory and ApplicationsW4 credits2VS. van de Geer
AbstractEmpirical process theory provides a rich toolbox for studying the properties of empirical risk minimizers, such as least squares and maximum likelihood estimators, support vector machines, etc.
Objective
ContentIn this series of lectures, we will start with considering exponential inequalities, including concentration inequalities, for the deviation of averages from their mean. We furthermore present some notions from approximation theory, because this enables us to assess the modulus of continuity of empirical processes. We introduce e.g., Vapnik Chervonenkis dimension: a combinatorial concept (from learning theory) of the "size" of a collection of sets or functions. As statistical applications, we study consistency and exponential inequalities for empirical risk minimizers, and asymptotic normality in semi-parametric models. We moreover examine regularization and model selection.
  •  Page  1  of  3 Next page Last page     All