Skip to content

Idempotent generative network – faster alternative to GAN

assafshocher.github.io
2 pointsToJans1 comment
On HN

Comments

I was curious how they avoid trivial idempotent functions like f(x) = x and it turns out that when they apply the network twice to an image of random noise to check for idempotence, the first instance of the network is rewarded for producing something that isn't changed much by the second instance (encouraging idempotence) but the second instance is punished for not changing an image that was produced by the first instance instead of being sampled from the ground truth (discouraging idempotence).

This technique has a GAN-like adversarial flavor to it, complete with stability issues due to competing objectives. Still, amazing that it works at all.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.