<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Learning Formal Mathematics From Intrinsic Motivation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2407.00695/</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/2407.00695/feed.xml" rel="self" type="application/rss+xml" /><item><title>Learning Formal Mathematics From Intrinsic Motivation — mentioned by nielstron</title><link>https://news.ycombinator.com/item?id=43981352</link><guid isPermaLink="false">urn:hackerpapers:mention:2407.00695:43981352</guid><pubDate>Wed, 14 May 2025 06:08:47 GMT</pubDate><description>&lt;p&gt;we were thinking about doing exactly this, the closest current work is probably the amazing &amp;quot;Learning Formal Mathematics from Intrinsic Motivation&amp;quot; by Poesia et al (they use constraints too increase the likelihood of generating correct theorems/proofs during RL) https://arxiv.org/abs/2407.00695&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2407.00695/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
