Profil: SQ
Schwerpunkt: IMA-SQ, IMA-AI
https://lvb.informatik.uni-bremen.de/imat/03-imat-au.pdf
First Lecture: Thursday, Sep 19.

A key assumption of many powerful optimization methods is that all the data is fully accessible from the beginning.

However, from the point of view of many real-world applications (e.g., in logistics, production or project planning, cloud computing, etc.) this assumption is simply not true. Large data centers allocate resources to tasks without knowledge of exact execution times or energy requirements; transit times in networks are often uncertain; or, parameters such as bandwidth, demands or energy consumption are highly fluctuating. The current trend of data collection and data-driven applications often amplifies this phenomenon. As the amount of available data is increasing tremendously due to internet technology, cloud systems and sharing markets, modern algorithms are expected to be highly adaptive and learn and benefit from the dynamically changing mass of data.

In the above examples, our knowledge of the current data is only partial or based on historical estimates. The class ``Algorithms and Uncertainty'' will teach students about the most common models of such uncertain data and how to design and analyze efficient algorithms in these models.

Specifically, we will cover the theory of online optimization, where the input arrives without any prior information (such as network packets arriving to a router) and also needs to be processed immediately, before the next piece of input arrives. This model is best suited for analyzing critical networking and scheduling systems where devices and algorithms must perform well even in the worst-case scenario.

In the cases where previous history can be used to model the upcoming data, we often employ robust optimization or stochastic optimization. In robust optimization, the aim is to optimize the worst-case of all possible realizations of the input data. Hence, this model is rather conservative.
In stochastic optimization however, the algorithms work with the assumption that data is drawn from some probability distribution known ahead of time and typically the goal is to optimize the expected value.

Nowadays, another source of information is often available: machine learning algorithms can generate predictions which are accurate most of the time. However, there is no guarantee on the quality of the prediction, as the current instance may not be covered by the training set. This statement motivated a very recent research domain that will be covered in this course: how to use error-prone predictions in order to improve guaranteed algorithms.

Organization: The course will be taught in English in two sessions per week (4 SWS) including interactive exercise sessions.

Examination: The examination will be by individual oral exam. As admission to the oral exam it is mandatory to present solutions in the exercise session at least twice during the term.

Prerequisites: Having heard an introductory course to discrete algorithms and their mathematical analysis (e.g. Algorithmentheorie, Algorithmische Diskrete Mathematik) or graph theory is beneficial but not required.

Profil: SQ
Schwerpunkt: IMA-SQ, IMA-AI
https://lvb.informatik.uni-bremen.de/imat/03-imat-au.pdf
First Lecture: Thursday, Sep 19.

A key assumption of many powerful optimization methods is that all the data is fully accessible from the beginning.

However, from the point of view of many real-world applications (e.g., in logistics, production or project planning, cloud computing, etc.) this assumption is simply not true. Large data centers allocate resources to tasks without knowledge of exact execution times or energy requirements; transit times in networks are often uncertain; or, parameters such as bandwidth, demands or energy consumption are highly fluctuating. The current trend of data collection and data-driven applications often amplifies this phenomenon. As the amount of available data is increasing tremendously due to internet technology, cloud systems and sharing markets, modern algorithms are expected to be highly adaptive and learn and benefit from the dynamically changing mass of data.

In the above examples, our knowledge of the current data is only partial or based on historical estimates. The class ``Algorithms and Uncertainty'' will teach students about the most common models of such uncertain data and how to design and analyze efficient algorithms in these models.

Specifically, we will cover the theory of online optimization, where the input arrives without any prior information (such as network packets arriving to a router) and also needs to be processed immediately, before the next piece of input arrives. This model is best suited for analyzing critical networking and scheduling systems where devices and algorithms must perform well even in the worst-case scenario.

In the cases where previous history can be used to model the upcoming data, we often employ robust optimization or stochastic optimization. In robust optimization, the aim is to optimize the worst-case of all possible realizations of the input data. Hence, this model is rather conservative.
In stochastic optimization however, the algorithms work with the assumption that data is drawn from some probability distribution known ahead of time and typically the goal is to optimize the expected value.

