<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Momentum-Based Policy Gradient with Second-Order Information · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2205.08253/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2205.08253/feed.xml" rel="self" type="application/rss+xml" /><item><title>Momentum-Based Policy Gradient with Second-Order Information — mentioned by namibj</title><link>https://news.ycombinator.com/item?id=39960272</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.08253:39960272</guid><pubDate>Sun, 07 Apr 2024 12:24:55 GMT</pubDate><description>&lt;p&gt;I wonder how it relates/compares to https://arxiv.org/abs/2205.08253 : Title: Momentum-Based Policy Gradient with Second-Order Information Abstract: Variance-reduced gradient estimators for policy gradient methods have been one of the main focus of research in the reinforcement learning in recent years as they allow acceleration of the estimation process. We propose a variance-reduced policy-gradient method, called SHARP, which incorporates second-order information into stochastic gradient descent (SGD) using momentum with a time-varying learning rate. SHARP algorithm is parameter-free…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.08253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item><item><title>Momentum-Based Policy Gradient with Second-Order Information — mentioned by namibj</title><link>https://news.ycombinator.com/item?id=38500573</link><guid isPermaLink="false">urn:hackerpapers:mention:2205.08253:38500573</guid><pubDate>Sat, 02 Dec 2023 18:12:18 GMT</pubDate><description>&lt;p&gt;Actually, selectively deleting facts like that does kinda work, essentially what you&amp;#x27;re doing is scolding-based reinforcement learning. For decent speed you&amp;#x27;d want to probably use variance-reduction techniques like https://arxiv.org/abs/2205.08253 , though. Or a related (would be linked as cited by/cited in the linked when you look on semantic scholar) method that doesn&amp;#x27;t compute a hessian-vector product (which apparently interacts poorly with the non-linearity of the multi-layer perceptrons as provided by LLM-typical ReLU), in exchange for e.g. sizable batching (gradient accumulation!) at…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2205.08253/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
