<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Trust Region on Chen Kai Blog</title><link>https://www.chenk.top/en/tags/trust-region/</link><description>Recent content in Trust Region on Chen Kai Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 26 Aug 2025 09:00:00 +0000</lastBuildDate><atom:link href="https://www.chenk.top/en/tags/trust-region/index.xml" rel="self" type="application/rss+xml"/><item><title>Reinforcement Learning (6): PPO and TRPO — Trust Region Policy Optimization</title><link>https://www.chenk.top/en/reinforcement-learning/06-ppo-and-trpo/</link><pubDate>Tue, 26 Aug 2025 09:00:00 +0000</pubDate><guid>https://www.chenk.top/en/reinforcement-learning/06-ppo-and-trpo/</guid><description>&lt;p>Policy gradients (&lt;a href="https://www.chenk.top/en/reinforcement-learning/03-policy-gradient-and-actor-critic/">Part 3&lt;/a>
) optimise the policy directly, sidestepping discrete &lt;code>argmax&lt;/code> operators and naturally handling stochastic strategies. They have one fatal flaw: &lt;strong>a single overlong step can destroy the policy&lt;/strong>, and because the data distribution is &lt;em>coupled&lt;/em> to the policy, recovery is nearly impossible.&lt;/p>
&lt;p>&lt;strong>Trust-region methods&lt;/strong> make this concrete: bound the change in &lt;em>behaviour&lt;/em>, not in parameters, at every update. TRPO does this with a hard KL constraint and a second-order solver. PPO mimics the same effect with one line of clipped arithmetic. The simpler trick won: PPO trains OpenAI Five, ChatGPT&amp;rsquo;s RLHF stage, and almost every modern robotics policy, remaining the workhorse of applied deep RL.&lt;/p></description></item></channel></rss>