Nowadays, another source of information is often available: machine learning algorithms can generate predictions which are accurate most of the time. However, there is no guarantee on the quality of the prediction, as the current instance may not be covered by the training set. This statement motivated a very recent research domain that will be covered in this course: how to use error-prone predictions in order to improve guaranteed algorithms.

Organization: The course will be taught in English in two sessions per week (4 SWS) including interactive exercise sessions.

Examination: The examination will be by individual oral exam. As admission to the oral exam it is mandatory to present solutions in the exercise session at least twice during the term.

Prerequisites: Having heard an introductory course to discrete algorithms and their mathematical analysis (e.g. Algorithmentheorie, Algorithmische Diskrete Mathematik) or graph theory is beneficial but not required.

Profil: KIKR
Schwerpunkt: IMVP-AI
https://lvb.informatik.uni-bremen.de/imvp/03-imvp-iml.pdf
Die Veranstaltung findet in den Räumen des BIPS statt.

Die Veranstaltung findet im NEOS Gebäude Raum 3410 statt.

Die Vorlesung am Di 8-10h findet im KKSB statt.

The seminar is based on the 27th Internet-Seminar, see https://www.mathematik.tu-darmstadt.de/analysis/lehre_analysis/isem27/

Das Seminar beschäftigt sich mit den mathematischen Grundlagen der wissenschaftlichen Visualisierung und behandelt Methoden für das parallele Post-Processing großer wissenschaftlicher Datensätze. Solche Daten fallen in unterschiedlichsten wissenschaftlichen Anwendungen an. Sie entstehen zum einen durch Simulationen auf Hochleistungsrechnern (z.\ B. zur Unterstützung der Klimaforschung oder für die Vorhersage von Umströmung von Flugzeugflügeln). Sie können aber auch durch Messungen, wie bspw. durch Erdbeobachtungsmissionen, erzeugt werden. Um überhaupt erst aussagekräftige Informationen für die Visualisierung zu erhalten, müssen diese enorm großen Rohdaten zunächst prozessiert werden. Für eine anschließende explorative Analyse werden echtzeitfähige, interaktive Methoden benötigt, die wiederum auf hochparallele und effiziente Verfahren beruhen. Das Seminar greift daher aktuelle Trends in der wissenschaftlichen Visualisierung auf. Zur Auswahl stehen herausragende Publikationen führender Wissenschaftler, die Themen von Multi-Resolution-Extraktion von Toplologiemerkmalen bis hin zu parallelen Beschleunigungsverfahren für das Volumenrendering in virtuellen Arbeitsumgebungen behandeln.

Homepage zur Veranstaltung: https://www.uni-bremen.de/rtg-pi3/qualification/rtg-seminar

https://lvb.informatik.uni-bremen.de/igs/03-ibfw-hto.pdf
A large number of problems arising in practical scenarios like communication, transportation, planning, logistics etc. can be formulated as discrete linear optimization problems. This course briefly introduces the theory of such problems. We develop a toolkit to model real-world problems as (discrete) linear programs. We also explore several ways to find integer solutions such as cutting planes, branch & bound, and column generation.

Throughout the course, we learn these skills by modeling and solving, for example, scheduling, packing, matching, routing, and network-design problems. We focus on translating practical examples into mixed-integer linear programs. We learn how to use solvers (such as CPLEX and Gurobi) and tailor the solution process to certain properties of the problem.

This course consists of two phases:

• One week Mon-Fri (full day) of lectures and practical labs: October 9-13, 2023, in MZH.
• A subsequent project period: One problem has to be modeled, implemented, and solved individually or in a group of at most three students. The topic will be provided by the lecturers and will be discussed on the last day of the block course. The project including the implementation has to be presented in the beginning of the winter semester.

There are no prerequisites except some basic programming skills to participate.

Please confirm your participation by email to Felix fhommels@uni-bremen.de by September 15.

3 SWS Seminar
Raum wird nach Anmeldung in Stud.IP bekannt gegeben.
Homepage des KKSB und Uni-Lageplan

The course provides an introductory level of programming skills in R.
Students are welcome to present own ideas, data and projects. I expect a project report or a method talk with demo on own data. Practicals in "R" will work also on synthetic data to illustrate methods features, limitations and differences.