<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Policy Gradient on giacolees - Tech Blog</title><link>https://giacolees.github.io/tags/policy-gradient/</link><description>Recent content in Policy Gradient on giacolees - Tech Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sat, 04 Apr 2026 12:14:26 +0200</lastBuildDate><atom:link href="https://giacolees.github.io/tags/policy-gradient/index.xml" rel="self" type="application/rss+xml"/><item><title>A gentle introduction to Reinforcement Learning</title><link>https://giacolees.github.io/posts/rl_intro/</link><pubDate>Sat, 04 Apr 2026 12:14:26 +0200</pubDate><guid>https://giacolees.github.io/posts/rl_intro/</guid><description>TL;DR Reinforcement learning is trial-and-error learning: an agent takes actions in an environment to maximize cumulative reward. The math backbone is the Markov Decision Process and the Bellman equation, which expresses a state's value recursively through its successors. Value-based methods estimate how good states (or state-action pairs) are — planning with dynamic programming when the model is known, learning from experience with Monte Carlo and Temporal Difference updates when it isn't — and act greedily with respect to those estimates (SARSA on-policy, Q-learning off-policy).</description></item></channel></rss>