<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Reinforcement Learning | Neuro-Mechanistic Modeling</title>
    <link>https://mosi.uni-saarland.de/tag/reinforcement-learning/</link>
      <atom:link href="https://mosi.uni-saarland.de/tag/reinforcement-learning/index.xml" rel="self" type="application/rss+xml" />
    <description>Reinforcement Learning</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>Reinforcement Learning</title>
      <link>https://mosi.uni-saarland.de/tag/reinforcement-learning/</link>
    </image>
    
    <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>Reinforcement Learning</title>
      <link>https://mosi.uni-saarland.de/teaching/25-w-reinforcement-learning/</link>
      <pubDate>Wed, 01 Oct 2025 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/25-w-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; (lecturer)&lt;br&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/yannic-muskalla/&#34;&gt;Yannic Muskalla&lt;/a&gt; (assistants)&lt;/p&gt;
&lt;h2 id=&#34;reinforcement-learning&#34;&gt;Reinforcement Learning&lt;/h2&gt;
&lt;p&gt;Reinforcement learning is an area of machine learning where the goal is to
develop (near-)optimal policies for solving sequential decision-making
problems. The policy is typically represented by an agent who learns to achieve
a goal by interacting with the environment. RL is often seen as the third area
of machine learning (in addition to supervised and unsupervised learning), in
which training samples are generated as a result of the agent&amp;rsquo;s actions and
interaction with the environment. In recent years, there have been remarkable
successes in reinforcement learning research in both theoretical and applied
fields. These successes are mostly the result of a new development in the
field: representing policies by artificial neural networks allows us to solve
much more complex decision problems.&lt;/p&gt;
&lt;h2 id=&#34;course-content&#34;&gt;Course Content&lt;/h2&gt;
&lt;p&gt;This course provides a broad introduction to reinforcement learning and its
applications. You learn about Markov Decision Processes as the underlying
formal framework for decision-making problems, as well as popular
reinforcement learning algorithms such as Monte-Carlo methods, temporal
difference methods, and different &amp;ldquo;deep&amp;rdquo; reinforcement learning approaches.
We use the open-source Python library Gymnasium to train RL agents in
different pre-built environments.&lt;/p&gt;
&lt;p&gt;Recommended prerequisites are Programming 1, Programming 2 and basic knowledge
of probability theory, as taught for example in Mathematics for Computer
Scientists 3.&lt;/p&gt;
&lt;h2 id=&#34;format&#34;&gt;Format&lt;/h2&gt;
&lt;p&gt;The course is a 6 ECTS advanced lecture with weekly lectures, bi-weekly
assignment sheets with theoretical and programming exercises, tutorials,
office hours and a final exam. Submitting the assignment sheets is voluntary.
Admission to the final exam requires passing a mid-term exam.&lt;/p&gt;
&lt;h2 id=&#34;literature&#34;&gt;Literature&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Richard S. Sutton and Andrew G. Barto: &lt;em&gt;Reinforcement Learning: An Introduction&lt;/em&gt;&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Csaba Szepesvári: &lt;em&gt;Algorithms for Reinforcement Learning&lt;/em&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/rl_25/&#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/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>Reinforcement Learning</title>
      <link>https://mosi.uni-saarland.de/teaching/23-w-reinforcement-learning/</link>
      <pubDate>Sun, 01 Oct 2023 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/teaching/23-w-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; (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/joschka-gro%C3%9F/&#34;&gt;Joschka Groß&lt;/a&gt; (assistants)&lt;/p&gt;
&lt;h2 id=&#34;reinforcement-learning&#34;&gt;Reinforcement Learning&lt;/h2&gt;
&lt;p&gt;Reinforcement learning is an area of machine learning where the goal is to
develop (near-)optimal policies for solving sequential decision-making
problems. The policy is typically represented by an agent who learns to achieve
a goal by interacting with the environment. RL is often seen as the third area
of machine learning (in addition to supervised and unsupervised learning), in
which training samples are generated as a result of the agent&amp;rsquo;s actions and
interaction with the environment. In recent years, there have been remarkable
successes in reinforcement learning research in both theoretical and applied
fields. These successes are mostly the result of a new development in the
field: representing policies by artificial neural networks allows us to solve
much more complex decision problems.&lt;/p&gt;
&lt;h2 id=&#34;course-content&#34;&gt;Course Content&lt;/h2&gt;
&lt;p&gt;This course provides a broad introduction to reinforcement learning and its
applications. You learn about Markov Decision Processes as the underlying
formal framework for decision-making problems, as well as popular
reinforcement learning algorithms such as Monte-Carlo methods, temporal
difference methods, and different &amp;ldquo;deep&amp;rdquo; reinforcement learning approaches.
We use the open-source Python library Gymnasium to train RL agents in
different pre-built environments.&lt;/p&gt;
&lt;p&gt;Recommended prerequisites are Programming 1, Programming 2 and basic knowledge
of probability theory, as taught for example in Mathematics for Computer
Scientists 3.&lt;/p&gt;
&lt;h2 id=&#34;format&#34;&gt;Format&lt;/h2&gt;
&lt;p&gt;The course is a 6 ECTS advanced lecture with weekly lectures, bi-weekly
assignment sheets with theoretical and programming exercises, bi-weekly
tutorials and office hours, and a 90-minute final exam. Admission to the exam
requires 50% of the points of the assignment sheets.&lt;/p&gt;
&lt;h2 id=&#34;literature&#34;&gt;Literature&lt;/h2&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href=&#34;https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf&#34; target=&#34;_blank&#34; rel=&#34;nofollow noopener&#34;&gt;Richard S. Sutton and Andrew G. Barto: &lt;em&gt;Reinforcement Learning: An Introduction&lt;/em&gt;&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Csaba Szepesvári: &lt;em&gt;Algorithms for Reinforcement Learning&lt;/em&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The lecture ran again in &lt;a href=&#34;https://mosi.uni-saarland.de/teaching/25-w-reinforcement-learning/&#34;&gt;Winter 2025/26&lt;/a&gt;.&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>MoGym: Using Formal Models for Training and Verifying Decision-making Agents</title>
      <link>https://mosi.uni-saarland.de/publications/gros-mo-gym-using-formal-models-2022/</link>
      <pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate>
      <guid>https://mosi.uni-saarland.de/publications/gros-mo-gym-using-formal-models-2022/</guid>
      <description></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>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>
    
  </channel>
</rss>
