<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Seminar | Neuro-Mechanistic Modeling</title>
    <link>https://mosi.uni-saarland.de/tag/seminar/</link>
      <atom:link href="https://mosi.uni-saarland.de/tag/seminar/index.xml" rel="self" type="application/rss+xml" />
    <description>Seminar</description>
    <generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 01 Apr 2026 00:00:00 +0000</lastBuildDate>
    <image>
      <url>https://mosi.uni-saarland.de/media/icon_hu_79d10899b013012f.png</url>
      <title>Seminar</title>
      <link>https://mosi.uni-saarland.de/tag/seminar/</link>
    </image>
    
    <item>
      <title>Formal Methods for AI Alignment</title>
      <link>https://mosi.uni-saarland.de/teaching/26-s-formal-methods-ai-alignment/</link>
      <pubDate>Wed, 01 Apr 2026 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/26-s-formal-methods-ai-alignment/</guid>
      <description>&lt;h2 id=&#34;team&#34;&gt;Team&lt;/h2&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/kevin-baum/&#34;&gt;Kevin Baum&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/lisa-dargasz/&#34;&gt;Lisa Dargasz&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/felix-jahn/&#34;&gt;Felix Jahn&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/yannic-muskalla/&#34;&gt;Yannic Muskalla&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/andre-steingruber/&#34;&gt;Andre Steingrüber&lt;/a&gt;&lt;/p&gt;
&lt;h2 id=&#34;content&#34;&gt;Content&lt;/h2&gt;
&lt;p&gt;AI alignment is, broadly speaking, the task of ensuring that AI systems act in
accordance with human values and goals (though what exactly this means remains
contested). Many prevalent alignment approaches, such as RLHF and
Constitutional AI, suffer from limited interpretability and lack formal
guarantees. Bridging these approaches with formal frameworks, both
computational and normative, seems tempting, as it promises more rigorous and
interpretable alignment techniques.&lt;/p&gt;
&lt;p&gt;In this seminar, we explored a rich repertoire of papers: foundational work on
the current state of alignment methods; prima facie suitable formal approaches
from computer science (including temporal logics and reward machines) and
philosophy (such as deontic logics and theories of reasons); and
neuro-symbolic architectures that attempt to combine the strengths of learned
systems with formal methods. Participants discussed these different strands of
research with one another and with members of our interdisciplinary research
group.&lt;/p&gt;
&lt;h2 id=&#34;requirements&#34;&gt;Requirements&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;Genuine interest in questions related to AI alignment and AI safety&lt;/li&gt;
&lt;li&gt;Familiarity with some of the following areas: agentic AI, reinforcement
learning, formal logic and formal methods, practical reasoning, and practical
philosophy&lt;/li&gt;
&lt;li&gt;Ability and willingness to read and critically discuss English-language
research papers&lt;/li&gt;
&lt;li&gt;Openness to interdisciplinary perspectives and active, engaged participation
in seminar discussions&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;p&gt;&lt;strong&gt;Block A: State-of-the-Art AI Alignment&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;A1, RLHF basics: &lt;a href=&#34;https://arxiv.org/abs/1706.03741&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Deep Reinforcement Learning from Human Preferences&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/abs/2203.02155&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Training Language Models to Follow Instructions with Human Feedback&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A2, RLHF-based alignment and Constitutional AI: &lt;a href=&#34;https://arxiv.org/abs/2212.08073&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Constitutional AI: Harmlessness from AI Feedback&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/abs/2204.05862&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedback&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;A3, LLM guardrails: &lt;a href=&#34;https://arxiv.org/html/2604.15579v1&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Symbolic Guardrails for Domain-Specific Agents: Stronger Safety and Security Guarantees Without Sacrificing Utility&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/abs/2503.18666&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;AgentSpec: Customizable Runtime Enforcement for Safe and Reliable LLM Agents&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Block B: Normative Logics&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;B1, Normative systems: &lt;a href=&#34;https://www.researchgate.net/publication/226160754_A_Temporal_Logic_of_Normative_Systems&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;A Temporal Logic of Normative Systems&lt;/a&gt;; &lt;a href=&#34;https://www.sciencedirect.com/science/article/pii/000437029400007N&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;On social laws for artificial agent societies: off-line design&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;B2, Logic of reasons: &lt;a href=&#34;https://dl.acm.org/doi/10.1145/3514094.3534182&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Piecemeal Knowledge Acquisition for Computational Normative Reasoning&lt;/a&gt;; &lt;a href=&#34;http://www.horty.umiacs.io/articles/2024-ot.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Precedent and Open Texture&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;B3, Deontic temporal logic: &lt;a href=&#34;https://link.springer.com/chapter/10.1007/11786849_7&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Strategic Deontic Temporal Logic as a Reduction to ATL, with an Application to Chisholm’s Scenario&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/abs/2501.05765&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Deontic Temporal Logic for Formal Verification of AI Ethics&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;B4, Logic and verification: &lt;a href=&#34;https://www.sciencedirect.com/science/article/pii/S0921889015003000&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Formal verification of ethical choices in autonomous systems&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/abs/2403.16100&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Specifying Agent Ethics (Blue Sky Ideas)&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Block C: Logic-Based RL&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;C1, RL with reward machines: &lt;a href=&#34;https://link.springer.com/chapter/10.1007/978-3-031-43264-4_21&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Synthesising Reward Machines for Cooperative Multi-Agent Reinforcement Learning&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/abs/2010.03950&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;C2, RL with temporal logics: &lt;a href=&#34;https://arxiv.org/abs/2010.06797&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Reinforcement Learning Based Temporal Logic Control with Maximum Probabilistic Satisfaction&lt;/a&gt;; &lt;a href=&#34;https://arxiv.org/pdf/1903.09885&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Temporal Logic Guided Safe Reinforcement Learning Using Control Barrier Functions&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;C3, Ethical RL agents: &lt;a href=&#34;https://link.springer.com/article/10.1007/s10676-022-09665-8&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Enforcing Ethical Goals Over Reinforcement Learning Policies&lt;/a&gt;; &lt;a href=&#34;https://link.springer.com/article/10.1007/s13218-024-00844-x&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Learning Normative Behaviour Through Automated Theorem Proving&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;C4, Shielding: &lt;a href=&#34;https://arxiv.org/abs/1708.08611&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Safe Reinforcement Learning via Shielding&lt;/a&gt;; &lt;a href=&#34;https://drops.dagstuhl.de/storage/00lipics/lipics-vol171-concur2020/LIPIcs.CONCUR.2020.3/LIPIcs.CONCUR.2020.3.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Safe Reinforcement Learning Using Probabilistic Shields&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Block D: Neuro-Symbolic Architectures&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;D1, Neurosymbolic AI: &lt;a href=&#34;https://arxiv.org/abs/2012.05876&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Neurosymbolic AI: The 3rd Wave&lt;/a&gt;; &lt;a href=&#34;https://onlinelibrary.wiley.com/doi/10.1002/aaai.12036&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;The Third AI Summer: AAAI Robert S. Engelmore Memorial Lecture&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;D2, World models: &lt;a href=&#34;https://arxiv.org/abs/2405.06624v3&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systems&lt;/a&gt;; &lt;a href=&#34;https://lawzero.org/en/publication/scientist-ai-safe-design-not-desiring&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;The Scientist AI: Safe by Design, by Not Desiring&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;D3, Neurosymbolic alignment: &lt;a href=&#34;https://arxiv.org/abs/2312.01818&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Hybrid Approaches for Moral Value Alignment in AI Agents&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;D4, GRACE: &lt;a href=&#34;https://arxiv.org/abs/2601.10520&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Breaking Up with Normatively Monolithic Agency with GRACE: A Reason-Based Neuro-Symbolic Architecture for Safe and Ethical AI Alignment&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;organization&#34;&gt;Organization&lt;/h2&gt;
&lt;p&gt;All information and materials are available in the
&lt;a href=&#34;https://cms.sic.saarland/fmaia26/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CMS&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Special Topics in Deep Reinforcement Learning</title>
      <link>https://mosi.uni-saarland.de/teaching/26-s-special-topics-in-deep-rl/</link>
      <pubDate>Wed, 01 Apr 2026 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/26-s-special-topics-in-deep-rl/</guid>
      <description>&lt;h2 id=&#34;team&#34;&gt;Team&lt;/h2&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/timo-gros/&#34;&gt;Timo P. Gros&lt;/a&gt; (lecturers)&lt;br&gt;
