Complex variational autoencoders admit K\"ahler structure
Andrew Gracyk

TL;DR
This paper explores the geometric structure of complex variational autoencoders, revealing they possess K"ahler geometry, and introduces efficient methods to leverage this structure for improved latent space regularization and sampling.
Contribution
It demonstrates that complex VAEs have an inherent K"ahler geometric structure and develops practical tools to utilize this geometry for better model regularization and sampling.
Findings
Complex VAEs exhibit K"ahler geometric structure.
Proposed a K"ahler potential proxy for Fisher information metric.
Regularization with decoder geometry improves sample smoothness.
Abstract
It has been discovered that latent-Euclidean variational autoencoders (VAEs) admit, in various capacities, Riemannian structure. We adapt these arguments but for complex VAEs with a complex latent stage. We show that complex VAEs reveal to some level K\"ahler geometric structure. Our methods will be tailored for decoder geometry. We derive the Fisher information metric in the complex case under a latent complex Gaussian with trivial relation matrix. It is well known from statistical information theory that the Fisher information coincides with the Hessian of the Kullback-Leibler (KL) divergence. Thus, the metric K\"ahler potential relation is exactly achieved under relative entropy. We propose a K\"ahler potential derivative of complex Gaussian mixtures that acts as a rough proxy to the Fisher information metric while still being faithful to the underlying K\"ahler geometry. Computation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Mechanics and Entropy · Morphological variations and asymmetry · Bayesian Methods and Mixture Models
