Universität Regensburg   IMPRESSUM    DATENSCHUTZ
Fakultät für Mathematik Universität Regensburg
Machine Learning from a mathematical viewpoint
Semester
WiSe 2017 / 18

Lecturer
Justin Noel

Type of course (Veranstaltungsart)
Vorlesung

Contents

Plan

Machine learning lies at the center of many recent and ongoing technological advancements. The applications are numerous and include image recognition, voice recognition, language translation, data analysis, and self-driving cars. During this course we will look at some of the fundamental tools and techniques in this field, as well as the mathematics that underlies it all.

Machine learning involves the development of algorithms which learn from data for making predictions or decisions. Theese algorithms improves with more and more data. One of the reasons for the recent surge of interest in machine learning is the sheer abundance of data which is now available to us and some notable landmark acheivements in neural networks.

Underlying these techniques lies some elementary, but powerful mathematics, more than a fair amount of statistics, some computer science, and a lot of hand-waving. This being a mathematics course, we will focus on the mathematics and statistics, touch on the important issues from computer science, and try to identify the weaknesses in the foundations. Since this is a course in an applied area, we will also spend some time seeing how to actually apply these techniques to real data.

Prerequisites: A solid understanding of linear algebra and calculus. Some experience with probability and statistics (at least some measure theory). On Friday's, I will demonstrate how to apply these methods in the exercise session. This will use a mixture of mathematics, R and python (the anaconda environment). This will require some fluency with a computer, including using the command line.

Potential Topics

  • Overview: Supervised, unsupervised, and reinforcement learning.
  • Supervised learning: Linear and polynomial regression, least squares, bias-variance tradeoff. Validation and regularization techniques.
  • Supervised learning: Logistic regression, linear discriminant analysis, K-nearest neighbors, and the curse of dimensionality.
  • Supervised learning: Bayesian methods. Naive Bayes classifiers.
  • Supervised learning: Decision trees, bagging, and boosting.
  • Supervised learning: Support vector machines and kernel methods.
  • Supervised learning: Perceptrons, neural networks, cross-entropy.
  • Supervised learning: Optimization techniques: gradient descent, stochastic gradient descent, momentum.
  • Supervised learning: Convolutional and recurrent neural networks. Transfer learning.
  • Supervised learning: Word embeddings and applications.
  • Unsupervised learning: Dimensionality reduction: Principal components analysis, independent component analysis, autoencoders.
  • Unsupervised learning: Dimensionality reduction: t-SNE.
  • Unsupervised learning: Clustering: K-means, hierarchical clustering, Gaussian mixture models.
  • Unsupervised learning: Topological data analysis I: Cech and Vietoris-Rips complexes, homology, bar-codes.
  • Unsupervised learning: Topological data analysis II: Properties and structure theorem.
  • Reinforcement learning: Finding policies. The Bellman-equation.


Literature
Elements of Statistical Learning by Hastie, Tibshirani, Friedman. Deep learning by Goodfellow, Bengio, Courville

Recommended previous knowledge
Excellent understanding of linear algebra and calculus. Some probability and statistics (including some measure theory). Some computer skills.

Time/Date
Thursdays 10-12, Fridays (exercises) 10-12

Location
Thursdays M101, Fridays M102

Course homepage
http://www.nullplug.org/machine-learning.html
(Disclaimer: Dieser Link wurde automatisch erzeugt und ist evtl. extern)

Registration
  • Registration for the exercise classes:
  • Registration for course work/examination/ECTS: FlexNow
Course work (Studienleistungen)
  • Successful participation in the exercise classes: Regular participation in exercise sessions
    including completion of exercises.
Examination (Prüfungsleistungen)
  • Oral exam: Duration: 30 minutes, Date: By appointment, re-exam: Date: By appointment
Regelungen bei Studienbeginn vor WS 2015 / 16
  • Benotet:
    • O. g. Studienleistung und o. g. Prüfungsleistung; die Note ergibt sich aus der Prüfungsleistung
  • Unbenotet:
    • O. g. Studienleistung
Modules
BPraMa(2), BV, MV, MAngAn, MAT-MCS, MAT-BBioInf, CS-B-Math3, CS-B-Math4, CS-M-P1, CS-M-P2, CS-M-P3

ECTS
6
Druckansicht