{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/sarsa","slug":"sarsa","name":"Sarsa","full_name":"Sarsa","full_name_withheld":false,"description_markdown":"**Sarsa** is an on-policy TD control algorithm:\r\n\r\n$$Q\\left(S\\_{t}, A\\_{t}\\right) \\leftarrow Q\\left(S\\_{t}, A\\_{t}\\right) + \\alpha\\left[R_{t+1} + \\gamma{Q}\\left(S\\_{t+1}, A\\_{t+1}\\right) - Q\\left(S\\_{t}, A\\_{t}\\right)\\right] $$\r\n\r\nThis update is done after every transition from a nonterminal state $S\\_{t}$. if $S\\_{t+1}$ is terminal, then $Q\\left(S\\_{t+1}, A\\_{t+1}\\right)$ is defined as zero.\r\n\r\nTo design an on-policy control algorithm using Sarsa, we estimate $q\\_{\\pi}$ for a behaviour policy $\\pi$ and then change $\\pi$ towards greediness with respect to $q\\_{\\pi}$.\r\n\r\nSource: Sutton and Barto, Reinforcement Learning, 2nd Edition","description_state":"present","introduced_year":1994,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"On-Policy TD Control","url":"/methods/category/on-policy-td-control","pwc_aliases":[]}],"n_papers_tagged":56,"archive_num_papers":56,"papers_newest_first":[{"paper":null,"slug":"a-unified-anti-jamming-design-in-complex","title":"A Unified Anti-Jamming Design in Complex Environments Based on Cross-Modal Fusion and Intelligent Decision-Making","date":"2025-06-09","arxiv_id":"2506.07532","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinforcement-learning-for-hanabi","title":"Reinforcement Learning for Hanabi","date":"2025-05-31","arxiv_id":"2506.00458","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergent-nmpc-based-reinforcement-learning","title":"Convergent NMPC-based Reinforcement Learning Using Deep Expected Sarsa and Nonlinear Temporal Difference Learning","date":"2025-02-07","arxiv_id":"2502.04925","n_code_links":0,"syntology":null},{"paper":null,"slug":"segmenting-action-value-functions-over-time","title":"Segmenting Action-Value Functions Over Time-Scales in SARSA via TD($Δ$)","date":"2024-11-22","arxiv_id":"2411.14783","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-novel-agent-with-formal-goal-reaching","title":"A novel agent with formal goal-reaching guarantees: an experimental study with a mobile robot","date":"2024-09-23","arxiv_id":"2409.14867","n_code_links":0,"syntology":null},{"paper":null,"slug":"reinforcement-learning-for-rate-maximization","title":"Reinforcement Learning for Rate Maximization in IRS-aided OWC Networks","date":"2024-09-07","arxiv_id":"2409.04842","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimally-solving-simultaneous-move-dec","title":"Optimally Solving Simultaneous-Move Dec-POMDPs: The Sequential Central Planning Approach","date":"2024-08-23","arxiv_id":"2408.13139","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-state-action-reward-state-action","title":"The State-Action-Reward-State-Action Algorithm in Spatial Prisoner's Dilemma Game","date":"2024-06-25","arxiv_id":"2406.17326","n_code_links":0,"syntology":null},{"paper":"/paper/swiftrl-towards-efficient-reinforcement","slug":"swiftrl-towards-efficient-reinforcement","title":"SwiftRL: Towards Efficient Reinforcement Learning on Real Processing-In-Memory Systems","date":"2024-05-07","arxiv_id":"2405.03967","n_code_links":1,"syntology":null},{"paper":"/paper/research-on-robot-path-planning-based-on","slug":"research-on-robot-path-planning-based-on","title":"Research on Robot Path Planning Based on Reinforcement Learning","date":"2024-04-22","arxiv_id":"2404.14077","n_code_links":1,"syntology":null},{"paper":null,"slug":"state-separated-sarsa-a-practical-sequential","title":"State-Separated SARSA: A Practical Sequential Decision-Making Algorithm with Recovering Rewards","date":"2024-03-18","arxiv_id":"2403.11520","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-classification-performance-via","title":"Enhancing Classification Performance via Reinforcement Learning for Feature Selection","date":"2024-03-09","arxiv_id":"2403.05979","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-index-policy-based-on-sarsa-and-q-learning","title":"An Index Policy Based on Sarsa and Q-learning for Heterogeneous Smart Target Tracking","date":"2024-02-19","arxiv_id":"2402.12015","n_code_links":0,"syntology":null},{"paper":null,"slug":"using-reinforcement-learning-to-optimize","title":"Using Reinforcement Learning to Optimize Responses in Care Processes: A Case Study on Aggression Incidents","date":"2023-10-02","arxiv_id":"2310.00981","n_code_links":0,"syntology":null},{"paper":null,"slug":"career-path-recommendations-for-long-term","title":"Career Path Recommendations for Long-term Income Maximization: A Reinforcement Learning Approach","date":"2023-09-11","arxiv_id":"2309.05391","n_code_links":0,"syntology":null},{"paper":"/paper/exploring-reinforcement-learning-techniques","slug":"exploring-reinforcement-learning-techniques","title":"Exploring reinforcement learning techniques for discrete and continuous control tasks in the MuJoCo environment","date":"2023-07-20","arxiv_id":"2307.11166","n_code_links":1,"syntology":null},{"paper":null,"slug":"pcg-based-static-underground-garage-scenario","title":"PCG-based Static Underground Garage Scenario Generation","date":"2023-07-08","arxiv_id":"2307.03988","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergence-of-sarsa-with-linear-function","title":"Convergence of SARSA with linear function approximation: The random horizon case","date":"2023-06-07","arxiv_id":"2306.04548","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-modeling-network-slicing-communication","title":"On Modeling Network Slicing Communication Resources with SARSA Optimization","date":"2023-01-11","arxiv_id":"2301.04696","n_code_links":0,"syntology":null},{"paper":null,"slug":"analysis-of-reinforcement-learning-schemes","title":"Analysis of Reinforcement Learning Schemes for Trajectory Optimization of an Aerial Radio Unit","date":"2022-11-18","arxiv_id":"2211.10524","n_code_links":0,"syntology":null},{"paper":null,"slug":"slatefree-a-model-free-decomposition-for","title":"SlateFree: a Model-Free Decomposition for Reinforcement Learning with Slate Actions","date":"2022-09-05","arxiv_id":"2209.01876","n_code_links":0,"syntology":null},{"paper":"/paper/solving-royal-game-of-ur-using-reinforcement","slug":"solving-royal-game-of-ur-using-reinforcement","title":"Solving Royal Game of Ur Using Reinforcement Learning","date":"2022-08-23","arxiv_id":"2208.10669","n_code_links":2,"syntology":null},{"paper":null,"slug":"on-decentralizing-federated-reinforcement","title":"On Decentralizing Federated Reinforcement Learning in Multi-Robot Scenarios","date":"2022-07-19","arxiv_id":"2207.09372","n_code_links":0,"syntology":null},{"paper":"/paper/reinforced-lin-kernighan-helsgaun-algorithms","slug":"reinforced-lin-kernighan-helsgaun-algorithms","title":"Reinforced Lin-Kernighan-Helsgaun Algorithms for the Traveling Salesman Problems","date":"2022-07-08","arxiv_id":"2207.03876","n_code_links":1,"syntology":null},{"paper":null,"slug":"approximate-q-learning-and-sarsa-0-under-the","title":"Does DQN Learn?","date":"2022-05-26","arxiv_id":"2205.13617","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-chattering-of-sarsa-with-linear","title":"On the Convergence of SARSA with Linear Function Approximation","date":"2022-02-14","arxiv_id":"2202.06828","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-study-of-first-passage-time-minimization","title":"A study of first-passage time minimization via Q-learning in heated gridworlds","date":"2021-10-05","arxiv_id":"2110.02129","n_code_links":0,"syntology":null},{"paper":null,"slug":"camtuner-reinforcement-learning-based-system","title":"Enhancing Video Analytics Accuracy via Real-time Automated Camera Parameter Tuning","date":"2021-07-08","arxiv_id":"2107.03964","n_code_links":0,"syntology":null},{"paper":"/paper/reinforcement-learning-for-phy-layer","slug":"reinforcement-learning-for-phy-layer","title":"Reinforcement Learning for Physical Layer Communications","date":"2021-06-22","arxiv_id":"2106.11595","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-provably-efficient-model-free-algorithm-for","title":"A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes","date":"2021-06-03","arxiv_id":"2106.01577","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhanced-pub-sub-communications-for-massive","title":"Enhanced Pub/Sub Communications for Massive IoT Traffic with SARSA Reinforcement Learning","date":"2021-01-03","arxiv_id":"2101.00687","n_code_links":0,"syntology":null},{"paper":"/paper/combining-reinforcement-learning-with-lin","slug":"combining-reinforcement-learning-with-lin","title":"Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem","date":"2020-12-08","arxiv_id":"2012.04461","n_code_links":1,"syntology":null},{"paper":null,"slug":"obtain-employee-turnover-rate-and-optimal","title":"Obtain Employee Turnover Rate and Optimal Reduction Strategy Based On Neural Network and Reinforcement Learning","date":"2020-12-01","arxiv_id":"2012.00583","n_code_links":0,"syntology":null},{"paper":"/paper/solving-the-lunar-lander-problem-under","slug":"solving-the-lunar-lander-problem-under","title":"Solving The Lunar Lander Problem under Uncertainty using Reinforcement Learning","date":"2020-11-24","arxiv_id":"2011.11850","n_code_links":2,"syntology":null},{"paper":null,"slug":"chrome-dino-run-using-reinforcement-learning","title":"Chrome Dino Run using Reinforcement Learning","date":"2020-08-15","arxiv_id":"2008.06799","n_code_links":0,"syntology":null},{"paper":null,"slug":"using-reinforcement-learning-to-herd-a","title":"Using Reinforcement Learning to Herd a Robotic Swarm to a Target Distribution","date":"2020-06-29","arxiv_id":"2006.15807","n_code_links":0,"syntology":null},{"paper":null,"slug":"model-free-reinforcement-learning-for-1","title":"Model-free Reinforcement Learning for Stochastic Stackelberg Security Games","date":"2020-05-24","arxiv_id":"2005.11853","n_code_links":0,"syntology":null},{"paper":"/paper/flapai-bird-training-an-agent-to-play-flappy","slug":"flapai-bird-training-an-agent-to-play-flappy","title":"FlapAI Bird: Training an Agent to Play Flappy Bird Using Reinforcement Learning Techniques","date":"2020-03-21","arxiv_id":"2003.09579","n_code_links":2,"syntology":null},{"paper":null,"slug":"enhancing-the-monte-carlo-tree-search","title":"Enhancing the Monte Carlo Tree Search Algorithm for Video Game Testing","date":"2020-03-17","arxiv_id":"2003.07813","n_code_links":0,"syntology":null},{"paper":"/paper/reinforcement-learning-models-of-human","slug":"reinforcement-learning-models-of-human","title":"A Story of Two Streams: Reinforcement Learning Models from Human Behavior and Neuropsychiatry","date":"2019-06-21","arxiv_id":"1906.11286","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-q-learning-with-q-matrix-transfer","title":"Deep Q-Learning with Q-Matrix Transfer Learning for Novel Fire Evacuation Environment","date":"2019-05-23","arxiv_id":"1905.09673","n_code_links":0,"syntology":null},{"paper":null,"slug":"design-of-artificial-intelligence-agents-for","title":"Design of Artificial Intelligence Agents for Games using Deep Reinforcement Learning","date":"2019-05-10","arxiv_id":"1905.04127","n_code_links":0,"syntology":null},{"paper":null,"slug":"finite-sample-analysis-for-sarsa-and-q","title":"Finite-Sample Analysis for SARSA with Linear Function Approximation","date":"2019-02-06","arxiv_id":"1902.02234","n_code_links":0,"syntology":null},{"paper":"/paper/understanding-multi-step-deep-reinforcement","slug":"understanding-multi-step-deep-reinforcement","title":"Understanding Multi-Step Deep Reinforcement Learning: A Systematic Study of the DQN Target","date":"2019-01-22","arxiv_id":"1901.07510","n_code_links":1,"syntology":null},{"paper":null,"slug":"recursive-sparse-pseudo-input-gaussian","title":"Recursive Sparse Pseudo-input Gaussian Process SARSA","date":"2018-11-17","arxiv_id":"1811.07201","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-concept-of-criticality-in-reinforcement","title":"The Concept of Criticality in Reinforcement Learning","date":"2018-10-16","arxiv_id":"1810.07254","n_code_links":0,"syntology":null},{"paper":null,"slug":"smoothed-action-value-functions-for-learning","title":"Smoothed Action Value Functions for Learning Gaussian Policies","date":"2018-03-06","arxiv_id":"1803.02348","n_code_links":0,"syntology":null},{"paper":null,"slug":"reactive-reinforcement-learning-in","title":"Reactive Reinforcement Learning in Asynchronous Environments","date":"2018-02-16","arxiv_id":"1802.06139","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-approach-for-multi-step-temporal","title":"A Unified Approach for Multi-step Temporal-Difference Learning with Eligibility Traces in Reinforcement Learning","date":"2018-02-09","arxiv_id":"1802.03171","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-gaussian-policies-from-smoothed","title":"Learning Gaussian Policies from Smoothed Action Value Functions","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"uncertainty-estimates-for-efficient-neural","title":"Uncertainty Estimates for Efficient Neural Network-based Dialogue Policy Optimisation","date":"2017-11-30","arxiv_id":"1711.11486","n_code_links":0,"syntology":null},{"paper":null,"slug":"double-q-and-q-unifying-reinforcement","title":"Double Q($σ$) and Q($σ, λ$): Unifying Reinforcement Learning Control Algorithms","date":"2017-11-05","arxiv_id":"1711.01569","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comparison-of-reinforcement-learning","title":"A Comparison of Reinforcement Learning Techniques for Fuzzy Cloud Auto-Scaling","date":"2017-05-19","arxiv_id":"1705.07114","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-step-reinforcement-learning-a-unifying","title":"Multi-step Reinforcement Learning: A Unifying Algorithm","date":"2017-03-03","arxiv_id":"1703.01327","n_code_links":0,"syntology":null},{"paper":null,"slug":"online-transfer-learning-in-reinforcement","title":"Online Transfer Learning in Reinforcement Learning Domains","date":"2015-07-02","arxiv_id":"1507.00436","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergent-temporal-difference-learning-with","title":"Convergent Temporal-Difference Learning with Arbitrary Smooth Function Approximation","date":"2009-12-01","arxiv_id":null,"n_code_links":0,"syntology":null}],"papers_shown":56,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":56,"with_a_code_link":11,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":56,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":39},{"task":"/task/q-learning","name":"Q-Learning","papers":34},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":32},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":29},{"task":"/task/decision-making","name":"Decision Making","papers":5},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":5},{"task":"/task/continuous-control","name":"Continuous Control","papers":3},{"task":"/task/openai-gym","name":"OpenAI Gym","papers":3},{"task":"/task/continuous-control","name":"continuous-control","papers":3},{"task":"/task/combinatorial-optimization","name":"Combinatorial Optimization","papers":2},{"task":"/task/management","name":"Management","papers":2},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":2},{"task":"/task/traveling-salesman-problem","name":"Traveling Salesman Problem","papers":2},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":"/task/board-games","name":"Board Games","papers":1},{"task":null,"name":"CPU","papers":1},{"task":"/task/card-games","name":"Card Games","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/dialogue-management","name":"Dialogue Management","papers":1},{"task":"/task/efficient-exploration","name":"Efficient Exploration","papers":1}],"tasks_shown":20,"n_tasks":38,"usage_by_year":[{"year":"2009","papers":1},{"year":"2015","papers":1},{"year":"2017","papers":4},{"year":"2018","papers":6},{"year":"2019","papers":5},{"year":"2020","papers":8},{"year":"2021","papers":5},{"year":"2022","papers":7},{"year":"2023","papers":6},{"year":"2024","papers":10},{"year":"2025","papers":3}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/sarsa"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Sarsa","read_at":"2026-10-05T01:01:35+00:00","query":"Sarsa","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Sarsa' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["MI-SARSA","Implicit Q-Learning and SARSA"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"c68e4ac4f899845a2a3a4d4f0877ba778615d901d88212802b17e646aeae048e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}