&lt;a href=&#34;https://mosi.uni-saarland.de/person/magnus-cunow/&#34;&gt;Magnus Cunow&lt;/a&gt; (organization)&lt;br&gt;
&lt;a href=&#34;https://mosi.uni-saarland.de/person/julius-gabelmann/&#34;&gt;Julius Gabelmann&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/joshua-meyer/&#34;&gt;Joshua Meyer&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/nicola-muller/&#34;&gt;Nicola J. Müller&lt;/a&gt; (assistants)&lt;/p&gt;
&lt;h2 id=&#34;content&#34;&gt;Content&lt;/h2&gt;
&lt;p&gt;Reinforcement Learning (RL) is a popular sub-discipline of Machine Learning for
problems that require strategies to solve complex tasks such as board games,
scheduling problems, or other discrete optimization problems. Deep
Reinforcement Learning (DRL) is the combination of Reinforcement Learning with
Neural Networks.&lt;/p&gt;
&lt;p&gt;In this seminar, we first covered the most important algorithms of Deep
Reinforcement Learning. Afterwards, we looked at special topics that our group
is conducting research on: exploration techniques, agentic RL, and AI planning.&lt;/p&gt;
&lt;h2 id=&#34;format&#34;&gt;Format&lt;/h2&gt;
&lt;p&gt;After a kick-off in April, each participant was assigned a paper and presented
it in one of two seminar blocks in June, wrote a summary paper about it, and
worked on a practical project in a team. The seminar ended with a closing
session on the project results, with prizes, and short presentations of the
group&amp;rsquo;s current research for students interested in a Master&amp;rsquo;s thesis or a
HiWi position.&lt;/p&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;p&gt;&lt;strong&gt;Deep Reinforcement Learning&lt;/strong&gt;&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Value-based DRL Evolution (core: &lt;a href=&#34;https://cdn.aaai.org/ojs/11796/11796-13-15324-1-2-20201228.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Rainbow&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Actor-Critic: Structure &amp;amp; Estimation (core: &lt;a href=&#34;https://proceedings.mlr.press/v48/mniha16.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;A2C/A3C&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Policy Optimization Stability (core: &lt;a href=&#34;https://proceedings.mlr.press/v37/schulman15.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;TRPO&lt;/a&gt; &amp;amp; &lt;a href=&#34;https://arxiv.org/pdf/1707.06347&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;PPO&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Continuous Control in DRL (core: &lt;a href=&#34;https://arxiv.org/pdf/1509.02971&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;DDPG&lt;/a&gt; &amp;amp; &lt;a href=&#34;https://arxiv.org/pdf/1812.05905&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;SAC&lt;/a&gt;)&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;&lt;strong&gt;Planning &amp;amp; RL&lt;/strong&gt;&lt;/p&gt;
&lt;ol start=&#34;5&#34;&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2512.19355&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;FOL for goal-conditioned RL&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2412.08574&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Sketch Decomposition via DRL&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://ojs.aaai.org/index.php/AAAI/article/view/34864&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Model Aware Policy Transfer using Q-Learning&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;&lt;strong&gt;Exploration&lt;/strong&gt;&lt;/p&gt;
&lt;ol start=&#34;8&#34;&gt;
&lt;li&gt;&lt;a href=&#34;https://proceedings.neurips.cc/paper/2021/hash/d428d070622e0f4363fceae11f4a3576-Abstract.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;NovelD&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.ijcai.org/proceedings/2023/477&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;DEIR&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/abs/2501.15418&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Episodic Novelty Through Temporal Distance&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://proceedings.mlr.press/v202/gallouedec23a.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Cell-Free Latent Go-Explore&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;&lt;strong&gt;Agentic RL&lt;/strong&gt;&lt;/p&gt;
&lt;ol start=&#34;12&#34;&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2402.03300&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Group Relative Policy Optimization Algorithm&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2504.13958&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Tool-Integrated RL&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://proceedings.neurips.cc/paper_files/paper/2023/file/1b44b878bb782e6954cd888628510e90-Paper-Conference.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Reflexion: Verbal RL&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2508.04652&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Multi-Agent RL&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;h2 id=&#34;organization&#34;&gt;Organization&lt;/h2&gt;
&lt;p&gt;All information and materials are available in the
&lt;a href=&#34;https://cms.sic.saarland/stdrl26/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CMS&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Spatiotemporal Models and Inference</title>
      <link>https://mosi.uni-saarland.de/teaching/25-s-spatiotemporal-models/</link>
      <pubDate>Tue, 01 Apr 2025 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/25-s-spatiotemporal-models/</guid>
      <description>&lt;h2 id=&#34;team&#34;&gt;Team&lt;/h2&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/jonas-wahl/&#34;&gt;Dr. Jonas Wahl&lt;/a&gt; (lecturer)&lt;br&gt;
&lt;a href=&#34;https://mosi.uni-saarland.de/person/felix-jahn/&#34;&gt;Felix Jahn&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/pascal-schumann/&#34;&gt;Pascal Schumann&lt;/a&gt; (assistants)&lt;/p&gt;
&lt;h2 id=&#34;content&#34;&gt;Content&lt;/h2&gt;
&lt;p&gt;In many scientific fields, data is not just tied to a single location or a
single moment in time: it evolves over both space and time. Whether tracking
the spread of infectious diseases, predicting climate patterns, modeling
traffic flows, or analyzing environmental pollution, understanding how
variables change across both dimensions is crucial. This is where
spatiotemporal modeling comes in.&lt;/p&gt;
&lt;p&gt;Spatiotemporal models aim to capture dependencies and relationships in data
that vary over time and across geographical locations. Unlike purely spatial
or purely temporal models, these approaches integrate both dimensions,
allowing us to uncover trends, make predictions, and quantify uncertainties in
dynamic systems. Spatiotemporal models can be of different types:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Deterministic models&lt;/strong&gt;, based on physical laws or equations (e.g., fluid
dynamics for weather modeling).&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Statistical models&lt;/strong&gt;, which use probability distributions to describe
uncertainties (e.g., Gaussian processes, Bayesian hierarchical models).&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Machine learning models&lt;/strong&gt;, which learn patterns from large datasets using
neural networks, random forests, or deep learning approaches.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The latter two were the main focus of this seminar. Applications of
spatiotemporal modeling are found across the sciences, from forecasting the
spread of diseases and analyzing temperature changes over decades to
optimizing transportation networks and tracking animal migration or
deforestation. The seminar covered the theoretical underpinnings of
spatiotemporal statistics, Bayesian approaches and hierarchical models, and
machine learning techniques for complex spatiotemporal data.&lt;/p&gt;
&lt;h2 id=&#34;format&#34;&gt;Format&lt;/h2&gt;
&lt;p&gt;A block seminar for up to 10 participants, with a kick-off in June. Each
participant gave a 60-minute presentation. Grading: presentation (50%),
participation in the talks of fellow participants and the discussion (25%),
and a final report on the topic (25%).&lt;/p&gt;
&lt;p&gt;Prerequisites: successful participation in a machine or deep learning course,
or a background in statistical modeling, for instance from a course on
statistics or stochastic processes.&lt;/p&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://wiklec.mufaculty.umsystem.edu/books&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Statistics for Spatiotemporal Data&lt;/a&gt;, Chapter 2: Statistical preliminaries&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://wiklec.mufaculty.umsystem.edu/books&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Statistics for Spatiotemporal Data&lt;/a&gt;, Chapter 3: Fundamentals of Temporal Processes&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://wiklec.mufaculty.umsystem.edu/books&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Statistics for Spatiotemporal Data&lt;/a&gt;, Chapter 4: Fundamentals of Spatial Random Processes&lt;/li&gt;
&lt;li&gt;Introduction to Gaussian processes (lecture notes &lt;a href=&#34;https://nikolaimatni.github.io/courses/ese680-fall2019/scribe-notes/lecture24.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;here&lt;/a&gt; and &lt;a href=&#34;https://cs229.stanford.edu/section/cs229-gaussian_processes.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;here&lt;/a&gt;, and &lt;a href=&#34;https://gaussianprocess.org/gpml/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;the book&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Coding tutorial on spatial Gaussian processes (based on &lt;a href=&#34;https://www.pymc-labs.com/blog-posts/spatial-gaussian-process-01/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;this blog post&lt;/a&gt; and &lt;a href=&#34;https://peterroelants.github.io/posts/gaussian-process-tutorial/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;this one&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Introduction to point processes (lecture notes &lt;a href=&#34;https://courses.mpi-sws.org/hcml-ws18/lectures/TPP.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;here&lt;/a&gt;, slides &lt;a href=&#34;https://learning.mpi-sws.org/tpp-icml18/seminar-icml18-part1.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;here&lt;/a&gt; and &lt;a href=&#34;https://learning.mpi-sws.org/tpp-icml18/seminar-icml18-part2.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;here&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Coding tutorial on point processes (with the &lt;a href=&#34;https://x-datainitiative.github.io/tick/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;tick package&lt;/a&gt;, &lt;a href=&#34;https://github.com/meowoodie/Spatio-Temporal-Point-Process-Simulator&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;this simulator&lt;/a&gt;, &lt;a href=&#34;https://nbviewer.org/github/MatthewDaws/PointProcesses/tree/master/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;these Jupyter notebooks&lt;/a&gt;, or &lt;a href=&#34;https://www.paulamoraga.com/book-spatial/spatial-point-patterns.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;spatial point patterns in R&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.nature.com/articles/s41467-024-51477-5&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Scalable spatiotemporal prediction with Bayesian neural fields&lt;/a&gt;, with a &lt;a href=&#34;https://google.github.io/bayesnf/tutorials/BayesNF_Tutorial_on_Hungarian_Chickenpox/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;coding tutorial on Bayesian neural fields&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://link.springer.com/article/10.1007/s00477-021-02168-w&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;A Bayesian machine-learning approach for spatiotemporal prediction of COVID-19 cases&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Spatial-temporal graph neural networks for groundwater data&lt;/li&gt;
&lt;/ol&gt;
&lt;h2 id=&#34;organization&#34;&gt;Organization&lt;/h2&gt;
&lt;p&gt;All information and materials are available in the
&lt;a href=&#34;https://cms.sic.saarland/spamo/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CMS&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Hands-On Graph Neural Networks</title>
      <link>https://mosi.uni-saarland.de/teaching/24-w-hands-on-graph-neural-networks/</link>
      <pubDate>Tue, 01 Oct 2024 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/24-w-hands-on-graph-neural-networks/</guid>
      <description>&lt;h3 id=&#34;lecturers&#34;&gt;Lecturers&lt;/h3&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/joschka-gro%C3%9F/&#34;&gt;Joschka Groß, M.Sc.&lt;/a&gt;&lt;br&gt;
&lt;a href=&#34;https://mosi.uni-saarland.de/person/felix-jahn/&#34;&gt;Felix Jahn, M.Sc.&lt;/a&gt;&lt;br&gt;
&lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;The Hands-on GNNs seminar covered the basics of graph neural networks and their
applications in various domains. The seminar was held in the winter semester 2024.
Participants read and presented papers on the topic and summarized their
learnings in easy-to-follow-along &lt;em&gt;talktorials&lt;/em&gt;. These are Jupyter notebooks that
guide the reader through select topics concerning the fundamentals of GNNs and
more advanced topics.&lt;/p&gt;
&lt;h3 id=&#34;organization&#34;&gt;Organization&lt;/h3&gt;
&lt;p&gt;For all organizational matters, please first consult the
&lt;a href=&#34;https://cms.sic.saarland/hognn2024/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CMS&lt;/a&gt; or contact &lt;a href=&#34;https://mosi.uni-saarland.de/person/joschka-gro%C3%9F/&#34;&gt;Joschka Groß&lt;/a&gt;.&lt;/p&gt;
&lt;h3 id=&#34;final-talktorials&#34;&gt;Final talktorials&lt;/h3&gt;
&lt;p&gt;Coming soon.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Neuro-symbolic General Policy Learning</title>
      <link>https://mosi.uni-saarland.de/teaching/24-w-neuro-symbolic-general-policy-learning/</link>
      <pubDate>Tue, 01 Oct 2024 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/24-w-neuro-symbolic-general-policy-learning/</guid>
      <description>&lt;h2 id=&#34;supervisors&#34;&gt;Supervisors&lt;/h2&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/timo-gros/&#34;&gt;Timo P. Gros&lt;/a&gt;, Jörg Hoffmann, Daniel Höller,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/nicola-muller/&#34;&gt;Nicola J. Müller&lt;/a&gt; and
&lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;&lt;/p&gt;
&lt;h2 id=&#34;content&#34;&gt;Content&lt;/h2&gt;
&lt;p&gt;Symbolic AI relies on explicit, human-readable symbols and rules to represent
knowledge and solve problems. This approach contrasts with modern, data-driven
methods like machine learning, which rely on statistical patterns rather than
explicit rules. Recently, both approaches have been combined, leading to the
development of neuro-symbolic methods.&lt;/p&gt;
&lt;p&gt;For instance, heuristic search, as a very successful part of symbolic AI, must
be applied individually to each instance of a domain or problem. In contrast,
neuro-symbolic general policy learning focuses on neural network-based
policies that can solve all instances within a specific domain, combining the
benefits of symbolic and data-driven AI.&lt;/p&gt;
&lt;p&gt;In this seminar, we explored the emerging trend of learning neuro-symbolic
general policies where the underlying architecture is based on Graph Neural
Networks or Transformers.&lt;/p&gt;
&lt;h2 id=&#34;format&#34;&gt;Format&lt;/h2&gt;
&lt;p&gt;A seminar with 7 graded ECTS points, run in block format: an initial meeting
in November and a block of student presentations in March. Each participant
read and understood a piece of research, wrote a summary paper in their own
words, gave a presentation, and gave detailed feedback on the paper and
presentation of a fellow student.&lt;/p&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;p&gt;&lt;strong&gt;Area 1: Analysis of General Policies&lt;/strong&gt; (supervisor: &lt;a href=&#34;https://mosi.uni-saarland.de/person/timo-gros/&#34;&gt;Timo P. Gros&lt;/a&gt;)&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Simon Ståhlberg, Blai Bonet, and Hector Geffner. &lt;a href=&#34;https://mrlab.ai/papers/stahlberg-et-al-icaps2022.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Learning general optimal policies with graph neural networks: Expressive power, transparency, and limits.&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Simon Ståhlberg, Blai Bonet, and Hector Geffner. &lt;a href=&#34;https://prl-theworkshop.github.io/prl2022-icaps/papers/PRL2022_paper_7.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Learning generalized policies without supervision using GNNs.&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Rostislav Horčík and Gustav Šír. &lt;a href=&#34;https://ojs.aaai.org/index.php/ICAPS/article/view/31486&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Expressiveness of graph neural networks in planning domains.&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Dillon Z. Chen, Sylvie Thiébaux, and Felipe Trevizan. &lt;a href=&#34;https://arxiv.org/pdf/2312.11143&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Learning domain independent heuristics for grounded and lifted planning.&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;&lt;strong&gt;Area 2: Training of General Policies&lt;/strong&gt; (supervisor: Daniel Höller)&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Sam Toyer, Felipe Trevizan, Sylvie Thiébaux, and Lexing Xie. &lt;a href=&#34;https://cdn.aaai.org/ojs/12089/12089-13-15617-1-2-20201228.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Action schema networks: Generalised policies with deep learning.&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Or Rivlin, Tamir Hazan, and Erez Karpas. &lt;a href=&#34;https://arxiv.org/pdf/2005.02305&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Generalized planning with deep reinforcement learning.&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Simon Ståhlberg, Blai Bonet, and Hector Geffner. &lt;a href=&#34;https://proceedings.kr.org/2023/63/kr2023-0063-stahlberg-et-al.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Learning general policies with policy gradient methods.&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;&lt;strong&gt;Area 3: General Policies using Transformers&lt;/strong&gt; (supervisor: &lt;a href=&#34;https://mosi.uni-saarland.de/person/nicola-muller/&#34;&gt;Nicola J. Müller&lt;/a&gt;)&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Nicola J. Müller, Pablo Sánchez, Jörg Hoffmann, Verena Wolf, and Timo P. Gros. &lt;a href=&#34;https://mosi.uni-saarland.de/assets/papers/mueller-PRL24.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Comparing state-of-the-art graph neural networks and transformers for general policy learning.&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Nicholas Rossetti, Massimiliano Tummolo, Alfonso Emilio Gerevini, Luca Putelli, Ivan Serina, Mattia Chiari, and Matteo Olivato. &lt;a href=&#34;https://ojs.aaai.org/index.php/ICAPS/article/view/31510&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Learning general policies for planning through GPT models.&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Lucas Lehnert, Sainbayar Sukhbaatar, Paul Mcvay, Michael Rabbat, and Yuandong Tian. &lt;a href=&#34;https://arxiv.org/pdf/2402.14083&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Beyond A*: Better planning with transformers via search dynamics bootstrapping.&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Lili Chen, Kevin Lu, Aravind Rajeswaran, Kimin Lee, Aditya Grover, Michael Laskin, Pieter Abbeel, Aravind Srinivas, and Igor Mordatch. &lt;a href=&#34;https://proceedings.neurips.cc/paper_files/paper/2021/file/7f489f642a0ddb10272b5c31057f0663-Paper.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Decision transformer: Reinforcement learning via sequence modeling.&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;h2 id=&#34;organization&#34;&gt;Organization&lt;/h2&gt;
&lt;p&gt;All information and materials are available in the
&lt;a href=&#34;https://cms.sic.saarland/nsgpl/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CMS&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Bridging the Gap – Language Models and Structured Knowledge in AI</title>
      <link>https://mosi.uni-saarland.de/teaching/24-s-bridging-the-gap/</link>
      <pubDate>Thu, 19 Sep 2024 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/24-s-bridging-the-gap/</guid>
      <description>&lt;h2 id=&#34;organizers&#34;&gt;Organizers&lt;/h2&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Dr. Gerrit Großmann&lt;/a&gt;&lt;br&gt;
&lt;a href=&#34;https://www.dfki.de/web/ueber-uns/mitarbeiter/person/ceog01/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Cennet Oguz, M.Sc.&lt;/a&gt;&lt;br&gt;
&lt;a href=&#34;https://www.dfki.de/web/ueber-uns/mitarbeiter/person/sios01&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Dr. Simon Ostermann&lt;/a&gt;&lt;br&gt;
&lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;&lt;br&gt;&lt;/p&gt;
&lt;h2 id=&#34;organization&#34;&gt;Organization&lt;/h2&gt;
&lt;p&gt;For any issues regarding the seminar, please e-mail &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt; and have &lt;code&gt;[LanguageModelsSeminar2024]&lt;/code&gt; (including the brackets) in the subject line.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;This block seminar is open to CoLi and CS students (and related courses).&lt;/li&gt;
&lt;li&gt;Depending on the study regulations, you need to register in HISPOS/LSF.&lt;/li&gt;
&lt;li&gt;CS students must have registered in HISPOS/LSF by &lt;code&gt;June 26&lt;/code&gt;! Otherwise we cannot issue a certificate (&amp;ldquo;Schein&amp;rdquo;).&lt;/li&gt;
&lt;li&gt;If you are a CS student, please use the &lt;strong&gt;&lt;a href=&#34;https://seminars.cs.uni-saarland.de/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;seminar assignment system&lt;/a&gt;&lt;/strong&gt; to register.&lt;/li&gt;
&lt;li&gt;If you are a CoLi student, please write us an email to register.&lt;/li&gt;
&lt;li&gt;Please register only if you are available at the time slot of the seminar.&lt;/li&gt;
&lt;li&gt;If you want to take the seminar but were not selected by the assignment system, please apply for the &lt;code&gt;waiting list&lt;/code&gt; by emailing us.&lt;/li&gt;
&lt;li&gt;The seminar takes place on &lt;code&gt;September 19 (Thursday) and 20 (Friday)&lt;/code&gt;, in person (10:00 sharp, DFKI, D3.2, room &lt;em&gt;Reuse&lt;/em&gt;, next to the main entrance).&lt;/li&gt;
&lt;li&gt;The seminar language is English.&lt;/li&gt;
&lt;li&gt;The seminar earns you 7 ECTS.&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;grading&#34;&gt;Grading&lt;/h3&gt;
&lt;p&gt;To pass the seminar, you have to attend all sessions and:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;give a presentation (CoLi and CS studenets, worth 3 ECTS);&lt;/li&gt;
&lt;li&gt;write reports in which you critically examine the topics in the seminar (only CS students, worth 4 ECTS);&lt;/li&gt;
&lt;li&gt;participate in discussions during the seminar;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&amp;hellip; with a passing grade.&lt;/p&gt;
&lt;p&gt;For CS students, the final grade is calculated from the weighted average.
Both CoLi and CS students have the opportunity to earn a &lt;strong&gt;bonus&lt;/strong&gt; for submitting an optional practical project. A good project can improve your final grade by 0.3 points (e.g., from 1.7 to 1.3), an excellent project can boost your grade by 0.7 points (e.g., from 2.3 to 1.7).&lt;/p&gt;
&lt;h2 id=&#34;topic-overview&#34;&gt;Topic Overview&lt;/h2&gt;
&lt;p&gt;This is a block seminar in September 2024, which will be held in cooperation between the Department of &lt;a href=&#34;https://www.dfki.de/web/forschung/forschungsbereiche/sprachtechnologie-und-multilingualitaet&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Multilingual Technologies (MLT)&lt;/a&gt; and &lt;a href=&#34;https://www.dfki.de/web/forschung/forschungsbereiche/neuro-mechanistische-modellierung&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Neuro-Mechanistic Modeling (NMM)&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;Large language models (LLMs) have swiftly become a cornerstone in AI research, capturing the attention of the public as the most accessible gateway to artificial intelligence. Despite their groundbreaking impact, LLMs are not without their imperfections. Notably, the occurrence of hallucinations and limited reasoning capabilities, particularly in specialized domains, remain significant challenges.&lt;/p&gt;
&lt;p&gt;This seminar begins by investigating the theoretical foundations of language representations, tracing the evolution of transformers and their progression towards the cutting-edge LLMs we see today. Building on this foundation, the seminar will then explore promising future directions. Special emphasis will be placed on the integration of LLMs with neuro-symbolic reasoning and the enrichment of these models through knowledge graphs and other forms of structured data.&lt;/p&gt;
&lt;h3 id=&#34;requirements&#34;&gt;Requirements&lt;/h3&gt;
&lt;p&gt;We expect no prior knowledge in language modeling. The seminar is open to CS (including related majors) and CoLi students.&lt;/p&gt;
&lt;h2 id=&#34;course-structure&#34;&gt;Course Structure&lt;/h2&gt;
&lt;h3 id=&#34;presentation&#34;&gt;Presentation&lt;/h3&gt;
&lt;p&gt;Identify the key ideas and concepts and give a self-consistent presentation explaining concepts to your
fellow students.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;The presentation should be about 20 minutes long.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Please submit your your final slides as &lt;em&gt;.pdf&lt;/em&gt; until &lt;code&gt;September 18&lt;/code&gt; (23:59, Berlin time) and have &lt;code&gt;[LanguageModelsSeminar2024] Slides Submission&lt;/code&gt; in the subject line.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Here are some suggestions for a good presentation (we will use this as a basis for grading the presentations):&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Do not try to condense all the content into 20 minutes. Find a suitable level of abstraction and determine what you think is interesting for your fellow students.&lt;/li&gt;
&lt;li&gt;Explore and include supplementary material where it seems useful (literature, youtube, GitHub, medium articles, OpenReview, etc.). The papers provided by us can be seen as a starting point.&lt;/li&gt;
&lt;li&gt;The goal is to tell a (self-consistent and entertaining) story - not to convince us that you understand the paper.&lt;/li&gt;
&lt;li&gt;Put time and effort into creating visualizations and preparing (running) examples (Please do not rely solely on paper screenshots).&lt;/li&gt;
&lt;li&gt;Prioritize concreteness, simplicity, and clarity.&lt;/li&gt;
&lt;li&gt;Focus on intuition, high-level understanding, and contextualization, not on technical details.&lt;/li&gt;
&lt;li&gt;Don&amp;rsquo;t overcrowd your slides. Try to avoid full sentences and be cautious with bullet points.&lt;/li&gt;
&lt;li&gt;Use equations only when necessary; use color-coded equations to improve their readability (&lt;a href=&#34;https://github.com/st--/annotate-equations&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;example&lt;/a&gt;).&lt;/li&gt;
&lt;li&gt;Be critical of the authors&amp;rsquo; claims, don&amp;rsquo;t fall for overselling.&lt;/li&gt;
&lt;li&gt;Use slide numbers.&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;reports&#34;&gt;Reports&lt;/h3&gt;
&lt;p&gt;Each CS student is required to write six reports on six different topics of their choosing (this can include your own topic).
Each report should be about two to four pages long.
The report should contain a short(!) summary of (what you consider to be) the main contribution or most intriguing idea of the papers. Otherwise, you can freely express your own thoughts on the topic. For instance: What did you like/dislike about the papers (both methodically and didactically)? What are connections to other seminar papers? Can you suggest improvements? What do you think is missing?&lt;/p&gt;
&lt;p&gt;You can use the &lt;a href=&#34;https://de.overleaf.com/latex/templates/neurips-2022/kxymzbjpwsqx&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Neurips&lt;/a&gt; or &lt;a href=&#34;https://de.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Springer LNCS&lt;/a&gt; Latex template or any other reasonable format (don&amp;rsquo;t write an abstract).
Please use a spell+grammar checker like &lt;a href=&#34;https://languagetool.org/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;languagetool&lt;/a&gt; or &lt;a href=&#34;https://app.grammarly.com/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;grammarly&lt;/a&gt; before submitting.
Do not let ChatGPT do the writing for you (it is horrible to read). But you can use LLMs to catch errors or improve formulations.&lt;/p&gt;
&lt;p&gt;The time required to write the reports should approximately add up to 4 CP, which translates to 20 hours of work per report (4 CP x 30 hours per CP).&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Please email the reports as a single .pdf file (with a reasonable filename) to Gerrit and Cennet and have &lt;code&gt;[LanguageModelsSeminar2024] Report Submission&lt;/code&gt; in the subject line.&lt;/strong&gt;
The report deadline is &lt;code&gt;September 28&lt;/code&gt; (23:59, Berlin time).&lt;/p&gt;
&lt;h3 id=&#34;practical-project-bonus&#34;&gt;Practical Project (Bonus)&lt;/h3&gt;
&lt;p&gt;You can submit a practical project where you apply what you learned in the seminar. The project doesn&amp;rsquo;t have to be closely related to your presentation topic but should have a loose connection to any seminar topic. If you plan to do this, please discuss it with your supervisor before September 19 and propose your idea.&lt;/p&gt;
&lt;p&gt;Practical projects previously submitted in other university courses or already published are not allowed. Plagiarism will result in expulsion. Ensure that the code is reproducible and easy to run, for example, on Colab.
Your project also needs to be well documented (e.g., by providing a tutorial notebook), and you need to disclose all the resources you used.&lt;/p&gt;
&lt;p&gt;Deadline is &lt;code&gt;October 4&lt;/code&gt; (23:59, Berlin time).
We will make all projects publically available.
&lt;strong&gt;Please email the project as a single .zip file (with a reasonable filename) to Gerrit and Cennet and have &lt;code&gt;[LanguageModelsSeminar2024] Project Submission&lt;/code&gt; in the subject line.&lt;/strong&gt;&lt;/p&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;p&gt;&lt;del&gt;Please vote for your preferred topic: &lt;strong&gt;&lt;a href=&#34;https://forms.gle/___V8rUSV9BRYgKfUKFA&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;here&lt;/a&gt;&lt;/strong&gt;.
Deadline is &lt;code&gt;May 25&lt;/code&gt;.&lt;/del&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Topic 1&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Pre-Attention Language Models&lt;/li&gt;
&lt;li&gt;Student: Mohammad Munem Shahriar&lt;/li&gt;
&lt;li&gt;Supervisor: Cennet&lt;/li&gt;
&lt;li&gt;Papers:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1409.3215&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Sequence to Sequence Learning with Neural Networks&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.jmlr.org/papers/volume3/bengio03a/bengio03a.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;A Neural Probabilistic Language Model&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1508.06615&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Character-Aware Neural Language Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://aclanthology.org/N18-1202.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Deep contextualized word representations&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 2&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Self-Attention and Transformer&lt;/li&gt;
&lt;li&gt;Student: Mayur Deshmukh&lt;/li&gt;
&lt;li&gt;Supervisor: Cennet&lt;/li&gt;
&lt;li&gt;Papers:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1902.02181&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Attention in Natural Language Processing&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1706.03762&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Attention Is All You Need&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1906.06755&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Theoretical Limitations of Self-Attention in Neural Sequence Models&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 3&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Bert and its Variants&lt;/li&gt;
&lt;li&gt;Student: Duong Nguyen&lt;/li&gt;
&lt;li&gt;Supervisor: Cennet&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1810.04805&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1907.11692&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;RoBERTa: A Robustly Optimized BERT Pretraining Approach&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1911.02116&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Unsupervised Cross-lingual Representation Learning at Scale&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 4&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Foundations of LLMs&lt;/li&gt;
&lt;li&gt;Student: -&lt;/li&gt;
&lt;li&gt;Supervisor: Cennet&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2203.02155&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Training language models to follow instructions with human feedback&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2303.08774&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;GPT-4 Technical Report&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2211.09085&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Galactica: A Large Language Model for Science&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 5&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Properties of LLMs&lt;/li&gt;
&lt;li&gt;Student: Vianney Jerry Tchouwa Takou&lt;/li&gt;
&lt;li&gt;Supervisor: Cennet&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2001.08361&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Scaling Laws for Neural Language Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2203.15556&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Training Compute-Optimal Large Language Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2005.14165&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Language Models are Few-Shot Learners&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 6&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Multimodal LLMs&lt;/li&gt;
&lt;li&gt;Student: Yannick Gansen&lt;/li&gt;
&lt;li&gt;Supervisor: Gerrit&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://proceedings.mlr.press/v32/kiros14.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Multimodal Neural Language Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2204.06125&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Hierarchical Text-Conditional Image Generation with CLIP Latents&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2304.08485&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Visual Instruction Tuning&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 7&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Evaluating LLMs&lt;/li&gt;
&lt;li&gt;Student: -&lt;/li&gt;
&lt;li&gt;Supervisor: Gerrit&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2206.04615&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2312.11539&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;KGLens: A Parameterized Knowledge Graph Solution to Assess What an LLM Does and Doesn&amp;rsquo;t Know&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2303.17548&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Whose Opinions Do Language Models Reflect?&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 8&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Foundations of Knowledge Graph Reasoning&lt;/li&gt;
&lt;li&gt;Student: Larisa Ivanova&lt;/li&gt;
&lt;li&gt;Supervisor: Gerrit&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2106.06935&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2310.04562&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Towards Foundation Models for Knowledge Graph Reasoning&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 9&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Graphs as Input&lt;/li&gt;
&lt;li&gt;Student: Cicy Kuriakose Agnes&lt;/li&gt;
&lt;li&gt;Supervisor: Gerrit&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2205.08184&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;SKILL: Structured Knowledge Infusion for Large Language Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2402.07630&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2311.13314&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Mitigating large language model hallucinations via autonomous knowledge graph-based retrofitting&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 10&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Graphs as Output&lt;/li&gt;
&lt;li&gt;Student: Mini Mariya Thomas&lt;/li&gt;
&lt;li&gt;Supervisor: Gerrit&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2308.13916&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Exploring Large Language Models for Knowledge Graph Completion&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2307.01128&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Iterative Zero-Shot LLM Prompting for Knowledge Graph Construction&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2402.15301&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Causal Graph Discovery with Retrieval-Augmented Generation based Large Language Models&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 11&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: LLM-Based Reasoning on Graphs&lt;/li&gt;
&lt;li&gt;Student: Michael Schott&lt;/li&gt;
&lt;li&gt;Supervisor: Gerrit&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2310.01061&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2401.07105&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Graph Language Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2402.01805v1&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Exploring the Limitations of Graph Reasoning in Large Language Models&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Topic 12&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Name: Learning to Prompt&lt;/li&gt;
&lt;li&gt;Student: Prakhar Kumar&lt;/li&gt;
&lt;li&gt;Supervisor: Gerrit&lt;/li&gt;
&lt;li&gt;Paper:
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2211.11890&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;TEMPERA: Test-Time Prompting via Reinforcement Learning&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2210.03629&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;ReAct: Synergizing Reasoning and Acting in Language Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2404.05449&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;RoT: Enhancing Large Language Models with Reflection on Search Trees&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;recommended-readingwatch-list&#34;&gt;Recommended Reading/Watch List&lt;/h3&gt;
&lt;h4 id=&#34;llm-primer&#34;&gt;LLM Primer&lt;/h4&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=zjkBMFhNj_g&amp;amp;ab_channel=AndrejKarpathy&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Andrej Karpathy - Intro to Large Language Models&lt;/a&gt; This is a classic.&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.promptingguide.ai/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;promptingguide&lt;/a&gt;: Nice and high-level overview on LLMs.&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=wjZofJX0v4M&amp;amp;ab_channel=3Blue1Brown&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;But what is a GPT? Visual intro to transformers - Chapter 5, Deep Learning&lt;/a&gt; See also the next chapters.&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=kCc8FmEb1nY&amp;amp;t=2081s&amp;amp;ab_channel=AndrejKarpathy&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Let&amp;rsquo;s build GPT: from scratch, in code, spelled out&lt;/a&gt; Karpathy again.&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/abs/2404.14928&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Graph Machine Learning in the Era of Large Language Models (LLMs)&lt;/a&gt; A neat review, discussing many topics relevant to this seminar.&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/rasbt/LLMs-from-scratch&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;LLMs from scratch (Sebastian Raschka)&lt;/a&gt; with &lt;a href=&#34;https://youtu.be/quh7z1q7-uc?si=7QvktIUkFHAl312e&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;video&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h4 id=&#34;project-inspirations-and-resources&#34;&gt;Project Inspirations and Resources&lt;/h4&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://huggingface.co/docs/transformers/v4.17.0/en/index&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;HuggingFace Transformers Tutorials&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/Lightning-AI/litgpt&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;⚡ LitGPT&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/stanfordnlp/dspy&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;DSPy&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/maitrix-org/llm-reasoners&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;llm-reasoners&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=IgcBuXFE6QE&amp;amp;ab_channel=AllAboutAI&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;From OpenAI to Open Source in 5 Minutes Tutorial (LM Studio + Python)&lt;/a&gt; or &lt;a href=&#34;https://medium.com/@ingridwickstevens/streaming-local-llm-responses-with-lm-studio-inference-server-cce3f78b2522&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Streaming Local LLM Responses with LM Studio Inference Server&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Project Inspirations&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://www.reddit.com/r/LocalLLaMA/comments/18se771/any_interesting_llm_project_ideas/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Interesting LLM project ideas&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://pubs.rsc.org/en/content/articlehtml/2023/dd/d3dd00113j&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;14 examples of how LLMs can transform materials science and chemistry&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/yoheinakajima/instagraph&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;instagraph&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/VinciGit00/Scrapegraph-ai&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Scrapegraph-ai&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/sfreagin/arXiv_explorer/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;arXiv_explorer&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=h_GTxRFYETY&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;LLM Finance Planer&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=a91EPM7TBX4&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;LLM powered Game&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://cloud.dify.ai/explore/apps&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Dify examle apps (requires registration)&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;!---

|     -   |    [Bayesian Flow Networks](https://arxiv.org/abs/2308.07037)    |
--&gt;
</description>
    </item>
    
    <item>
      <title>Special Topics in Deep Reinforcement Learning</title>
      <link>https://mosi.uni-saarland.de/teaching/24-s-special-topics-in-deep-rl/</link>
      <pubDate>Mon, 01 Apr 2024 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/24-s-special-topics-in-deep-rl/</guid>
      <description>&lt;h2 id=&#34;team&#34;&gt;Team&lt;/h2&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/timo-gros/&#34;&gt;Timo P. Gros&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt; (lecturers)&lt;br&gt;
&lt;a href=&#34;https://mosi.uni-saarland.de/person/joschka-gro%C3%9F/&#34;&gt;Joschka Groß&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/felix-jahn/&#34;&gt;Felix Jahn&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/nicola-muller/&#34;&gt;Nicola J. Müller&lt;/a&gt; (assistants)&lt;/p&gt;
&lt;h2 id=&#34;content&#34;&gt;Content&lt;/h2&gt;
&lt;p&gt;Reinforcement Learning (RL) is a popular sub-discipline of Machine Learning for
problems that require strategies to solve complex tasks such as board games,
scheduling problems, or other discrete optimization problems. Deep
Reinforcement Learning (DRL) is the combination of Reinforcement Learning with
Neural Networks.&lt;/p&gt;
&lt;p&gt;In this seminar, we first covered the most important algorithms of Deep
Reinforcement Learning. Afterwards, we looked at special topics that our group
is conducting research on: exploration in DRL, safe reinforcement learning,
and causal reinforcement learning.&lt;/p&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;p&gt;&lt;strong&gt;Deep Reinforcement Learning&lt;/strong&gt;&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Rainbow (&lt;a href=&#34;http://ojs.aaai.org/index.php/AAAI/article/view/11796&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;A2C &amp;amp; A3C (&lt;a href=&#34;https://arxiv.org/abs/1602.01783&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;PPO (&lt;a href=&#34;https://arxiv.org/abs/1707.06347&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Model-based RL &amp;amp; MCTS (&lt;a href=&#34;http://incompleteideas.net/book/the-book.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;book&lt;/a&gt;, especially chapters 8.1, 8.10 and 8.11; &lt;a href=&#34;https://papers.nips.cc/paper_files/paper/2010/file/edfbe1afcf9246bb0d40eb4d8027d90f-Paper.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;original MCTS paper&lt;/a&gt;; &lt;a href=&#34;http://www.incompleteideas.net/609%20dropbox/other%20readings%20and%20resources/MCTS-survey.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper with more details&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Alpha(Go) Zero (&lt;a href=&#34;https://www.nature.com/articles/nature24270&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;, &lt;a href=&#34;https://www.science.org/doi/abs/10.1126/science.aar6404&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper 2&lt;/a&gt;)&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;&lt;strong&gt;Safe Reinforcement Learning&lt;/strong&gt;&lt;/p&gt;
&lt;ol start=&#34;6&#34;&gt;
&lt;li&gt;Conservative Safety Critics for Exploration (&lt;a href=&#34;https://arxiv.org/abs/2010.14497&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Constrained Policy Optimization (&lt;a href=&#34;https://proceedings.mlr.press/v70/achiam17a&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Safe Reinforcement Learning via Shielding (&lt;a href=&#34;https://ojs.aaai.org/index.php/AAAI/article/view/11797&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;&lt;strong&gt;Causal Reinforcement Learning&lt;/strong&gt;&lt;/p&gt;
&lt;ol start=&#34;9&#34;&gt;
&lt;li&gt;Invariant Causal Prediction for Block MDP (&lt;a href=&#34;https://arxiv.org/abs/2003.06016&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Causal Reinforcement Learning Using Observational and Interventional Data (&lt;a href=&#34;https://arxiv.org/abs/2106.14421&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Can Humans Be Out of the Loop? (&lt;a href=&#34;https://proceedings.mlr.press/v177/zhang22a.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;&lt;strong&gt;Exploration Techniques&lt;/strong&gt;&lt;/p&gt;
&lt;ol start=&#34;12&#34;&gt;
&lt;li&gt;Random Network Distillation (&lt;a href=&#34;https://arxiv.org/abs/1810.12894&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;Go-Explore (&lt;a href=&#34;https://www.nature.com/articles/s41586-020-03157-9&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;paper&lt;/a&gt;)&lt;/li&gt;
&lt;/ol&gt;
&lt;h2 id=&#34;organization&#34;&gt;Organization&lt;/h2&gt;
&lt;p&gt;All information and materials are available in the
&lt;a href=&#34;https://cms.sic.saarland/stidrl24/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CMS&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Advanced Topics in Diffusion Modeling — From Theory to Implementation</title>
      <link>https://mosi.uni-saarland.de/teaching/23-w-advanced-diffusion-modeling/</link>
      <pubDate>Fri, 27 Oct 2023 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/23-w-advanced-diffusion-modeling/</guid>
      <description>&lt;h3 id=&#34;organizers&#34;&gt;Organizers&lt;/h3&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Dr. Gerrit Großmann&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;For any issues regarding the seminar, please e-mail &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt; and have
&lt;code&gt;[DeepDiffusion2023]&lt;/code&gt; in the subject line.&lt;/p&gt;
&lt;p&gt;In case you are interested in writing a thesis on this topic, please also
contact &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt;.&lt;/p&gt;
&lt;h3 id=&#34;organization&#34;&gt;Organization&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;Please use the &lt;strong&gt;&lt;a href=&#34;https://seminars.cs.uni-saarland.de/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;seminar assignment system&lt;/a&gt;&lt;/strong&gt;
to register. Please register only if you are available at the time slot.&lt;/li&gt;
&lt;li&gt;The seminar takes place Fridays from &lt;strong&gt;14:15 to 16:00&lt;/strong&gt; in &lt;strong&gt;room 1.06 (E1.1)&lt;/strong&gt;
(in-person).&lt;/li&gt;
&lt;li&gt;The kick-off meeting takes place on &lt;strong&gt;Friday, October 27&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;The seminar language is English.&lt;/li&gt;
&lt;li&gt;The seminar earns you 7 ECTS.&lt;/li&gt;
&lt;li&gt;The seminar is eligible for bachelor/master/graduate students of computer
science and related courses.&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;schedule&#34;&gt;Schedule&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Oct 27:&lt;/strong&gt; Kick-off&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Oct 30:&lt;/strong&gt; Milestone I — Send three topic preferences to Gerrit&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Nov 3:&lt;/strong&gt; No seminar&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Nov 10:&lt;/strong&gt; No seminar&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Nov 17:&lt;/strong&gt; Q&amp;amp;A session topics 1–6&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Nov 24:&lt;/strong&gt; Q&amp;amp;A session topics 7–12&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Dec 1:&lt;/strong&gt; No seminar&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Dec 8:&lt;/strong&gt; Milestone II — Submit slides + Q&amp;amp;A session topics 1–6&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Dec 15:&lt;/strong&gt; Presentation slot 1 (topics 1, 2, 4)&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Dec 22:&lt;/strong&gt; Q&amp;amp;A session topics 7–12 (can be moved)&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Jan 5:&lt;/strong&gt; Presentation slot 2 (topics 5, 6, 7)&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Jan 12:&lt;/strong&gt; Presentation slot 3 (topics 8, 9)&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Jan 19:&lt;/strong&gt; No seminar&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Jan 26:&lt;/strong&gt; Q&amp;amp;A session topics 1–6&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Feb 2:&lt;/strong&gt; Q&amp;amp;A session topics 7–12&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Feb 9:&lt;/strong&gt; Milestone III — Submit &amp;amp; present tutorial notebook&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Feb 23:&lt;/strong&gt; Milestone IV — Submit reviews&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Mar 23:&lt;/strong&gt; Milestone V — Submit final tutorial notebook&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;topic-overview&#34;&gt;Topic Overview&lt;/h3&gt;
&lt;p&gt;Diffusion models have recently transformed the field of generative deep
learning. This seminar will explore this vibrant area of research.&lt;/p&gt;
&lt;p&gt;The seminar is targeted at students who already have a background in deep
learning (theoretical and practical) and are keen to dive deeper into
probabilistic diffusion and related concepts such as stochastic processes and
normalizing flows. Experience with diffusion models will be beneficial, but not
required. While we do not aim to provide comprehensive coverage of the topic, we
have selected certain papers that we find exceptionally engaging, fun, and
thought-provoking.&lt;/p&gt;
&lt;p&gt;The seminar is equally divided into two segments: a classical part, where
students present a concept based on a research paper, and a practical part,
where students develop a tutorial notebook inspired by the ideas from that
paper.&lt;/p&gt;
&lt;h3 id=&#34;requirements&#34;&gt;Requirements&lt;/h3&gt;
&lt;p&gt;General background knowledge and practical experience in deep learning are
strongly recommended. Experience with diffusion models will be helpful but is
not necessary.&lt;/p&gt;
&lt;h3 id=&#34;grade&#34;&gt;Grade&lt;/h3&gt;
&lt;p&gt;To pass the seminar, you have to attend all sessions and:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;give a presentation;&lt;/li&gt;
&lt;li&gt;write a tutorial notebook;&lt;/li&gt;
&lt;li&gt;review three tutorials;&lt;/li&gt;
&lt;li&gt;update your tutorial notebook based on the reviews you received;&lt;/li&gt;
&lt;li&gt;participate in discussions;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&amp;hellip; with a passing grade. The final grade is based on your &lt;em&gt;presentation&lt;/em&gt;
(40%), &lt;em&gt;tutorial notebook&lt;/em&gt; (50%), and &lt;em&gt;reviews&lt;/em&gt; (10%). You will fail the whole
seminar if you receive a failing grade in any of the three parts. If we are
undecided, we will also consider the discussion participation.&lt;/p&gt;
&lt;h4 id=&#34;presentation-40&#34;&gt;Presentation (40%)&lt;/h4&gt;
&lt;p&gt;Identify the key ideas and concepts and give a self-consistent presentation
explaining these concepts to your fellow students.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;The presentation should be 15 to 20 minutes long.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Here are some suggestions for a good presentation (we will use this as a basis
for grading the presentations):&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;The goal is to tell a (self-consistent and entertaining) story — not to
convince us that you understand the paper.&lt;/li&gt;
&lt;li&gt;Put time and effort into creating visualizations and preparing (running)
examples.&lt;/li&gt;
&lt;li&gt;Prioritize concreteness, simplicity, and clarity.&lt;/li&gt;
&lt;li&gt;Focus on intuition, high-level understanding, and contextualization, not on
technical details.&lt;/li&gt;
&lt;li&gt;Don&amp;rsquo;t overcrowd your slides. Try to avoid full sentences and be cautious with
bullet points.&lt;/li&gt;
&lt;li&gt;Explore and include supplementary material where it seems useful (literature,
YouTube, GitHub, Medium articles, OpenReview, etc.).&lt;/li&gt;
&lt;li&gt;Use equations only when necessary; use color-coded equations to improve their
readability (&lt;a href=&#34;https://github.com/st--/annotate-equations&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;example&lt;/a&gt;).&lt;/li&gt;
&lt;li&gt;Be critical of the authors&amp;rsquo; claims, don&amp;rsquo;t fall for overselling.&lt;/li&gt;
&lt;li&gt;Use slide numbers.&lt;/li&gt;
&lt;li&gt;Submit your slides as &lt;code&gt;.pdf&lt;/code&gt;.&lt;/li&gt;
&lt;/ul&gt;
&lt;h4 id=&#34;tutorial-notebook-50&#34;&gt;Tutorial Notebook (50%)&lt;/h4&gt;
&lt;p&gt;Your task is to create a self-consistent tutorial within a Jupyter Notebook that
elucidates the key concepts of the selected paper through code examples. The
scope of this project may vary depending on the complexity of the paper. A
complete re-implementation may be achievable or it may be more appropriate to
concentrate on a small toy problem focusing on a single concept. The Notebook
should be well-structured, containing text and figures that clarify the
concepts, as well as well-documented code. For guidance and inspiration, you
may refer to projects like the
&lt;a href=&#34;https://huggingface.co/blog/annotated-diffusion&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Annotated Diffusion Model&lt;/a&gt;
and the &lt;a href=&#34;https://volkamerlab.org/projects/teachopencadd/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;TeachOpenCADD&lt;/a&gt;
platform, for instance,
&lt;a href=&#34;https://github.com/volkamerlab/teachopencadd/blob/master/teachopencadd/talktorials/T036_e3_equivariant_gnn/talktorial.ipynb&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;E(3)-invariant Graph Neural Networks&lt;/a&gt;.
In addition, you can check out the
&lt;a href=&#34;https://medium.com/stanford-cs224w&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Stanford CS224W Graph ML Tutorials&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Formalities:&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;The tutorial notebook should run on Google Colab and utilize PyTorch.&lt;/li&gt;
&lt;li&gt;We will invite each student to explain their code in an individual meeting.
You should be able to explain the code in detail and justify design choices.&lt;/li&gt;
&lt;li&gt;Submit by uploading to MS Teams with naming scheme
&lt;code&gt;Topic03_Grossmann_GeometricLatentDiffusionModelsFor3DMoleculeGeneration.ipynb&lt;/code&gt;.&lt;/li&gt;
&lt;li&gt;You can download external data (weights, training data) from within your
notebook.&lt;/li&gt;
&lt;li&gt;Plagiarism will get you expelled from the seminar and potentially
exmatriculated. However, you can discuss solutions with your fellow students
and take inspiration from open-source implementations.&lt;/li&gt;
&lt;li&gt;You can also copy&amp;amp;paste small code snippets if they are clearly indicated.&lt;/li&gt;
&lt;li&gt;Comment your code extensively and assign proper names to your functions,
variables, and classes.&lt;/li&gt;
&lt;li&gt;Ensure to set seeds to make your code deterministic, and remember to save the
final weights for reproducibility.&lt;/li&gt;
&lt;li&gt;Include the URL of the original paper, your name, and any external resources
you use.&lt;/li&gt;
&lt;li&gt;The notebooks will be made publicly available.&lt;/li&gt;
&lt;li&gt;The presentation of your notebook should take about 5 minutes.&lt;/li&gt;
&lt;li&gt;The deadline for submissions is 23:59 local time.&lt;/li&gt;
&lt;/ul&gt;
&lt;h4 id=&#34;reviews-10&#34;&gt;Reviews (10%)&lt;/h4&gt;
&lt;p&gt;We will assign three tutorial notebooks to each student to review. The primary
objective of this review is to offer suggestions for enhancements and to
identify any potential mistakes or ambiguities, whether they be technical,
conceptual, or grammatical in nature. Each review should be approximately one to
two pages in length and must be sent to the author and Gerrit via email.&lt;/p&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;table&gt;
  &lt;thead&gt;
      &lt;tr&gt;
          &lt;th&gt;Topic&lt;/th&gt;
          &lt;th&gt;Student&lt;/th&gt;
          &lt;th&gt;Paper&lt;/th&gt;
      &lt;/tr&gt;
  &lt;/thead&gt;
  &lt;tbody&gt;
      &lt;tr&gt;
          &lt;td&gt;1&lt;/td&gt;
          &lt;td&gt;Salaheldin Y. A. Mohamed&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/2107.03006&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Structured Denoising Diffusion Models in Discrete State-Spaces&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;2&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://openreview.net/forum?id=vn9O1N5ZOw&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modeling&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;3&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://proceedings.mlr.press/v202/xu23n.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Geometric Latent Diffusion Models for 3D Molecule Generation&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;4&lt;/td&gt;
          &lt;td&gt;Bartłomiej Pogodziński&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/2303.01469&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Consistency Models&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;5&lt;/td&gt;
          &lt;td&gt;Akansh Maurya&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://openaccess.thecvf.com/content/CVPR2023/papers/Chen_TrojDiff_Trojan_Attacks_on_Diffusion_Models_With_Diverse_Targets_CVPR_2023_paper.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;TrojDiff: Trojan Attacks on Diffusion Models with Diverse Targets&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;6&lt;/td&gt;
          &lt;td&gt;Davronbek Islamov&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2305.13301.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Training Diffusion Models with Reinforcement Learning&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;7&lt;/td&gt;
          &lt;td&gt;Yasin Esfandiari&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://openreview.net/forum?id=7wJsa3Vgz7&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Graphically Structured Diffusion Models&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;8&lt;/td&gt;
          &lt;td&gt;Soumava Paul&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://openreview.net/forum?id=4PJUBT9f2Ol&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Generative Modelling with Inverse Heat Dissipation&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;9&lt;/td&gt;
          &lt;td&gt;Monseej Purkayastha&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/2208.09392&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Cold Diffusion: Inverting Arbitrary Image Transforms Without Noise&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;10&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2306.15030.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Equivariant flow matching&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;11&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://openreview.net/forum?id=5JdLZg346Lw&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Generative Modeling with Optimal Transport Maps&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;12&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/2302.00482&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Improving and Generalizing Flow-Based Generative Models with Minibatch Optimal Transport&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
  &lt;/tbody&gt;
&lt;/table&gt;
&lt;h4 id=&#34;recommended-reading-list&#34;&gt;Recommended Reading List&lt;/h4&gt;
&lt;p&gt;The campus library will provide a semester reserve featuring
&lt;a href=&#34;https://probml.github.io/pml-book/book2.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Probabilistic Machine Learning: Advanced Topics&lt;/a&gt;
and &lt;a href=&#34;https://www.manning.com/books/deep-learning-with-pytorch&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Deep Learning with PyTorch: Build, train, and tune neural networks using Python tools&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;Otherwise, we recommend:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;A:&lt;/strong&gt; &lt;a href=&#34;https://www.youtube.com/watch?v=yTAMrHVG1ew&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Diffusion models explained in 4-difficulty levels&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;B:&lt;/strong&gt; &lt;a href=&#34;https://www.youtube.com/watch?v=1CIpzeNxIhU&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;How AI Image Generators Work (Stable Diffusion / Dall-E) — Computerphile&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;C:&lt;/strong&gt; &lt;a href=&#34;https://www.youtube.com/watch?v=fbLgFrlTnGU&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;What are Diffusion Models?&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;D:&lt;/strong&gt; &lt;a href=&#34;https://theaisummer.com/diffusion-models/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;How diffusion models work: the math from scratch&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;E:&lt;/strong&gt; &lt;a href=&#34;https://huggingface.co/blog/annotated-diffusion&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;The Annotated Diffusion Model&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;F:&lt;/strong&gt; &lt;a href=&#34;https://www.youtube.com/watch?v=cS6JQpEY9cs&amp;amp;t=5016s&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CVPR 2022 Tutorial: Denoising Diffusion-based Generative Modeling: Foundations and Applications&lt;/a&gt;
For the implementation, we also recommend:&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;strong&gt;G:&lt;/strong&gt; &lt;a href=&#34;https://github.com/huggingface/diffusion-models-class&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Hugging Face Diffusion Model Class&lt;/a&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;/ul&gt;
</description>
    </item>
    
    <item>
      <title>AI for the Social Good</title>
      <link>https://mosi.uni-saarland.de/teaching/23-s-ai-for-social-good/</link>
      <pubDate>Fri, 21 Apr 2023 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/23-s-ai-for-social-good/</guid>
      <description>&lt;h3 id=&#34;organizers&#34;&gt;Organizers&lt;/h3&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Dr. Gerrit Großmann&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/lisa-dargasz/&#34;&gt;Lisa Dargasz&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/kevin-baum/&#34;&gt;Kevin Baum&lt;/a&gt;,
&lt;a href=&#34;https://depend.cs.uni-saarland.de/~sterz/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Sarah Sterz&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Verena Wolf&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;Please use the &lt;a href=&#34;https://seminars.cs.uni-saarland.de/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;seminar assignment system&lt;/a&gt;
to register. You can also email us to register for the &lt;strong&gt;waiting list&lt;/strong&gt;.&lt;/p&gt;
&lt;p&gt;For any issues regarding the seminar, please e-mail &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt; and have
&lt;code&gt;[SocialGoodSeminar]&lt;/code&gt; in the subject line.&lt;/p&gt;
&lt;p&gt;The kick-off meeting will be on &lt;strong&gt;Friday, April 21, at 2 PM (sharp)&lt;/strong&gt; (this
is also the time slot of the seminar during the semester).&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Update:&lt;/strong&gt; The 2023 edition has come to an end. We were privileged to witness
the development of three inspiring projects:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;Safe Streets:&lt;/strong&gt; A pedestrian navigation system designed to prioritize safe
routes.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Disaster Tweet:&lt;/strong&gt; A web interface / browser plugin that identifies tweets
referencing authentic natural or man-made disasters.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Simple English:&lt;/strong&gt; A browser plugin that generates summaries of website
content in straightforward, easy-to-understand English.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;We would like to thank all participating students for their enthusiasm and
dedication throughout the seminar.&lt;/p&gt;
&lt;h3 id=&#34;topic-overview&#34;&gt;Topic Overview&lt;/h3&gt;
&lt;p&gt;Are you an AI enthusiast eager to make a real difference beyond just theoretical
knowledge? Do you aspire to use the latest AI technologies to tackle some of
humanity&amp;rsquo;s most pressing issues and make the world a better place? If so, we
invite you to join us for &amp;ldquo;AI for the Social Good&amp;rdquo;.&lt;/p&gt;
&lt;p&gt;Our goal is to equip you with both theoretical and practical knowledge to
create AI solutions to real-world problems. You&amp;rsquo;ll have the opportunity to
collaborate with other participants in a hands-on project to make a difference
in your community or the world at large.&lt;/p&gt;
&lt;h3 id=&#34;organization&#34;&gt;Organization&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;The seminar will take place in person.&lt;/li&gt;
&lt;li&gt;The seminar language is English.&lt;/li&gt;
&lt;li&gt;The seminar earns you 7 ECTS.&lt;/li&gt;
&lt;li&gt;The seminar is eligible for bachelor/master/graduate students (of computer
science and related courses).&lt;/li&gt;
&lt;li&gt;Registration/unregistration in HISPOS/LSF is due by &lt;strong&gt;May 12&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;We will meet in &lt;strong&gt;room 1.06 (E1.1)&lt;/strong&gt;.&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;how-to-pass&#34;&gt;How to Pass&lt;/h3&gt;
&lt;p&gt;In order to pass the seminar, you need to:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Pass all milestones.&lt;/li&gt;
&lt;li&gt;Attend all sessions.&lt;/li&gt;
&lt;li&gt;Read papers from the compulsory reading list (resp. watch videos).&lt;/li&gt;
&lt;li&gt;Actively contribute to the group work.&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;schedule&#34;&gt;Schedule&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;April 21:&lt;/strong&gt; Kick-off meeting and group assignment.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;May 5:&lt;/strong&gt; Lecture by Sarah Sterz.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;May 9 (Tuesday!):&lt;/strong&gt; Guest lecture &lt;em&gt;Collected for Profit, Repurposed for
Social Good: What Advertising Data Reveals About Society&lt;/em&gt; by &lt;a href=&#34;https://ingmarweber.de/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Ingmar Weber&lt;/a&gt;, 14:15 – 16:00, in
lecture hall &lt;strong&gt;003 (E1.3)&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;May 12:&lt;/strong&gt; In Milestone I, we have a pitch meeting where each group presents
three project ideas (we will choose one project to proceed with).&lt;/li&gt;
&lt;li&gt;No lecture on May 19 and May 26.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;June 2:&lt;/strong&gt; Informal meeting to discuss Milestone II.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;June 9:&lt;/strong&gt; In Milestone II, each group shows the current status of their
projects.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;June 16, June 30, July 14:&lt;/strong&gt; Informal meetings to discuss technical details.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;July 21:&lt;/strong&gt; In Milestone III, each group gives a final presentation on their
project.&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;July 28:&lt;/strong&gt; In Milestone IV, each group submits a final report.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;On Fridays without a Milestone, you will either meet with your supervisor, or we
will have a guest lecture, or there will be no meeting at all.&lt;/p&gt;
&lt;h3 id=&#34;grading&#34;&gt;Grading&lt;/h3&gt;
&lt;p&gt;Each student will receive an individual grade. Grading is based on the work of
the group (e.g., how suitable are the project ideas) and the work of the student
within the group (e.g., indicated by group discussions or GitLab contributions).
More specific requirements and evaluation criteria are listed below for each
Milestone.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Milestone I — Coming up with project ideas:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Every group is expected to come up with three project ideas. We will pick one of
these for the group to proceed. Your task is to pitch these project ideas and
convince us they all fulfill the requirements.&lt;/p&gt;
&lt;p&gt;For once, each project should be &amp;ldquo;socially good&amp;rdquo; in a reasonable sense. That is,
it can likely be used to prospectively impact society (or a subset of society)
in a positive and meaningful way. Moreover, each project should be related to
artificial intelligence, deep learning, or data science. That is, you work with
data that you find, create or collect, and you infer knowledge from this data.&lt;/p&gt;
&lt;p&gt;Your project idea does not have to be completely novel. You can also extend or
improve an existing project, provide an open-source alternative to a commercial
product, or adapt an existing project to specific challenges.&lt;/p&gt;
&lt;p&gt;In the pitch meeting, you should be able to answer the questions:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Where does the data come from, and what do you want to do with it?&lt;/li&gt;
&lt;li&gt;What is the (degree of) novelty?&lt;/li&gt;
&lt;li&gt;Do you contribute to an existing project or do something new?&lt;/li&gt;
&lt;li&gt;What similar projects can you learn from, and what is the most relevant
scientific literature?&lt;/li&gt;
&lt;li&gt;What resources do you need from us? (compute resources, robots, licenses, etc.)&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The presentation should be around 5 minutes per project.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Milestone II — Finalizing your strategy:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Milestone II should fall into the period where you have finalized your ideas and
start implementing your project. Ideally, you can already present a prototype
implementation or solution to a toy problem. The presentation allows you to
receive some last-minute feedback and critique before completely committing to
your plan. You should be able to answer the questions:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;What is your concrete plan to finish the project?&lt;/li&gt;
&lt;li&gt;What have you identified as the main challenges?&lt;/li&gt;
&lt;li&gt;Where do you need further input?&lt;/li&gt;
&lt;li&gt;What ethical concerns do you already have?&lt;/li&gt;
&lt;li&gt;How do you plan to finish the project in the given time interval?&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The presentation should be around 10 minutes.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Milestone III — Present your results:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Milestone III is the final presentation at the end of the semester that rounds
up everything: What have you done? What did work, and what did not? Was your
project an overall success or failure? What have you learned, and what would you
do differently next time? The presentation should be around 20 minutes.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Milestone IV — Reflect on your impact and contextualize your project:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Milestone IV consists of a group submission and an individual submission.&lt;/p&gt;
&lt;p&gt;In the 5–10 pages group report, you should&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;provide a detailed technical description of what you did, and&lt;/li&gt;
&lt;li&gt;judge your project from an ethical point of view: Is it actually social good?
In which sense of social good? Can it be misused? You can use the compulsory
reading list as guidance.&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;In addition, all participants must turn in an individual report (roughly one
page) on their own explaining what work they did in the project and what they
learned. You can also provide overall feedback on the seminar.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Workload:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;You will receive seven credit points (CP) for the seminar. Each CP corresponds
to a workload of 30 hours. To give you a rough idea of our expectations, we
suggest the following time management: Spend 1–2 CP (30–60 hours) on the
project proposals, 3–5 CP (90–150 hours) on the actual implementation and
attendance, and 1 CP (30 hours) on the final report and the presentations.&lt;/p&gt;
&lt;h3 id=&#34;resources&#34;&gt;Resources&lt;/h3&gt;
&lt;p&gt;&lt;strong&gt;Compulsory reading/watch list:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Everybody has to read/watch at least three papers/videos. In each group, each
paper/video must be read/watched by at least one person. Do this before
Milestone II.&lt;/p&gt;
&lt;p&gt;Texts:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://towardsdatascience.com/artificial-intelligence-fairness-and-tradeoffs-ce11ac284b63&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;A primer on AI fairness — What it is and the tradeoffs to be made&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://link.springer.com/article/10.1007/s11948-020-00213-5&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;How to Design AI for Social Good: Seven Essential Factors&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.nature.com/articles/s42256-021-00296-0&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;A definition, benchmark and database of AI for social good initiatives&lt;/a&gt;
(pdf also available &lt;a href=&#34;https://www.researchgate.net/profile/Luciano-Floridi/publication/349398901_A_Definition_Benchmark_and_Database_of_AI_for_Social_Good_Initiatives/links/60e6a594b8c0d5588cdf23df/A-Definition-Benchmark-and-Database-of-AI-for-Social-Good-Initiatives.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;here&lt;/a&gt;)&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.acm.org/code-of-ethics&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;ACM Code of ethics&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Videos:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=tMR1xBWxHFw&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;AI for Social Good (5:36 min)&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=_DmTqaFYmgQ&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Session #1: Is AI a Force For Good?&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=A-gviKiS7ZE&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Powering Good: Leveraging AI for Social Good&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Further optional reading:&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://link.springer.com/article/10.1007/s11023-020-09517-8&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;The Ethics of AI Ethics: An Evaluation of Guidelines&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://plato.stanford.edu/entries/computing-responsibility/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Computing and Moral Responsibility&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Example datasets:&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://data.europa.eu/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;EU Data&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.who.int/data/collections&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;WHO&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.planet.com&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Planet.com&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.kaggle.com/datasets&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Kaggle&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.freecodecamp.org/news/https-medium-freecodecamp-org-best-free-open-data-sources-anyone-can-use-a65b514b0f2d/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;FreeCodeCamp List&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://meaningfulcode.org/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Meaningfulcode&lt;/a&gt; and the
&lt;a href=&#34;https://towardsdatascience.com/make-a-social-impact-by-contributing-to-these-open-source-projects-1d6d34e2b8b1&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;open source projects list on Towardsdatascience&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/TechforgoodCAST/awesome-techforgood&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Awesome tech for good&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Recall that you can always collect/label your own datasets.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Example projects and ideas:&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/KaiDMML/FakeNewsNet&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;FakeNewsNet&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.intel.com/content/www/us/en/artificial-intelligence/hoobox.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;The Wheelie&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/dssg/baltimore_roofs_public&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Finding Roof Damage in Baltimore City&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.correlaid.org/en/projects/2020-11-mar/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Data visualizations to bring attention to illegal pushback&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/Liquid-Prep&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Liquid Prep offers an end-to-end solution for farmers who want to optimize their water usage&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://files.osf.io/v1/resources/ywdnq/providers/osfstorage/63f7623c40cecd018576e050?action=download&amp;amp;direct&amp;amp;version=1&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Holocaust Memorials Reduce Xenophobic Voting&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.datasciencecentral.com/can-gerrymandering-be-ended-via-data-science-algorithms/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Can Gerrymandering Be Ended via Machine Learning?&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.solveforgood.org/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;SolveForGood.com&lt;/a&gt; offers many interesting
projects like &lt;a href=&#34;https://www.solveforgood.org/proj/55/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;reducing crop burning&lt;/a&gt;,
&lt;a href=&#34;https://www.solveforgood.org/proj/54/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;fighting Nigeria&amp;rsquo;s increasing maternal mortality rate&lt;/a&gt;,
and &lt;a href=&#34;https://www.solveforgood.org/proj/25/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;mitigating eviction risk&lt;/a&gt;.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Additionally, &lt;a href=&#34;https://www.correlaid.org/en/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;correlaid&lt;/a&gt;, the
&lt;a href=&#34;https://github.com/orgs/dssg/repositories&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;DSSG repo list&lt;/a&gt;, and
&lt;a href=&#34;https://www.datakind.org/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;datakind&lt;/a&gt; might provide useful ideas. We also
suggest that you draw on your own life experience for inspiration.&lt;/p&gt;
&lt;p&gt;Image credit: &lt;a href=&#34;https://www.pexels.com/de-de/foto/erde-erkundung-fliegen-luftaufnahme-60132/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;SpaceX&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Deep Generative Diffusion Models</title>
      <link>https://mosi.uni-saarland.de/teaching/22-w-deep-generative-diffusion-models/</link>
      <pubDate>Mon, 09 Jan 2023 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/22-w-deep-generative-diffusion-models/</guid>
      <description>&lt;p&gt;For any issues regarding the seminar, please e-mail &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt; and have
&lt;code&gt;[DeepDiffusion]&lt;/code&gt; in the subject line.&lt;/p&gt;
&lt;h3 id=&#34;organizers&#34;&gt;Organizers&lt;/h3&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/michael-backenkohler/&#34;&gt;Dr. Michael Backenköhler&lt;/a&gt;.&lt;/p&gt;
&lt;h3 id=&#34;organization&#34;&gt;Organization&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;The kick-off meeting takes place on &lt;strong&gt;Monday, January 9, 14:15&lt;/strong&gt; in room 328
(E 1.3). Send three topic preferences (unordered) by Friday 23:59 to Gerrit.&lt;/li&gt;
&lt;li&gt;This seminar takes place on &lt;strong&gt;March 6 and 7, 2023&lt;/strong&gt; in &lt;strong&gt;room 1.06 (E1.1)&lt;/strong&gt;
(we start at 9:30!).&lt;/li&gt;
&lt;li&gt;The seminar will take place in-person.&lt;/li&gt;
&lt;li&gt;The seminar language is English.&lt;/li&gt;
&lt;li&gt;The seminar earns you 7 ECTS.&lt;/li&gt;
&lt;li&gt;The seminar is eligible for bachelor/master/graduate students of computer
science and related courses.&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;topic-overview&#34;&gt;Topic Overview&lt;/h3&gt;
&lt;p&gt;Diffusion models are a powerful machine learning tool and a thriving area of
research. They enable the generation of new samples with extraordinary and
unprecedented quality. This seminar explores the theoretical foundations rooted
in the theory of stochastic processes and explores their potential in various
domains.&lt;/p&gt;
&lt;h3 id=&#34;requirements&#34;&gt;Requirements&lt;/h3&gt;
&lt;p&gt;General background knowledge in deep learning is recommended.&lt;/p&gt;
&lt;h3 id=&#34;grade&#34;&gt;Grade&lt;/h3&gt;
&lt;p&gt;To pass the seminar, you have to:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;attend both sessions;&lt;/li&gt;
&lt;li&gt;give a presentation (with a passing grade);&lt;/li&gt;
&lt;li&gt;give an ungraded mock presentation;&lt;/li&gt;
&lt;li&gt;participate in discussions;&lt;/li&gt;
&lt;li&gt;submit reports (with a passing grade);&lt;/li&gt;
&lt;li&gt;read the papers and watch the videos on the &lt;em&gt;Compulsory Reading List&lt;/em&gt;;&lt;/li&gt;
&lt;li&gt;pass the practical project.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The final grade consists of: your &lt;em&gt;presentation&lt;/em&gt; (50%), &lt;em&gt;reports&lt;/em&gt; (35%), and
participation during the &lt;em&gt;seminar discussions&lt;/em&gt; (15%). The practical project can
be failed or passed. Extraordinary submissions will earn you a bonus on your
final grade.&lt;/p&gt;
&lt;h4 id=&#34;presentation-50&#34;&gt;Presentation (50%)&lt;/h4&gt;
&lt;p&gt;Identify the key ideas and concepts and give a self-consistent presentation
explaining these concepts to your fellow students.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;The presentation should be about 20 minutes long (no longer than 25 minutes!).&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Here are some suggestions for a good presentation (we will use this as a basis
for grading the presentations):&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;The goal is to tell a (self-consistent and entertaining) story — not to
convince us that you understand the paper.&lt;/li&gt;
&lt;li&gt;Put time and effort into creating visualizations and preparing (running)
examples.&lt;/li&gt;
&lt;li&gt;Prioritize concreteness, simplicity, and clarity.&lt;/li&gt;
&lt;li&gt;Focus on intuition, high-level understanding, and contextualization, not on
technical details.&lt;/li&gt;
&lt;li&gt;Don&amp;rsquo;t overcrowd your slides. Try to avoid full sentences and be cautious with
bullet points.&lt;/li&gt;
&lt;li&gt;Explore and include supplementary material where it seems useful (literature,
YouTube, GitHub, Medium articles, OpenReview, etc.).&lt;/li&gt;
&lt;li&gt;Use equations only when necessary; use color-coded equations to improve their
readability (&lt;a href=&#34;https://github.com/st--/annotate-equations&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;example&lt;/a&gt;).&lt;/li&gt;
&lt;li&gt;Be critical of the authors&amp;rsquo; claims, don&amp;rsquo;t fall for overselling.&lt;/li&gt;
&lt;li&gt;Use slide numbers.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Send the first draft of your slides as a &lt;code&gt;.pdf&lt;/code&gt; file to your supervisor
&lt;strong&gt;7 days&lt;/strong&gt; before the presentation.&lt;/p&gt;
&lt;p&gt;You will also be required to give an ungraded &lt;strong&gt;mock presentation&lt;/strong&gt; in your
group (see topic list) by March 5.&lt;/p&gt;
&lt;h4 id=&#34;reports-35&#34;&gt;Reports (35%)&lt;/h4&gt;
&lt;p&gt;Every participant has to write three short reports (two to four pages each).
You can choose freely from the twelve topics (you may also choose your own
topic). The report should contain a short summary of (what you consider to be)
the main contribution or most intriguing idea of the paper. Otherwise, you can
freely express your own thoughts on the topic. For instance: What did you
like/dislike about the paper (both methodically and didactically)? What are
connections to other seminar papers? Can you suggest improvements? What do you
think is missing?&lt;/p&gt;
&lt;p&gt;The report deadline is &lt;strong&gt;14 days&lt;/strong&gt; after the last presentation (&lt;strong&gt;March 21,
23:59&lt;/strong&gt;). You can use the
&lt;a href=&#34;https://de.overleaf.com/latex/templates/neurips-2022/kxymzbjpwsqx&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;NeurIPS&lt;/a&gt;
template (activate the preprint flag) or any other reasonable format (don&amp;rsquo;t
write an abstract). Please use a spell+grammar checker like
&lt;a href=&#34;https://languagetool.org/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;LanguageTool&lt;/a&gt; or
&lt;a href=&#34;https://app.grammarly.com/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Grammarly&lt;/a&gt; before submitting.&lt;/p&gt;
&lt;h4 id=&#34;discussions-15&#34;&gt;Discussions (15%)&lt;/h4&gt;
&lt;p&gt;Read each presented paper in advance (of course, we do not expect you to
understand them entirely) and actively participate in the discussion.&lt;/p&gt;
&lt;h4 id=&#34;practical-project-failpassbonus&#34;&gt;Practical Project (fail/pass/bonus)&lt;/h4&gt;
&lt;p&gt;You can work on the project alone or in groups of two. The deadline is
&lt;strong&gt;28 days&lt;/strong&gt; after the last presentation (&lt;strong&gt;April 11, 23:59&lt;/strong&gt;).
Specifications are &lt;a href=&#34;https://github.com/gerritgr/pokemon_diffusion&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;here&lt;/a&gt;.&lt;/p&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;h4 id=&#34;compulsory-reading-list&#34;&gt;Compulsory Reading List&lt;/h4&gt;
&lt;ul&gt;
&lt;li&gt;&lt;strong&gt;A:&lt;/strong&gt; &lt;a href=&#34;https://www.youtube.com/watch?v=yTAMrHVG1ew&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Diffusion models explained in 4-difficulty levels&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;B:&lt;/strong&gt; &lt;a href=&#34;https://www.youtube.com/watch?v=1CIpzeNxIhU&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;How AI Image Generators Work (Stable Diffusion / Dall-E) — Computerphile&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;C:&lt;/strong&gt; &lt;a href=&#34;https://www.youtube.com/watch?v=fbLgFrlTnGU&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;What are Diffusion Models?&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;D:&lt;/strong&gt; (optional) &lt;a href=&#34;https://theaisummer.com/diffusion-models/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;How diffusion models work: the math from scratch&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;E:&lt;/strong&gt; (optional) &lt;a href=&#34;https://huggingface.co/blog/annotated-diffusion&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;The Annotated Diffusion Model&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;F:&lt;/strong&gt; (optional) &lt;a href=&#34;https://www.youtube.com/watch?v=cS6JQpEY9cs&amp;amp;t=5016s&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CVPR 2022 Tutorial: Denoising Diffusion-based Generative Modeling: Foundations and Applications&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h4 id=&#34;monday-march-6-2023&#34;&gt;Monday (March 6, 2023)&lt;/h4&gt;
&lt;table&gt;
  &lt;thead&gt;
      &lt;tr&gt;
          &lt;th&gt;Student (Group, Supervisor)&lt;/th&gt;
          &lt;th&gt;Topic&lt;/th&gt;
          &lt;th&gt;Additional Material&lt;/th&gt;
      &lt;/tr&gt;
  &lt;/thead&gt;
  &lt;tbody&gt;
      &lt;tr&gt;
          &lt;td&gt;Maryam Meghdadi Esfahani (1, GG)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://proceedings.neurips.cc/paper/2019/file/3001ef257407d5a371a96dcd947c7d93-Paper.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Generative Modeling by Estimating Gradients of the Data Distribution (2019)&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;[1,2,3]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;Mohammad Sadegh Akhondzadeh (2, MB)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2003.00638.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Permutation Invariant Graph Generation via Score-Based Generative Modeling (2020)&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;[1,2,7,8]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;Jorge Augusto Calvimontes Robles (3, GG)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2006.11239.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Denoising Diffusion Probabilistic Models (2020)&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;[4,5,6]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;Devikalyan Das (1, MB)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2011.13456.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Score-Based Generative Modeling through Stochastic Differential Equations (2021)&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;[1,2,7,F]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;Lisa Dargasz (3, GG)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://openaccess.thecvf.com/content/CVPR2022/papers/Rombach_High-Resolution_Image_Synthesis_With_Latent_Diffusion_Models_CVPR_2022_paper.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;High-resolution image synthesis with latent diffusion models (2022)&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;[10,11,12,F]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;Simone Antonelli (4, MB)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2203.17003.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Equivariant diffusion for molecule generation in 3D (2022)&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;[17,26,27]&lt;/td&gt;
      &lt;/tr&gt;
  &lt;/tbody&gt;
&lt;/table&gt;
&lt;h4 id=&#34;tuesday-march-7-2023&#34;&gt;Tuesday (March 7, 2023)&lt;/h4&gt;
&lt;table&gt;
  &lt;thead&gt;
      &lt;tr&gt;
          &lt;th&gt;Student (Group, Supervisor)&lt;/th&gt;
          &lt;th&gt;Topic&lt;/th&gt;
          &lt;th&gt;Additional Material&lt;/th&gt;
      &lt;/tr&gt;
  &lt;/thead&gt;
  &lt;tbody&gt;
      &lt;tr&gt;
          &lt;td&gt;&lt;del&gt;Advait Ganesh Athreya (2, GG)&lt;/del&gt;&lt;/td&gt;
          &lt;td&gt;&lt;del&gt;&lt;a href=&#34;https://arxiv.org/pdf/2209.14734.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;DiGress: Discrete Denoising diffusion for graph generation (2022)&lt;/a&gt;&lt;/del&gt;&lt;/td&gt;
          &lt;td&gt;[7,13,14]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;Simon Graf (2, MB)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/2210.13695&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Structure-based Drug Design with Equivariant Diffusion Models (2022)&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;[15,16,17,18]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;Tim Valentin Kruse (4, GG)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2104.03670.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;3D Shape Generation and Completion through Point-Voxel Diffusion (2022)&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;[19,20]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;&lt;del&gt;Vikram Singh (4, MB)&lt;/del&gt;&lt;/td&gt;
          &lt;td&gt;&lt;del&gt;&lt;a href=&#34;https://arxiv.org/pdf/2206.04119.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Diffusion probabilistic modeling of protein backbones in 3D for the motif-scaffolding problem (2022)&lt;/a&gt;&lt;/del&gt;&lt;/td&gt;
          &lt;td&gt;[17,21,22,23]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;Shreyash Arya (3, GG)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2209.14792.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Make-A-Video: Text-to-Video Generation without Text-Video Data (2022)&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;[10,12,24,25]&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;&lt;del&gt;Hamayoon Behmanush (1, MB)&lt;/del&gt;&lt;/td&gt;
          &lt;td&gt;&lt;del&gt;&lt;a href=&#34;https://arxiv.org/pdf/2211.15089.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Continuous diffusion for categorical data (2022)&lt;/a&gt;&lt;/del&gt;&lt;/td&gt;
          &lt;td&gt;[2,27,28]&lt;/td&gt;
      &lt;/tr&gt;
  &lt;/tbody&gt;
&lt;/table&gt;
&lt;p&gt;The group is only relevant for the mock presentation. Your supervisors are
either &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt; (GG) or
&lt;a href=&#34;https://mosi.uni-saarland.de/person/michael-backenkohler/&#34;&gt;Michael Backenköhler&lt;/a&gt; (MB).&lt;/p&gt;
&lt;h4 id=&#34;supplementary-material&#34;&gt;Supplementary Material&lt;/h4&gt;
&lt;p&gt;A non-exhaustive list of supplemental materials that we think might be helpful
to you is provided here. We encourage you to seek and consult additional
resources.&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;&lt;a href=&#34;https://ericmjl.github.io/score-models/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;A Pedagogical Introduction to Score Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://yang-song.net/blog/2021/score/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Generative Modeling by Estimating Gradients of the Data Distribution&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://proceedings.neurips.cc/paper/2020/file/92c3b916311a5517d9290576e3ea37ad-Paper.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Improved Techniques for Training Score-Based Generative Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://proceedings.mlr.press/v139/nichol21a/nichol21a.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Improved Denoising Diffusion Probabilistic Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://proceedings.neurips.cc/paper/2021/file/49ad23d1ec9fa4bd8d77d02681df5cfa-Paper.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Diffusion Models Beat GANs on Image Synthesis&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=y7J6sSO1k50&amp;amp;t=4605s&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Ultimate Guide to Diffusion Models — ML Coding Series&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://distill.pub/2021/gnn-intro/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;A Gentle Introduction to Graph Neural Networks&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=UdZ4IL3ESAI&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://people.smp.uq.edu.au/DirkKroese/mccourse.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Monte Carlo Methods (Chapter 4, Random Process Generation)&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://link.springer.com/content/pdf/10.1007/978-3-319-24574-4_28.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;U-Net: Convolutional Networks for Biomedical Image Segmentation&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=ltLNYA3lWAQ&amp;amp;t=2393s&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Stable Diffusion — What, Why, How?&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;http://proceedings.mlr.press/v139/radford21a&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Learning Transferable Visual Models From Natural Language Supervision (CLIP)&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=k2saMtP-Fn8&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;DiGress: Discrete Denoising Diffusion for Graph Generation — Clément Vignac&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2012.09699.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;A Generalization of Transformer Networks to Graphs&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://projects.volkamerlab.org/teachopencadd/talktorials/T015_protein_ligand_docking.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;T015 — Protein-ligand docking&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=yCRBZ5kjSmI&amp;amp;t=1190s&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Exploiting Symmetries in Inference and Learning&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/volkamerlab/teachopencadd/blob/jg-034-e3-equivariant-gnn/teachopencadd/talktorials/T037_e3_equivariant_gnn/talktorial.ipynb&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;An introduction to E(3)-invariant graph neural networks&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2205.07249.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Pocket2Mol: Efficient Molecular Sampling Based on 3D Protein Pockets&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://alexzhou907.github.io/pvd&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Point-Voxel Diffusion Project Website&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1907.03739.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Point-Voxel CNN for Efficient 3D Deep Learning&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=hok2hyED9go&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Protein Structure and Folding&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=UymQ-iE23MY&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Diffusion probabilistic modelling of protein backbones in 3D — Jason Yim &amp;amp; Brian Trippe&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=aVQQuoToTJA&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Robust deep learning based protein sequence design using ProteinMPNN&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://youtu.be/AcvmyqGgMh8?t=208&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Movie Diffusion explained — Make-a-Video from MetaAI and Imagen Video from Google Brain&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2204.03458.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Video Diffusion Models&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://github.com/volkamerlab/teachopencadd/blob/gg-033-molecular_representations/teachopencadd/talktorials/T033_molecular_representations/talkturial.ipynb&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Talktorial: Molecular representations&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=29veWh5Ls5s&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Torsional Diffusion for Molecular Conformer Generation — Gabriele Corso &amp;amp; Bowen Jing&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/1706.03762.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Attention Is All You Need&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=xI0HHN5XKDo&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;BERT Neural Network — EXPLAINED!&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2206.00364.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Elucidating the Design Space of Diffusion-Based Generative Models&lt;/a&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;The header image was created using DALL-E with the prompt
&lt;em&gt;a robot painting a picture, abstract oil painting&lt;/em&gt;.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Ausgewählte Themen für das Lehramt Informatik</title>
      <link>https://mosi.uni-saarland.de/teaching/22-w-lehramt-informatik/</link>
      <pubDate>Sat, 01 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/22-w-lehramt-informatik/</guid>
      <description>&lt;p&gt;tba&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Deep Reinforcement Learning</title>
      <link>https://mosi.uni-saarland.de/teaching/22-w-deep-reinforcement-learning/</link>
      <pubDate>Sat, 01 Oct 2022 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/22-w-deep-reinforcement-learning/</guid>
      <description>&lt;p&gt;For details, have a look at the
&lt;a href=&#34;https://mcms.cs.uni-saarland.de/drl22/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CMS&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Deep Learning for Drug Discovery</title>
      <link>https://mosi.uni-saarland.de/teaching/22-s-deep-learning-drug-discovery/</link>
      <pubDate>Thu, 21 Apr 2022 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/22-s-deep-learning-drug-discovery/</guid>
      <description>&lt;h3 id=&#34;organizers&#34;&gt;Organizers&lt;/h3&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/michael-backenkohler/&#34;&gt;Michael Backenköhler&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://www.helmholtz-hips.de/de/forschung/people/person/prof-dr-olga-kalinina/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Prof. Dr. Olga Kalinina&lt;/a&gt;,
&lt;a href=&#34;https://www.helmholtz-hips.de/de/forschung/people/person/ilya-senatorov/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Ilya Senatorov&lt;/a&gt;
(&lt;a href=&#34;mailto:ilya.senatorov@helmholtz-hips.de&#34;&gt;ilya.senatorov@helmholtz-hips.de&lt;/a&gt;), Roman Joeres (&lt;a href=&#34;mailto:roman.joeres@helmholtz-hips.de&#34;&gt;roman.joeres@helmholtz-hips.de&lt;/a&gt;).&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;This is a joint seminar with the Deep Learning for Drug Discovery Seminar by
&lt;a href=&#34;https://www.helmholtz-hips.de/de/forschung/teams/team/wirkstoffbioinformatik/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Prof. Olga Kalinina&amp;rsquo;s group&lt;/a&gt;.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Please contact &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt; for questions and have &lt;code&gt;[DLDDSeminar]&lt;/code&gt; in the
subject line.&lt;/p&gt;
&lt;h4 id=&#34;registration&#34;&gt;Registration&lt;/h4&gt;
&lt;p&gt;Please use the &lt;a href=&#34;https://seminars.cs.uni-saarland.de/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;seminar assignment system&lt;/a&gt;
to register. Bioinformatics students should apply for Prof. Kalinina&amp;rsquo;s seminar.&lt;/p&gt;
&lt;h3 id=&#34;topic&#34;&gt;Topic&lt;/h3&gt;
&lt;p&gt;The discovery of novel therapeutic drugs is extremely costly and time-consuming.
&lt;em&gt;In silico&lt;/em&gt; drug discovery can potentially accelerate this process. However, this
method requires exploring the vast chemical space to find molecules of interest.
High expectations are placed on deep learning methods to simplify this process
and provide navigation in the realm of possible molecules.&lt;/p&gt;
&lt;p&gt;This seminar focuses on deep learning methods for learning molecular
representations, predicting molecular properties and, ultimately, for finding
novel molecules with desired properties. Primarily, we examine recent advances
in the field of geometric deep learning and graph neural networks.&lt;/p&gt;
&lt;h3 id=&#34;organisation&#34;&gt;Organisation&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;This seminar takes place Thursdays &lt;strong&gt;10:15 to 11:45&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;A kick-off meeting will be held on &lt;strong&gt;Thursday, April 21, 2022&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;The first session will be held two weeks later (Thursday, May 5, 2022).&lt;/li&gt;
&lt;li&gt;The seminar will take place in-person in &lt;strong&gt;E2.1 (ZBI) Room 001&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;The seminar language is English.&lt;/li&gt;
&lt;li&gt;The seminar earns you 7 ECTS.&lt;/li&gt;
&lt;li&gt;The seminar is eligible for bachelor and master students of computer science
and related courses.&lt;/li&gt;
&lt;li&gt;The seminar includes 10 sessions (with 2 presentations each).&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;requirements&#34;&gt;Requirements&lt;/h3&gt;
&lt;p&gt;Prior knowledge of biochemistry is not expected. General background knowledge
in deep learning is recommended.&lt;/p&gt;
&lt;h3 id=&#34;grade&#34;&gt;Grade&lt;/h3&gt;
&lt;p&gt;To pass, you have to attend all sessions (in person), give a presentation,
participate in discussions, and submit reports.&lt;/p&gt;
&lt;p&gt;The final grade consists of: your &lt;em&gt;presentation&lt;/em&gt; (50%), &lt;em&gt;reports&lt;/em&gt; (30%), and
participation during the &lt;em&gt;seminar discussions&lt;/em&gt; (20%).&lt;/p&gt;
&lt;h4 id=&#34;presentation-50&#34;&gt;Presentation (50%)&lt;/h4&gt;
&lt;p&gt;Identify the key ideas and concepts and give a self-consistent presentation
explaining these concepts to your fellow students. The presentation should focus
on intuition and high-level understanding and contextualization, not on
technical details. We encourage the students to read related work and explore
supplementary material and include it in the presentation where it seems useful
(e.g., from related literature, YouTube, GitHub, Medium articles, OpenReview,
etc.).&lt;/p&gt;
&lt;p&gt;Send a first draft of your slides as a &lt;code&gt;.pdf&lt;/code&gt; file to your supervisor &lt;strong&gt;7 days&lt;/strong&gt;
before the presentation (deadline is Thursdays 23:59).&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;The presentation should be 25 minutes long.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Suggestions for a good presentation:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;The goal is to tell a self-consistent and entertaining story — not to convince
us that you understand the paper.&lt;/li&gt;
&lt;li&gt;Put time and effort into creating visualizations and working out (running)
examples.&lt;/li&gt;
&lt;li&gt;Prioritize concreteness, simplicity, and clarity.&lt;/li&gt;
&lt;li&gt;Don&amp;rsquo;t overcrowd your slides. Avoid full sentences and be cautious with bullet
points.&lt;/li&gt;
&lt;li&gt;Use equations only when necessary; use color-coded equations to improve their
readability.&lt;/li&gt;
&lt;li&gt;Be critical of the authors&amp;rsquo; claims, don&amp;rsquo;t fall for overselling.&lt;/li&gt;
&lt;/ul&gt;
&lt;h4 id=&#34;reports-30&#34;&gt;Reports (30%)&lt;/h4&gt;
&lt;p&gt;Every participant has to write a short report for each paper in their group
(except their own). Each report should be about two to three pages long. The
report should contain a short summary of (what you consider to be) the main
contribution or most intriguing idea of the paper. Otherwise, you can freely
express your own thoughts on the topic. For instance: What did you like/dislike
about the paper (both methodically and didactically)? What are connections to
other seminar papers? Can you suggest improvements? What do you think is
missing?&lt;/p&gt;
&lt;p&gt;The report deadline is &lt;strong&gt;14 days&lt;/strong&gt; after the last presentation (&lt;strong&gt;August 4,
23:59&lt;/strong&gt;).&lt;/p&gt;
&lt;p&gt;You can use the &lt;a href=&#34;https://de.overleaf.com/latex/templates/neurips-2022/kxymzbjpwsqx&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;NeurIPS&lt;/a&gt;
or &lt;a href=&#34;https://de.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Springer LNCS&lt;/a&gt;
LaTeX template or any other reasonable format (don&amp;rsquo;t write an abstract). Please
use a spell+grammar checker like &lt;a href=&#34;https://languagetool.org/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;LanguageTool&lt;/a&gt; or
&lt;a href=&#34;https://app.grammarly.com/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Grammarly&lt;/a&gt; before submitting.&lt;/p&gt;
&lt;h4 id=&#34;discussions-20&#34;&gt;Discussions (20%)&lt;/h4&gt;
&lt;p&gt;Read each presented paper in advance (of course, we do not expect you to
understand them fully) and actively participate in the discussion. We expect
each participant to attend each session.&lt;/p&gt;
&lt;h2 id=&#34;content&#34;&gt;Content&lt;/h2&gt;
&lt;h4 id=&#34;compulsory-reading-list&#34;&gt;Compulsory Reading List&lt;/h4&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://arxiv.org/pdf/2107.12375.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Geometric Deep Learning on Molecular Representations&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.nature.com/articles/s41570-021-00313-1&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Towards the sustainable discovery and development of new antibiotics&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h4 id=&#34;recommended-readingwatch-list&#34;&gt;Recommended Reading/Watch List&lt;/h4&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=uF53xsT7mjc&amp;amp;t=1494s&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Video: Theoretical Foundations of Graph Neural Networks&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=w6Pw4MOzMuo&amp;amp;t=410s&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Video: ICLR 2021 Keynote - &amp;ldquo;Geometric Deep Learning: The Erlangen Programme of ML&amp;rdquo; - M Bronstein&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.youtube.com/watch?v=jrVXJykB8qc&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Video: Can graph neural networks understand chemistry? - Dominique Beaini&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h4 id=&#34;background-knowledge&#34;&gt;Background Knowledge&lt;/h4&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://web.njit.edu/~ym329/dlg_book/dlg_book.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Deep Learning on Graphs - Yao Ma and Jiliang Tang&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href=&#34;https://www.cs.mcgill.ca/~wlh/grl_book/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Graph Representation Learning Book - William L. Hamilton&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id=&#34;paper-list-and-time-table&#34;&gt;Paper List and Time Table&lt;/h2&gt;
&lt;table&gt;
  &lt;thead&gt;
      &lt;tr&gt;
          &lt;th&gt;Date&lt;/th&gt;
          &lt;th&gt;Type&lt;/th&gt;
          &lt;th&gt;Student (Advisor)&lt;/th&gt;
          &lt;th&gt;Topic&lt;/th&gt;
          &lt;th&gt;Group&lt;/th&gt;
      &lt;/tr&gt;
  &lt;/thead&gt;
  &lt;tbody&gt;
      &lt;tr&gt;
          &lt;td&gt;05.05.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Roshni Biswas (Roman)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1509.09292&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Convolutional Networks on Graphs for Learning Molecular Fingerprints&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;D&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;05.05.2022&lt;/td&gt;
          &lt;td&gt;CS&lt;/td&gt;
          &lt;td&gt;Advait Ganesh Athreya (GG)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;http://proceedings.mlr.press/v70/gilmer17a/gilmer17a.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Neural Message Passing for Quantum Chemistry&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;D&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;12.05.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Mohammadmahdi Koochali (Roman &amp;amp; Ilya)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1609.05473&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;SeqGAN: Sequence Generative Adversarial Nets with Policy Gradient&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;A&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;12.05.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Pegah Einaliyan (Roman &amp;amp; Ilya)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1705.10843&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Objective-Reinforced Generative Adversarial Networks (ORGAN) for Sequence Generation Models&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;A&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;19.05.2022&lt;/td&gt;
          &lt;td&gt;CS (MB)&lt;/td&gt;
          &lt;td&gt;Shreyash Arya&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1802.04364&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Junction Tree Variational Autoencoder for Molecular Graph Generation&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;A&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;19.05.2022&lt;/td&gt;
          &lt;td&gt;CS (GG)&lt;/td&gt;
          &lt;td&gt;Ashwath Pravin Shetty&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/1805.11973.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;MolGAN: An implicit generative model for small molecular graphs&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;A&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;26.05.2022&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;No session – Christi Himmelfahrt&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;02.06.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Nancy Singh (Roman)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/2110.01219&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Hit and Lead Discovery with Explorative RL and Fragment-based Molecule Generation&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;02.06.2022&lt;/td&gt;
          &lt;td&gt;CS (GG)&lt;/td&gt;
          &lt;td&gt;&lt;del&gt;August von Liechtenstein&lt;/del&gt;&lt;/td&gt;
          &lt;td&gt;&lt;del&gt;&lt;a href=&#34;https://arxiv.org/pdf/2103.03864.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Learning to Extend Molecular Scaffolds with Structural Motifs&lt;/a&gt;&lt;/del&gt; (presentation did not take place, write a report anyway)&lt;/td&gt;
          &lt;td&gt;C&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;09.06.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Joel Chavarria Rivera (Ilya)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://chemrxiv.org/engage/api-gateway/chemrxiv/assets/orp/resource/item/6115baf04cb4797dc42df605/original/model-agnostic-generation-of-counterfactual-explanations-for-molecules.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Model agnostic generation of counterfactual explanations for molecules&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;16.06.2022&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;No session – Fronleichnam&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;23.06.2022&lt;/td&gt;
          &lt;td&gt;CS (MB)&lt;/td&gt;
          &lt;td&gt;Martin Bálint&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://proceedings.neurips.cc/paper/2021/file/157792e4abb490f99dbd738483e0d2d4-Paper.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Weisfeiler and Lehman Go Cellular: CW Networks&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;E&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;23.06.2022&lt;/td&gt;
          &lt;td&gt;CS (MB)&lt;/td&gt;
          &lt;td&gt;Kartik Teotia&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2102.09844.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;E(n) Equivariant Graph Neural Networks&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;E&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;30.06.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Gilbert El Khouri (Ilya)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2012.08452.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Molecular machine learning with conformer ensembles&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;C&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;30.06.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Aleksandra Kushnareva (Ilya)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/2106.07802&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;GeoMol: Torsional Geometric Generation of Molecular 3D Conformer Ensembles&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;C&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;07.07.2022&lt;/td&gt;
          &lt;td&gt;CS&lt;/td&gt;
          &lt;td&gt;Ibrahim Siddig Ibrahim Eltayeb (MB)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1706.08566&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;SchNet: A continuous-filter convolutional neural network for modeling quantum interactions&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;D&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;07.07.2022&lt;/td&gt;
          &lt;td&gt;CS&lt;/td&gt;
          &lt;td&gt;Irem Begüm Gündüz (GG)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2102.05013.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Spherical Message Passing for 3D Graph Networks&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;C&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;14.07.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Tanya Malkani (Roman)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/2007.02835&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Self-supervised Graph Transformer on Large-Scale Molecular Data&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;E&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;14.07.2022&lt;/td&gt;
          &lt;td&gt;CS&lt;/td&gt;
          &lt;td&gt;Kinaan Aamir Khan (MB)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://pubs.acs.org/doi/pdf/10.1021/acscentsci.9b00576&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Molecular Transformer: A Model for Uncertainty-Calibrated Chemical Reaction Prediction&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;E&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;14.07.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Sneha Thomas (Roman)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://chemrxiv.org/engage/api-gateway/chemrxiv/assets/orp/resource/item/613e83a7656369203b2a249b/original/spec2mol-an-end-to-end-deep-learning-framework-for-translating-ms-ms-spectra-to-de-novo-molecules.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Spec2Mol: An end-to-end deep learning framework for translating MS/MS Spectra to de-novo molecules&lt;/a&gt; (originally planned on 9.6.)&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;21.07.2022&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
          &lt;td&gt;Nazligul Keske (Ilya)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://pubs.rsc.org/en/content/articlehtml/2020/ra/d0ra02297g&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Drug-target affinity prediction using graph neural network and contact maps&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;D&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;21.07.2022&lt;/td&gt;
          &lt;td&gt;CS&lt;/td&gt;
          &lt;td&gt;Mattes Alexander Warning (GG)&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/2110.04624.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Iterative Refinement Graph Neural Network for Antibody Sequence-Structure Co-design&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
      &lt;/tr&gt;
  &lt;/tbody&gt;
&lt;/table&gt;
&lt;p&gt;Type indicates whether a paper is suggested for bioinformatics (B) or CS (CS)
students.&lt;/p&gt;
&lt;p&gt;Image credit: &lt;a href=&#34;https://www.pexels.com/de-de/foto/rote-herzen-auf-weissem-hintergrund-7723320/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Tara Winstead&lt;/a&gt;&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Exploring Graph Neural Networks</title>
      <link>https://mosi.uni-saarland.de/teaching/21-s-graph-neural-networks/</link>
      <pubDate>Mon, 19 Apr 2021 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/21-s-graph-neural-networks/</guid>
      <description>&lt;p&gt;&lt;strong&gt;Organisation:&lt;/strong&gt; &lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;Please contact &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt; for questions about the seminar and have
&lt;code&gt;[GNNSeminar]&lt;/code&gt; in the subject line.&lt;/p&gt;
&lt;h4 id=&#34;registration&#34;&gt;Registration&lt;/h4&gt;
&lt;p&gt;Please use the &lt;a href=&#34;https://seminars.cs.uni-saarland.de/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;seminar assignment system&lt;/a&gt;
to register.&lt;/p&gt;
&lt;h3 id=&#34;topic&#34;&gt;Topic&lt;/h3&gt;
&lt;p&gt;Graphs and networks are ubiquitous in nature, and graph-structured data
naturally occurs in a variety of disciplines including physics, chemistry,
neuroscience, biology, social science, and epidemiology.&lt;/p&gt;
&lt;p&gt;This seminar addresses the problem of learning from graph-structured data.
Traditional machine learning and deep learning techniques are not well suited
to process data containing rich relational information. &lt;em&gt;Graph Neural Networks&lt;/em&gt;
(GNNs), &lt;em&gt;Graph Machine Learning&lt;/em&gt;, and &lt;em&gt;Geometric Deep Learning&lt;/em&gt; offer an
interesting perspective on this challenge and are currently one of the
fastest-growing topics in ML research. GNNs can assist in discovering drugs,
fighting cancer, detecting neurological disorders, analyzing complex systems,
recommending friendships in online social networks, controlling traffic, as
well as studying epidemiological processes.&lt;/p&gt;
&lt;p&gt;We examine recent developments in graph ML research, study state-of-the-art
techniques, discuss their limitations, and explore various applications.&lt;/p&gt;
&lt;p&gt;A neat overview of GNNs is given in the
&lt;a href=&#34;https://www.youtube.com/watch?v=fpb3j33RfTc&amp;amp;t=1601s&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Graph Neural Networks with Petar Veličković&lt;/a&gt;
talk.&lt;/p&gt;
&lt;h3 id=&#34;organisation&#34;&gt;Organisation&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;This seminar is a block seminar and will be given on &lt;strong&gt;September 23 and 24, 2021&lt;/strong&gt;, starting at &lt;strong&gt;10:00 sharp&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;An online kick-off meeting will be held on &lt;strong&gt;Monday, April 19, at 2 pm&lt;/strong&gt; (1 hour max).&lt;/li&gt;
&lt;li&gt;The seminar language is English.&lt;/li&gt;
&lt;li&gt;The seminar earns you 7 ECTS.&lt;/li&gt;
&lt;li&gt;The seminar is eligible for bachelor and master students of computer science.&lt;/li&gt;
&lt;li&gt;Send three topic preferences (unordered) to Gerrit by &lt;strong&gt;Monday, April 26&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;Depending on the study regulations, registration/unregistration in HISPOS/LSF is due by &lt;strong&gt;Tuesday May 18&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;Mock presentation deadline: &lt;strong&gt;Friday, Sep 10&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;Short reports deadline: &lt;strong&gt;Sunday, Oct 24&lt;/strong&gt; (by email).&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;requirements&#34;&gt;Requirements&lt;/h3&gt;
&lt;p&gt;A basic understanding of machine learning and deep learning will be helpful
but is not mandatory. If you are new to the field, the
&lt;a href=&#34;https://www.youtube.com/playlist?list=PLZHQObOWTQDNU6R1_67000Dx_ZCJB-3pi&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;3blue1brown Neural Network Playlist&lt;/a&gt;
might be a good start. For further consultation of general concepts, see the
&lt;a href=&#34;https://www.deeplearningbook.org/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Deep Learning Book by Goodfellow et al.&lt;/a&gt;
(available online). Additional material on GNNs can be found in the
&lt;a href=&#34;https://www.cs.mcgill.ca/~wlh/grl_book/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Graph Representation Learning Book&lt;/a&gt;
by Hamilton (available online). There are many more good introductory GNN and
ML talks on YouTube.&lt;/p&gt;
&lt;h3 id=&#34;grade&#34;&gt;Grade&lt;/h3&gt;
&lt;p&gt;To pass, you have to attend all sessions, give a presentation, participate in
discussions, and submit reports. Furthermore, we expect all participants to
read &lt;em&gt;all&lt;/em&gt; seminar papers in the course of the semester and write down
questions/thoughts/ideas/etc. (of course, we do not expect you to understand
them fully). Each participant must also give an ungraded mock presentation to
their group (A, B, or C) at least 2 weeks prior to the actual presentation.&lt;/p&gt;
&lt;p&gt;The final grade consists of: your &lt;em&gt;presentation&lt;/em&gt; (40%), &lt;em&gt;reports&lt;/em&gt; (40%), and
participation during the &lt;em&gt;seminar discussions&lt;/em&gt; (20%).&lt;/p&gt;
&lt;h4 id=&#34;presentation&#34;&gt;Presentation&lt;/h4&gt;
&lt;p&gt;Identify the key ideas and concepts and give a self-consistent presentation
explaining these concepts to your fellow students. The presentation should
focus on intuition and high-level understanding and contextualization, not on
technical details. We encourage you to read related work and explore
supplementary material and include it in the presentation where it seems
useful (e.g., from related literature, YouTube, GitHub, Medium articles,
OpenReview, etc.). The presentation should be &lt;strong&gt;20 to 30 minutes&lt;/strong&gt; long.&lt;/p&gt;
&lt;h4 id=&#34;report&#34;&gt;Report&lt;/h4&gt;
&lt;p&gt;Each student has to submit four short reports (one for each paper of their
group, 1000–2000 words). The report should contain a short summary of (what
you consider to be) the main contribution or most intriguing idea of the paper.
Otherwise, you can freely express your own thoughts on the topic. For instance:
What did you like/dislike about the paper (both methodically and
didactically)? What are connections to other seminar papers? Can you suggest
improvements? What do you think is missing? Can you think of other useful
applications?&lt;/p&gt;
&lt;p&gt;You can use the &lt;a href=&#34;https://de.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Springer LNCS&lt;/a&gt;
LaTeX template (every other reasonable formatting is fine, too).&lt;/p&gt;
&lt;h4 id=&#34;discussions&#34;&gt;Discussions&lt;/h4&gt;
&lt;p&gt;Read each presented paper in advance (of course, we do not expect you to
understand them fully) and actively participate in the discussion. We expect each participant to attend each session.&lt;/p&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;p&gt;&lt;strong&gt;Foundations&lt;/strong&gt;&lt;/p&gt;
&lt;table&gt;
  &lt;thead&gt;
      &lt;tr&gt;
          &lt;th&gt;Date&lt;/th&gt;
          &lt;th&gt;Timeslot&lt;/th&gt;
          &lt;th&gt;Student&lt;/th&gt;
          &lt;th&gt;Topic&lt;/th&gt;
          &lt;th&gt;Group&lt;/th&gt;
      &lt;/tr&gt;
  &lt;/thead&gt;
  &lt;tbody&gt;
      &lt;tr&gt;
          &lt;td&gt;23.09.2021&lt;/td&gt;
          &lt;td&gt;10:00&lt;/td&gt;
          &lt;td&gt;Safya Alzayat&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1609.02907&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Semi-Supervised Classification with Graph Convolutional Networks&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;A&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;23.09.2021&lt;/td&gt;
          &lt;td&gt;10:45&lt;/td&gt;
          &lt;td&gt;Suruthai Noon Goldstein&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://papers.nips.cc/paper/2017/hash/5dd9db5e033da9c6fb5ba83c7a7ebea9-Abstract.html&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Inductive Representation Learning on Large Graphs&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;23.09.2021&lt;/td&gt;
          &lt;td&gt;–&lt;/td&gt;
          &lt;td&gt;Siwen Chen&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;http://proceedings.mlr.press/v70/gilmer17a/gilmer17a.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Neural Message Passing for Quantum Chemistry&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;C&lt;/td&gt;
      &lt;/tr&gt;
  &lt;/tbody&gt;
&lt;/table&gt;
&lt;p&gt;&lt;strong&gt;Applications&lt;/strong&gt;&lt;/p&gt;
&lt;table&gt;
  &lt;thead&gt;
      &lt;tr&gt;
          &lt;th&gt;Date&lt;/th&gt;
          &lt;th&gt;Timeslot&lt;/th&gt;
          &lt;th&gt;Student&lt;/th&gt;
          &lt;th&gt;Topic&lt;/th&gt;
          &lt;th&gt;Group&lt;/th&gt;
      &lt;/tr&gt;
  &lt;/thead&gt;
  &lt;tbody&gt;
      &lt;tr&gt;
          &lt;td&gt;23.09.2021&lt;/td&gt;
          &lt;td&gt;11:30&lt;/td&gt;
          &lt;td&gt;Gilbert El Khoury&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://www.biorxiv.org/content/10.1101/2020.05.16.100057v1&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;BrainGNN: Interpretable Brain Graph Neural Network for fMRI Analysis&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;A&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;23.09.2021&lt;/td&gt;
          &lt;td&gt;13:00&lt;/td&gt;
          &lt;td&gt;Divya Nidadavolu&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1902.06673&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Fake News Detection on Social Media using Geometric Deep Learning&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;23.09.2021&lt;/td&gt;
          &lt;td&gt;13:45&lt;/td&gt;
          &lt;td&gt;Roman Joeres&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://academic.oup.com/bioinformatics/article/34/13/i457/5045770&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Modeling polypharmacy side effects with graph convolutional networks&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;C&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;24.09.2021&lt;/td&gt;
          &lt;td&gt;10:00&lt;/td&gt;
          &lt;td&gt;Maryam Meghdadi Esfahani&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1802.04687&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Neural Relational Inference for Interacting Systems&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;A&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;24.09.2021&lt;/td&gt;
          &lt;td&gt;10:45&lt;/td&gt;
          &lt;td&gt;Yan Yan Lau&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/2006.11913&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Finding Patient Zero: Learning Contagion Source with Graph Neural Networks&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;24.09.2021&lt;/td&gt;
          &lt;td&gt;11:30&lt;/td&gt;
          &lt;td&gt;Aakash Rajpal&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/1805.11973.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;MolGAN: An implicit generative model for small molecular graphs&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;C&lt;/td&gt;
      &lt;/tr&gt;
  &lt;/tbody&gt;
&lt;/table&gt;
&lt;p&gt;&lt;strong&gt;Properties, limitations, and recent advances&lt;/strong&gt;&lt;/p&gt;
&lt;table&gt;
  &lt;thead&gt;
      &lt;tr&gt;
          &lt;th&gt;Date&lt;/th&gt;
          &lt;th&gt;Timeslot&lt;/th&gt;
          &lt;th&gt;Student&lt;/th&gt;
          &lt;th&gt;Topic&lt;/th&gt;
          &lt;th&gt;Group&lt;/th&gt;
      &lt;/tr&gt;
  &lt;/thead&gt;
  &lt;tbody&gt;
      &lt;tr&gt;
          &lt;td&gt;24.09.2021&lt;/td&gt;
          &lt;td&gt;12:45&lt;/td&gt;
          &lt;td&gt;Adarsh Jamadandi&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1810.00826&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;How Powerful are Graph Neural Networks?&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;A&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;24.09.2021&lt;/td&gt;
          &lt;td&gt;13:30&lt;/td&gt;
          &lt;td&gt;Vabuk Pahari&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/abs/1905.12265&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Strategies for Pre-training Graph Neural Networks&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;B&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;24.09.2021&lt;/td&gt;
          &lt;td&gt;14:15&lt;/td&gt;
          &lt;td&gt;Zhifei Li&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://dl.acm.org/doi/pdf/10.1145/3219819.3220078&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Adversarial Attacks on Neural Networks for Graph Data&lt;/a&gt;&lt;/td&gt;
          &lt;td&gt;C&lt;/td&gt;
      &lt;/tr&gt;
  &lt;/tbody&gt;
&lt;/table&gt;
&lt;p&gt;The participants are split into three groups (A, B, C — with four participants
each). Each student writes four reports, one for each paper of their group.
The mock presentations are also given within these groups.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Deep Reinforcement Learning</title>
      <link>https://mosi.uni-saarland.de/teaching/21-s-deep-reinforcement-learning/</link>
      <pubDate>Thu, 01 Apr 2021 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/21-s-deep-reinforcement-learning/</guid>
      <description>&lt;h2 id=&#34;team&#34;&gt;Team&lt;/h2&gt;
&lt;p&gt;&lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;&lt;br&gt;
&lt;a href=&#34;https://mosi.uni-saarland.de/person/timo-gros/&#34;&gt;Timo P. Gros&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/joschka-gro%C3%9F/&#34;&gt;Joschka Groß&lt;/a&gt; (assistants)&lt;/p&gt;
&lt;p&gt;The course pages of this seminar were on the group&amp;rsquo;s former CMS, which is no
longer online. The seminar ran again in
&lt;a href=&#34;https://mosi.uni-saarland.de/teaching/22-w-deep-reinforcement-learning/&#34;&gt;Winter 2022/23&lt;/a&gt;.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Monte Carlo Methods</title>
      <link>https://mosi.uni-saarland.de/teaching/20-w-mc-seminar/</link>
      <pubDate>Fri, 06 Nov 2020 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/20-w-mc-seminar/</guid>
      <description>&lt;p&gt;&lt;strong&gt;Organisation:&lt;/strong&gt; &lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;,
Michael Backenköhler.&lt;/p&gt;
&lt;h4 id=&#34;registration&#34;&gt;Registration&lt;/h4&gt;
&lt;p&gt;Please use the &lt;a href=&#34;https://mcms.cs.uni-saarland.de/mc_methods_20&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;seminar assignment system&lt;/a&gt;
to register.&lt;/p&gt;
&lt;h3 id=&#34;topic&#34;&gt;Topic&lt;/h3&gt;
&lt;p&gt;The core idea of &lt;em&gt;Monte Carlo (MC) methods&lt;/em&gt; is to perform computer simulations
of a real-world system based on pseudo-random numbers. MC is applied in a large
variety of research areas: physical sciences, computer sciences, engineering,
statistics, finance, etc. Moreover, ideas that have originally been developed
in the context of MC are meanwhile also in use for sampling problems in the
area of machine learning. Although being a simple and very direct approach to
analyze a system, MC methods come with a lot of challenges, in particular when
sampling rare events or when systems have multiple time scales. In this
seminar, we take a computer science perspective on Monte Carlo and cover
different MC algorithms to tackle these challenges.&lt;/p&gt;
&lt;table&gt;
  &lt;thead&gt;
      &lt;tr&gt;
          &lt;th&gt;Date&lt;/th&gt;
          &lt;th&gt;Topic&lt;/th&gt;
      &lt;/tr&gt;
  &lt;/thead&gt;
  &lt;tbody&gt;
      &lt;tr&gt;
          &lt;td&gt;7. 12.&lt;/td&gt;
          &lt;td&gt;Variance Reduction&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;14. 12.&lt;/td&gt;
          &lt;td&gt;Random Process Generation&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;4. 1.&lt;/td&gt;
          &lt;td&gt;Probabilistic Programming&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;11. 1.&lt;/td&gt;
          &lt;td&gt;Markov Chain Monte Carlo&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;18. 1.&lt;/td&gt;
          &lt;td&gt;Stochastic Gradient Descent&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;25. 1.&lt;/td&gt;
          &lt;td&gt;Rare Event Simulation and Cross-Entropy Method&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;1. 2.&lt;/td&gt;
          &lt;td&gt;Evolutionary Algorithms&lt;/td&gt;
      &lt;/tr&gt;
  &lt;/tbody&gt;
&lt;/table&gt;
&lt;h3 id=&#34;organisation&#34;&gt;Organisation&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;All seminar meetings take place online (no physical meetings).&lt;/li&gt;
&lt;li&gt;A kick-off meeting takes place on &lt;strong&gt;November 6 at 11:00&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;The seminar takes place &lt;strong&gt;Mondays at 9:00 sharp&lt;/strong&gt;. A list of dates and topics
can be found above and in the
&lt;a href=&#34;https://mcms.cs.uni-saarland.de/mc_methods_20&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;CMS&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;The seminar language is English.&lt;/li&gt;
&lt;li&gt;The seminar earns you 7 ECTS.&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;grade&#34;&gt;Grade&lt;/h3&gt;
&lt;p&gt;The final grade consists of: your presentation (50%), reports (40%), and
participation during the seminar discussions (10%).&lt;/p&gt;
&lt;h3 id=&#34;requirements&#34;&gt;Requirements&lt;/h3&gt;
&lt;p&gt;You should have successfully passed MfI3, the Statistics Lab, or a comparable
course covering probability theory/statistics.&lt;/p&gt;
</description>
    </item>
    
    <item>
      <title>Exploring Complex Networks Dynamics</title>
      <link>https://mosi.uni-saarland.de/teaching/19-w-complex-networks/</link>
      <pubDate>Fri, 18 Oct 2019 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/19-w-complex-networks/</guid>
      <description>&lt;p&gt;&lt;strong&gt;Organisation:&lt;/strong&gt; &lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt;, &lt;a href=&#34;https://mosi.uni-saarland.de/person/michael-backenkohler/&#34;&gt;Michael Backenköhler&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;Please contact &lt;a href=&#34;https://mosi.uni-saarland.de/person/gerrit-gro%C3%9Fmann/&#34;&gt;Gerrit Großmann&lt;/a&gt; for questions about the seminar.&lt;/p&gt;
&lt;h4 id=&#34;registration&#34;&gt;Registration&lt;/h4&gt;
&lt;p&gt;Please use the &lt;a href=&#34;https://seminars.cs.uni-saarland.de/seminars1920/seminars/view/56&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;seminar assignment system&lt;/a&gt;
to register.&lt;/p&gt;
&lt;h3 id=&#34;topic&#34;&gt;Topic&lt;/h3&gt;
&lt;p&gt;Many real-world phenomena like rumor spreading, contagions in financial
markets, epidemic outbreaks, or cognitive processes can be expressed in the
terms of &lt;em&gt;complex networks&lt;/em&gt;. The seminar explores dynamical processes which
are linked to networked structures in intriguing ways. In particular, we aim
at understanding the complex interplay between the topology and the emerging
dynamics of a network. We analyze brain networks or online social networks
and explore various techniques for their analysis and classification ranging
from diffusion models and stochastic simulations to deep learning approaches.&lt;/p&gt;
&lt;h3 id=&#34;organisation&#34;&gt;Organisation&lt;/h3&gt;
&lt;ul&gt;
&lt;li&gt;All sessions take place in &lt;strong&gt;room 328 (E 1.3)&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;A kick-off meeting will take place on &lt;strong&gt;Friday, 18 October, 12:30&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;The seminar takes place Thursdays 10:15 – 11:45 with two presentations per
session (2 × 20–30 minutes + discussion).&lt;/li&gt;
&lt;li&gt;Dates: 14.11.19, 28.11.19, 19.12.19, 9.01.20, 23.01.20, 06.02.20.&lt;/li&gt;
&lt;li&gt;The seminar language is English.&lt;/li&gt;
&lt;li&gt;The seminar earns you 7 ECTS.&lt;/li&gt;
&lt;/ul&gt;
&lt;h3 id=&#34;requirements&#34;&gt;Requirements&lt;/h3&gt;
&lt;p&gt;There are no prerequisites to take the seminar but a basic understanding of
linear algebra and probability theory will be useful.&lt;/p&gt;
&lt;h3 id=&#34;grade&#34;&gt;Grade&lt;/h3&gt;
&lt;p&gt;The final grade consists of: your &lt;em&gt;presentation&lt;/em&gt; (40%), &lt;em&gt;reports&lt;/em&gt; (40%), and
participation during the &lt;em&gt;seminar discussions&lt;/em&gt; (20%).&lt;/p&gt;
&lt;h4 id=&#34;presentation&#34;&gt;Presentation&lt;/h4&gt;
&lt;p&gt;Identify the key ideas and concepts and give a self-consistent presentation
explaining these concepts to your fellow students. Assume no prior knowledge
about the topic. Read related work and include it where it seems useful to you
or where it is necessary to understand the topic. Meet with your supervisor
and send her your slides at least one week before your presentation (deadline
is Wednesdays 23:59). The duration should be 20–30 min.&lt;/p&gt;
&lt;h4 id=&#34;report&#34;&gt;Report&lt;/h4&gt;
&lt;p&gt;In each seminar session (including the session of your own presentation),
choose one of the two presented papers/topics and write a short report
(600–1600 words) about it. Shortly summarize (what you consider to be) the
main contribution or most intriguing idea of the paper. Explain what you
liked/disliked about the paper (both methodically and presentation-wise).
Highlight connections to other seminar papers. We do not expect comprehensive
understanding of the paper.&lt;/p&gt;
&lt;p&gt;You can use the &lt;a href=&#34;https://de.overleaf.com/latex/templates/springer-lecture-notes-in-computer-science/kzwwpvhwnvfj&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Springer LNCS&lt;/a&gt;
LaTeX template (every other reasonable formatting is fine too).&lt;/p&gt;
&lt;p&gt;Send the reports as &lt;code&gt;.pdf&lt;/code&gt; files to Gerrit Großmann by email within 13 days of
the presentation. &lt;strong&gt;Deadline is always Wednesdays 23:59.&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Each participant gets one session where they can skip the report. With six
sessions, we expect each participant to submit five short reports (but at most
one report per session).&lt;/p&gt;
&lt;h4 id=&#34;discussions&#34;&gt;Discussions&lt;/h4&gt;
&lt;p&gt;Read each presented paper in advance (of course, we do not expect you to
understand them fully) and actively participate in the discussion. We expect each participant to attend each session.&lt;/p&gt;
&lt;h2 id=&#34;topics&#34;&gt;Topics&lt;/h2&gt;
&lt;table&gt;
  &lt;thead&gt;
      &lt;tr&gt;
          &lt;th&gt;Session&lt;/th&gt;
          &lt;th&gt;Date&lt;/th&gt;
          &lt;th&gt;Student&lt;/th&gt;
          &lt;th&gt;Topic&lt;/th&gt;
      &lt;/tr&gt;
  &lt;/thead&gt;
  &lt;tbody&gt;
      &lt;tr&gt;
          &lt;td&gt;1&lt;/td&gt;
          &lt;td&gt;14.11.19&lt;/td&gt;
          &lt;td&gt;Lukas Wachter&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://link.springer.com/chapter/10.1007/978-3-030-05411-3_13&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Cascading Effects of Targeted Attacks on the Power Grid&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;1&lt;/td&gt;
          &lt;td&gt;14.11.19&lt;/td&gt;
          &lt;td&gt;Redion Xhepa&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/1707.01926.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Diffusion Convolutional Recurrent Neural Network: Data-Driven Traffic Forecasting&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;2&lt;/td&gt;
          &lt;td&gt;28.11.19&lt;/td&gt;
          &lt;td&gt;Christina Eimer&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://www.nature.com/articles/nature24056&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Network control principles predict neuron function in the Caenorhabditis elegans connectome&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;2&lt;/td&gt;
          &lt;td&gt;28.11.19&lt;/td&gt;
          &lt;td&gt;Julian Zimmerlin&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://www.sciencedirect.com/science/article/pii/S1053811916305237&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;BrainNetCNN: Convolutional neural networks for brain networks; towards predicting neurodevelopment&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;3&lt;/td&gt;
          &lt;td&gt;19.12.19&lt;/td&gt;
          &lt;td&gt;Timon Ulrich&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://www.cs.uic.edu/~clu/doc/kdd17_SDBN.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Structural Deep Brain Network Mining&lt;/a&gt; (&lt;strong&gt;Report deadline: 08.01.20&lt;/strong&gt;)&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;3&lt;/td&gt;
          &lt;td&gt;19.12.19&lt;/td&gt;
          &lt;td&gt;Lisa Heidmann&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://www.nas.ewi.tudelft.nl/people/Piet/papers/NeuroImage2017_epidemics_brain.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;The epidemic spreading model and the direction of information flow in brain networks&lt;/a&gt; (&lt;strong&gt;Report deadline: 08.01.20&lt;/strong&gt;)&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;4&lt;/td&gt;
          &lt;td&gt;9.01.20&lt;/td&gt;
          &lt;td&gt;Sabrina Lauer&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://www.kdd.org/kdd2016/papers/files/rpp0920-rozenshteinA.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Reconstructing an Epidemic Over Time&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;4&lt;/td&gt;
          &lt;td&gt;9.01.20&lt;/td&gt;
          &lt;td&gt;Bastian Herra&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://arxiv.org/pdf/1412.8439.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Spy vs. Spy: Rumor Source Obfuscation&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;5&lt;/td&gt;
          &lt;td&gt;23.01.20&lt;/td&gt;
          &lt;td&gt;Adrian Dapprich&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://link.springer.com/chapter/10.1007/978-3-030-05414-4_34&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Bots in Nets: Empirical Comparative Analysis of Bot Evidence in Social Networks&lt;/a&gt; (also consider &lt;a href=&#34;https://www.researchgate.net/profile/Abdullah_Mueen/publication/308021270_DeBot_Twitter_Bot_Detection_via_Warped_Correlation/links/59dc10f1a6fdcc1ec89fad11/DeBot-Twitter-Bot-Detection-via-Warped-Correlation.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;DeBot: Twitter Bot Detection via Warped Correlation&lt;/a&gt;)&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;5&lt;/td&gt;
          &lt;td&gt;23.01.20&lt;/td&gt;
          &lt;td&gt;—&lt;/td&gt;
          &lt;td&gt;&lt;del&gt;&lt;a href=&#34;http://papers.nips.cc/paper/8192-dynamic-network-model-from-partial-observations.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Dynamic Network Model from Partial Observations&lt;/a&gt;&lt;/del&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;6&lt;/td&gt;
          &lt;td&gt;06.02.20&lt;/td&gt;
          &lt;td&gt;Nicolas Faroß&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://link.springer.com/chapter/10.1007/978-3-030-05414-4_5&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Spectral Measures of Distortion for Change Detection in Dynamic Graphs&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
      &lt;tr&gt;
          &lt;td&gt;6&lt;/td&gt;
          &lt;td&gt;06.02.20&lt;/td&gt;
          &lt;td&gt;Saleh Al Mohamad&lt;/td&gt;
          &lt;td&gt;&lt;a href=&#34;https://dl.acm.org/citation.cfm?id=3157320&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Diffusion-Convolutional Neural Networks&lt;/a&gt;&lt;/td&gt;
      &lt;/tr&gt;
  &lt;/tbody&gt;
&lt;/table&gt;
</description>
    </item>
    
    <item>
      <title>Rein4cement Learning</title>
      <link>https://mosi.uni-saarland.de/teaching/19-w-reinforcement/</link>
      <pubDate>Tue, 01 Oct 2019 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/19-w-reinforcement/</guid>
      <description>&lt;p&gt;&lt;strong&gt;Organisation:&lt;/strong&gt; &lt;a href=&#34;https://mosi.uni-saarland.de/person/verena-wolf/&#34;&gt;Prof. Dr. Verena Wolf&lt;/a&gt;,
&lt;a href=&#34;https://mosi.uni-saarland.de/person/timo-gros/&#34;&gt;Timo P. Gros&lt;/a&gt;.&lt;/p&gt;
&lt;h3 id=&#34;topic&#34;&gt;Topic&lt;/h3&gt;
&lt;p&gt;Reinforcement Learning is — besides Supervised and Unsupervised Learning — one
of the outstanding variants of Machine Learning. It has evolved to an effective
tool, being able to create AI systems that are able to beat humans in almost
every game, e.g. the famous strategy board game Go [2].&lt;/p&gt;
&lt;p&gt;This seminar will try to do both: teach the basics of Reinforcement Learning
in theory and also provide the ability to apply it. We will therefore first
have a look at the state-of-the-art algorithms of Reinforcement Learning and
afterwards apply these to the well-known game Connect 4.&lt;/p&gt;











&lt;figure  id=&#34;figure-image-taken-from-1&#34;&gt;
  &lt;div class=&#34;d-flex justify-content-center&#34;&gt;
    &lt;div class=&#34;w-100&#34; style=&#34;max-width: 50%&#34;&gt;&lt;img alt=&#34;Image taken from [1].&#34; srcset=&#34;
               /teaching/19-w-reinforcement/reinf_venn_hu_14589defd6b5b810.webp 400w,
               /teaching/19-w-reinforcement/reinf_venn_hu_c7886d95e5d4471e.webp 635w,
               /teaching/19-w-reinforcement/reinf_venn_hu_51e3c31b90983d7.webp 635w&#34;
               src=&#34;https://mosi.uni-saarland.de/teaching/19-w-reinforcement/reinf_venn_hu_14589defd6b5b810.webp&#34;
               width=&#34;635&#34;
               height=&#34;611&#34;
               loading=&#34;lazy&#34; data-zoomable /&gt;&lt;/div&gt;
  &lt;/div&gt;&lt;figcaption&gt;
      Image taken from [1].
    &lt;/figcaption&gt;&lt;/figure&gt;

&lt;p&gt;The seminar will include a short talk, a programming project that will be
solved in small groups, as well as a write-up about both: the topics presented
in the talk and the implementation.&lt;/p&gt;
&lt;h3 id=&#34;course-page&#34;&gt;Course page&lt;/h3&gt;
&lt;p&gt;Find all materials and the registration details
&lt;a href=&#34;https://mcms.cs.uni-saarland.de/r4l/&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;here&lt;/a&gt;.&lt;/p&gt;
&lt;h3 id=&#34;references&#34;&gt;References&lt;/h3&gt;
&lt;ol&gt;
&lt;li&gt;Ahmad Hammoudeh, &lt;em&gt;A Concise Introduction to Reinforcement Learning&lt;/em&gt;&lt;/li&gt;
&lt;li&gt;David Silver, Julian Schrittwieser, Karen Simonyan et al., &lt;em&gt;Mastering the game of Go without human knowledge&lt;/em&gt;&lt;/li&gt;
&lt;/ol&gt;
</description>
    </item>
    
    <item>
      <title>Data Networks</title>
      <link>https://mosi.uni-saarland.de/teaching/13-w-data-networks-seminar/</link>
      <pubDate>Tue, 01 Oct 2013 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/13-w-data-networks-seminar/</guid>
      <description></description>
    </item>
    
  </channel>
</rss>
