<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Deep Differentiable Logic Gate Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2210.08277/</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/2210.08277/feed.xml" rel="self" type="application/rss+xml" /><item><title>Deep Differentiable Logic Gate Networks — mentioned by thesz</title><link>https://news.ycombinator.com/item?id=46073645</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08277:46073645</guid><pubDate>Thu, 27 Nov 2025 22:10:12 GMT</pubDate><description>&lt;p&gt;SparseCores appear to be block-sparse as opposed to element-sparse. They use 8- and 16-wide vectors to compute. Here&amp;#x27;s another inference-efficient architecture where TPUs are useless: https://arxiv.org/pdf/2210.08277 There is no matrix-vector multiplication. Parameters are estimated using Gumbel-Softmax. TPUs are of no use here. Inference is done bit-wise and most efficient inference is done after application of boolean logic simplification algorithms (ABC or mockturtle). In my (not so) humble opinion, TPUs are example case of premature optimization.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08277/"&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>Deep Differentiable Logic Gate Networks — mentioned by calebh</title><link>https://news.ycombinator.com/item?id=46015490</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08277:46015490</guid><pubDate>Sat, 22 Nov 2025 15:30:53 GMT</pubDate><description>&lt;p&gt;Yes, you can relax logic gates into continuous versions which makes the system differentiable. An AND gate can be constructed with the function x*y and NOT by 1-x (on inputs in the range [0,1]. From there you can construct a NAND gate, which is universal and can be used to construct all other gates. Sigmoid can be used to squash the inputs into [0,1] if necessary. This paper lists out all 16 possible logic gates in Table 1 if you&amp;#x27;re interested in this sort of thing: https://arxiv.org/abs/2210.08277&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08277/"&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>Deep Differentiable Logic Gate Networks — mentioned by andy12_</title><link>https://news.ycombinator.com/item?id=44124204</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08277:44124204</guid><pubDate>Thu, 29 May 2025 08:51:46 GMT</pubDate><description>&lt;p&gt;I also worked a long time ago in recreating the original Deep Differentiable Logic Network paper [1], so I have a couple of additions to make. &amp;gt; I wanted to see if I could learn the wires in addition to the gates. I still think it’s possible, but it’s something I had to abandon to get the model to converge. Actually, I read some other paper where they also learned the wiring, but they did so by alternating the training of the gates and the wires (in some iterations they learned the wiring while keeping the gates frozen, and in other they learned the gates while keeping the wiring frozen). The…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08277/"&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>Deep Differentiable Logic Gate Networks — mentioned by enricozb</title><link>https://news.ycombinator.com/item?id=44118846</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08277:44118846</guid><pubDate>Wed, 28 May 2025 18:01:34 GMT</pubDate><description>&lt;p&gt;Differentiable Logic Gate Networks [0] are super interesting. However, I still don&amp;#x27;t like that the wiring is fixed initially rather than learned. I did some extremely rough research into doing learnable wirings [1], but couldn&amp;#x27;t get past even learning ~4-bit addition. [0]: https://arxiv.org/abs/2210.08277 [1]: https://ezb.io/thoughts/program_synthesis/boolean_circuits/2...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08277/"&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>Deep Differentiable Logic Gate Networks — mentioned by gwern</title><link>https://news.ycombinator.com/item?id=41639841</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08277:41639841</guid><pubDate>Tue, 24 Sep 2024 19:07:57 GMT</pubDate><description>&lt;p&gt;The original cited paper https://arxiv.org/abs/2210.08277 &amp;quot;Deep Differentiable Logic Gate Networks&amp;quot; struck me then as very clever, ultra-efficient/small, hardly any inductive bias or prior... But you have to wonder if it&amp;#x27;s able to scale reasonably well. Differentiating continuous versions of 16 discrete operations in parallel sounds expensive, especially since you presumably need a bunch of them chained in order to approximate a single neural primitive. Even distilling an existing LLM down might be too hard.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08277/"&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>Deep Differentiable Logic Gate Networks — mentioned by pmg</title><link>https://news.ycombinator.com/item?id=38670158</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08277:38670158</guid><pubDate>Sun, 17 Dec 2023 03:44:34 GMT</pubDate><description>&lt;p&gt;Curious what approach you’re using. I did some work replicating this paper on an arty7 fpga: https://arxiv.org/abs/2210.08277 - any similarities?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08277/"&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>Deep Differentiable Logic Gate Networks — mentioned by dpflan</title><link>https://news.ycombinator.com/item?id=34742990</link><guid isPermaLink="false">urn:hackerpapers:mention:2210.08277:34742990</guid><pubDate>Fri, 10 Feb 2023 17:41:29 GMT</pubDate><description>&lt;p&gt;If you&amp;#x27;re into logic gates and deep learning: - Deep Differentiable Logic Gate Networks (https://arxiv.org/pdf/2210.08277.pdf) - Video presentation: Deep Differentiable Logic Gate Networks (https://www.youtube.com/watch?v=VulM891DhI4)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2210.08277/"&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>
