> Not worth it to compute the embedding for Indy

If IP holders submit embeddings for their IP, how can image generators "warp" the latent space around a set of embeddings so that future inferences slide around and avoid them--not perfectly, or literally, but as a function of distance, say, following a power curve?

Maybe by "Finding non-linear RBF paths in GAN latent space"[0] to create smooth detours around protected regions.

0. https://openaccess.thecvf.com/content/ICCV2021/papers/Tzelep...