Methods › Reinforcement Learning › On-Policy TD Control › Sarsa

Sarsa

introduced 1994 56 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Sarsa is an on-policy TD control algorithm:

Q(Sₜ, Aₜ) ←Q(Sₜ, Aₜ) + α[Rₜ₊₁ + γQ(Sₜ₊₁, Aₜ₊₁) - Q(Sₜ, Aₜ)]

This update is done after every transition from a nonterminal state Sₜ. if Sₜ₊₁ is terminal, then Q(Sₜ₊₁, Aₜ₊₁) is defined as zero.

To design an on-policy control algorithm using Sarsa, we estimate q_π for a behaviour policy π and then change π towards greediness with respect to q_π.

Source: Sutton and Barto, Reinforcement Learning, 2nd Edition

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: MI-SARSA; Implicit Q-Learning and SARSA.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 56 · with a code link: 11 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 56 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 56 of 56, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 38 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Reinforcement Learning (RL)39
Q-Learning34
reinforcement-learning32
Reinforcement Learning29
Decision Making5
Deep Reinforcement Learning5
Continuous Control3
OpenAI Gym3
continuous-control3
Combinatorial Optimization2
Management2
Transfer Learning2
Traveling Salesman Problem2
Autonomous Driving1
Board Games1
CPU1
Card Games1
Classification1
Dialogue Management1
Efficient Exploration1

Usage over time archive 2025-07-28

Papers per year tagged with Sarsa: 2009 to 2025, peak 10 10 0 2009: 1 paper 2009 2010: 0 papers 2011: 0 papers 2011 2012: 0 papers 2013: 0 papers 2013 2014: 0 papers 2015: 1 paper 2015 2016: 0 papers 2017: 4 papers 2017 2018: 6 papers 2019: 5 papers 2019 2020: 8 papers 2021: 5 papers 2021 2022: 7 papers 2023: 6 papers 2023 2024: 10 papers 2025: 3 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (56 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

On-Policy TD Control

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections