<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Boolformer: Symbolic Regression of Logic Functions with Transformers · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2309.12207/</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/2309.12207/feed.xml" rel="self" type="application/rss+xml" /><item><title>Boolformer: Symbolic Regression of Logic Functions with Transformers — mentioned by famouswaffles</title><link>https://news.ycombinator.com/item?id=38322182</link><guid isPermaLink="false">urn:hackerpapers:mention:2309.12207:38322182</guid><pubDate>Sat, 18 Nov 2023 17:46:13 GMT</pubDate><description>&lt;p&gt;&amp;gt;ChatGPT has a model of all the text information on the internet, but it remains to be seen what the hard limits of this model are. Before training is complete and loss is maxed, there will be limits on what the &amp;quot;learned so far&amp;quot; model can do that say absolutely nothing about the limits of a perfect(or very close to it) model. It really looks like anything will converge with enough compute. I don&amp;#x27;t think architecture is particularly important except as &amp;quot;how much compute will this one take?&amp;quot; question. https://nonint.com/2023/06/10/the-it-in-ai-models-is-the-dat... &amp;gt;Does this model let it do…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2309.12207/"&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>Boolformer: Symbolic Regression of Logic Functions with Transformers — HN submission</title><link>https://news.ycombinator.com/item?id=37743686</link><guid isPermaLink="false">urn:hackerpapers:submission:2309.12207:37743686</guid><pubDate>Mon, 02 Oct 2023 20:02:41 GMT</pubDate><description>&lt;p&gt;Boolformer: Symbolic Regression of Logic Functions with Transformers&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2309.12207/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
