<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Structured Denoising Diffusion Models in Discrete State-Spaces · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2107.03006/</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/2107.03006/feed.xml" rel="self" type="application/rss+xml" /><item><title>Structured Denoising Diffusion Models in Discrete State-Spaces — mentioned by jaaustin</title><link>https://news.ycombinator.com/item?id=45644944</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.03006:45644944</guid><pubDate>Mon, 20 Oct 2025 15:19:18 GMT</pubDate><description>&lt;p&gt;To my knowledge this connection was first noted in 2021 in https://arxiv.org/abs/2107.03006 (page 5). We wanted to do text diffusion where you’d corrupt words to semantically similar words (like “quick brown fox” -&amp;gt; “speedy black dog”) but kept finding that masking was easier for the model to uncover. Historically this goes back even further to https://arxiv.org/abs/1904.09324, which made a generative MLM without framing it in diffusion math.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.03006/"&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>Structured Denoising Diffusion Models in Discrete State-Spaces — mentioned by thomasahle</title><link>https://news.ycombinator.com/item?id=44065834</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.03006:44065834</guid><pubDate>Thu, 22 May 2025 19:30:29 GMT</pubDate><description>&lt;p&gt;&amp;gt; Now, diffusion LMs take this idea further. BERT can recover 15% of masked tokens (&amp;quot;noise&amp;quot;), but why stop here. Let&amp;#x27;s train a model to recover texts with 30%, 50%, 90%, 100% of masked tokens. &amp;gt; Once you&amp;#x27;ve trained that, in order to generate something from scratch, you start by feeding the model all [MASK]s. It will generate you mostly gibberish, but you can take some tokens (let&amp;#x27;s say, 10%) at random positions and assume that these tokens are generated (&amp;quot;final&amp;quot;) This is clearly wrong. If you actually froze 10% of gibberish tokens, your output would be terrible! What you actually do in…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.03006/"&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>Structured Denoising Diffusion Models in Discrete State-Spaces — mentioned by jdeaton</title><link>https://news.ycombinator.com/item?id=33946509</link><guid isPermaLink="false">urn:hackerpapers:mention:2107.03006:33946509</guid><pubDate>Sun, 11 Dec 2022 19:22:44 GMT</pubDate><description>&lt;p&gt;Because of criteria 0, 1, 2 these entirely depend on the individual. However, some papers which fit the criteria for me at the time were the following: - Score-Based Generative Modeling through Stochastic Differential Equations https://arxiv.org/abs/2011.13456 - Structured Denoising Diffusion Models in Discrete State-Spaces https://arxiv.org/abs/2107.03006 - Efficient and Modular Implicit Differentiation https://arxiv.org/abs/2105.15183 - Scalable Gradients for Stochastic Differential Equations https://arxiv.org/abs/2001.01328 - Bayesian Optimization with Unknown Constraints…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2107.03006/"&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>
