Awesome-Mirrors/cyber-security-resources
1
0
Fork 0
mirror of https://github.com/The-Art-of-Hacking/h4cker.git synced 2024-09-15 22:02:24 +00:00
Code Issues Packages Projects Releases Wiki Activity
52e0759a6e
cyber-security-resources/ai_research/ML_Fundamentals/ai_generated/data/SARSA.md
Omar Santos 52e0759a6e updating ai_generated
2023-09-05 00:32:35 -04:00

3.2 KiB
Raw Blame History

SARSA: An Introduction to Reinforcement Learning

Reinforcement Learning (RL) is a subfield of machine learning concerned with training agents to make decisions in an environment, maximizing a notion of cumulative reward. One popular RL method is SARSA, which stands for State-Action-Reward-State-Action. SARSA is an on-policy, model-free control algorithm with applications ranging from robotics to game playing.

The Basic Idea

SARSA utilizes a table, often called a Q-table, to estimate the value of each state-action pair. The Q-table maps the state-action pairs to a numeric value representing the expected cumulative reward. The algorithm aims to learn the optimal policy, which is the sequence of actions that yields the highest cumulative reward over time.

The SARSA Algorithm

The SARSA algorithm is relatively simple to understand, making it a popular choice for introductory RL tutorials. Here is a step-by-step breakdown of the algorithm:

  1. Initialize the Q-table with small random values.
  2. Observe the current state s.
  3. Choose an action a using an exploration-exploitation trade-off strategy (such as ε-greedy).
  4. Perform the chosen action a in the environment.
  5. Observe the reward r and the new state s'.
  6. Choose a new action a' for the new state s' using the same exploration-exploitation strategy.
  7. Update the Q-table value for the state-action pair (s, a) using the update rule:
Q(s,a) = Q(s,a) + α⋅[R + γ⋅Q(s',a') - Q(s,a)]

where:

  • α is the learning rate, controlling the weight given to the new information.
  • R is the observed reward for the state-action pair.
  • γ is the discount factor, determining the importance of future rewards.
  1. Set the current state and action to the new state and action determined above (i.e., s = s' and a = a').
  2. Repeat steps 2 to 8 until the agent reaches a terminal state or a predefined number of iterations.

Advantages and Limitations

SARSA has several advantages that contribute to its popularity:

  • Simplicity: SARSA is relatively easy to understand and implement, making it a great starting point for beginners.
  • On-policy: It learns and improves the policy it follows while interacting with the environment, making it robust to changes in policy during training.
  • Works with continuous state and action spaces: Unlike some other RL algorithms, SARSA can handle continuous state and action spaces effectively.

However, SARSA also has a few limitations:

  • Less efficient for large state spaces: SARSA's reliance on a Q-table becomes impractical when the state space is exceptionally large, as it would require significant memory resources.
  • Struggles with high-dimensional or continuous action spaces: SARSA struggles in situations where the number of possible actions is large or continuous, as the action-state value function becomes difficult to approximate accurately.

Conclusion

SARSA is a fundamental reinforcement learning algorithm that provides an introduction to the field. Although it may have limitations in certain scenarios, SARSA is a valuable tool with various applications. As machine learning research continues to evolve, SARSA's simplicity and intuition make it an essential algorithm for studying reinforcement learning.