<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1703.10593/</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/1703.10593/feed.xml" rel="self" type="application/rss+xml" /><item><title>Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks — mentioned by jeeceebees</title><link>https://news.ycombinator.com/item?id=19876780</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.10593:19876780</guid><pubDate>Fri, 10 May 2019 11:29:37 GMT</pubDate><description>&lt;p&gt;Would be even nicer if it could be trained on unpaired datasets (ala CycleGAN https://arxiv.org/abs/1703.10593).&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.10593/"&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>Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks — mentioned by soraki_soladead</title><link>https://news.ycombinator.com/item?id=18798190</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.10593:18798190</guid><pubDate>Tue, 01 Jan 2019 00:54:35 GMT</pubDate><description>&lt;p&gt;&amp;quot;Overfitting&amp;quot; would be a little more specific. Basically the task was easier to accomplish by memorizing the data than by generalizing. This was pretty clear from the original CycleGAN paper[0] (figure 4; bottom row) since it was generating trees in the exact positions of the source image where the map had no indication of tree placement. 0. https://arxiv.org/pdf/1703.10593v1.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.10593/"&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>Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks — HN submission</title><link>https://news.ycombinator.com/item?id=16071090</link><guid isPermaLink="false">urn:hackerpapers:submission:1703.10593:16071090</guid><pubDate>Thu, 04 Jan 2018 15:38:22 GMT</pubDate><description>&lt;p&gt;Unpaired Image-To-Image Translation Using Cycle-Consistent Adversarial Networks&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/1703.10593/"&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>Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks — mentioned by aisofteng</title><link>https://news.ycombinator.com/item?id=14010743</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.10593:14010743</guid><pubDate>Sat, 01 Apr 2017 06:01:29 GMT</pubDate><description>&lt;p&gt;Style transfer lies outside my specialization, so take my comment as speculation informed by intuition from variously related works that may not correctly carry over to this one. If you look at the nature of the transformations achieved in this paper, you might note that they are changes in, well, style. That is, the presentations of the objects in an image are represented using a different _style_, but they remain the same object. As an example, take a look at the horse/zebra transformation; the horse obtains a zebra&amp;#x27;s stripes, but it _structurally_ still looks like a horse. That is to say…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.10593/"&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>Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks — mentioned by wonderous</title><link>https://news.ycombinator.com/item?id=14004663</link><guid isPermaLink="false">urn:hackerpapers:mention:1703.10593:14004663</guid><pubDate>Fri, 31 Mar 2017 15:17:24 GMT</pubDate><description>&lt;p&gt;Direct link to research paper: https://arxiv.org/pdf/1703.10593.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1703.10593/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CV</category></item></channel></rss>
