<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>CycleGAN, a Master of Steganography · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1712.02950/</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/1712.02950/feed.xml" rel="self" type="application/rss+xml" /><item><title>CycleGAN, a Master of Steganography — mentioned by alwa</title><link>https://news.ycombinator.com/item?id=49994533</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.02950:49994533</guid><pubDate>Wed, 07 Oct 2026 15:49:50 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/1712.02950 (2017) …if you’re curious and missed that one like I did. Snack-sized paper with lots of satisfying visual examples.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.02950/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>CycleGAN, a Master of Steganography — mentioned by nneonneo</title><link>https://news.ycombinator.com/item?id=47259890</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.02950:47259890</guid><pubDate>Thu, 05 Mar 2026 10:12:53 GMT</pubDate><description>&lt;p&gt;Somewhat annoyingly, there&amp;#x27;s been research that suggests that models can pass information to each other via (effectively) steganographic techniques - specific but apparently harmless choices of tokens, wordings, and so on; see https://arxiv.org/abs/1712.02950 and https://alignment.anthropic.com/2025/subliminal-learning/ for some simple examples. While it feels unlikely that a simple &amp;quot;write this spec from this code&amp;quot; + &amp;quot;write this code from this spec&amp;quot; loop would actually trigger this kind of hiding behaviour, an LLM trained to accurately reproduce code from such a loop definitely would be…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.02950/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>CycleGAN, a Master of Steganography — mentioned by Calavar</title><link>https://news.ycombinator.com/item?id=44835762</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.02950:44835762</guid><pubDate>Fri, 08 Aug 2025 11:24:47 GMT</pubDate><description>&lt;p&gt;&amp;gt; Researchers had observed similar patterns in BERT, where &amp;quot;a surprisingly large amount of attention focuses on the delimiter token [SEP] and periods,&amp;quot; which they argued was used by the model as a sort of no-op. The same summer at Meta, researchers studying vision transformers found similar behavior, observing that models would repurpose uninformative background patches as computational scratchpads. This seems to go beyond just transformers. For example, I recall reading a paper a while ago that showed a similar effect in an image to image model with a GAN/U-Net architecture [1]. [1]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.02950/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>CycleGAN, a Master of Steganography — mentioned by wizzwizz4</title><link>https://news.ycombinator.com/item?id=41476502</link><guid isPermaLink="false">urn:hackerpapers:mention:1712.02950:41476502</guid><pubDate>Sat, 07 Sep 2024 21:14:10 GMT</pubDate><description>&lt;p&gt;&amp;gt; You could even get GPT to generate it This isn&amp;#x27;t a good idea, if you want a fair test. See https://gwern.net/doc/reinforcement-learning/safe/2023-krako..., specifically https://arxiv.org/abs/1712.02950.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1712.02950/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>CycleGAN, a Master of Steganography — HN submission</title><link>https://news.ycombinator.com/item?id=18819633</link><guid isPermaLink="false">urn:hackerpapers:submission:1712.02950:18819633</guid><pubDate>Thu, 03 Jan 2019 21:48:23 GMT</pubDate><description>&lt;p&gt;CycleGAN, a Master of Steganography&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1712.02950/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item><item><title>CycleGAN, a Master of Steganography — HN submission</title><link>https://news.ycombinator.com/item?id=18805279</link><guid isPermaLink="false">urn:hackerpapers:submission:1712.02950:18805279</guid><pubDate>Wed, 02 Jan 2019 10:15:24 GMT</pubDate><description>&lt;p&gt;CycleGAN, a Master of Steganography [2017]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1712.02950/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item></channel></rss>
