Geometry of Deep Generative Models for Disentangled Representations
Autor: | Ankita Shukla, Saket Anand, Shagun Uppal, Sarthak Bhagat, Pavan Turaga |
---|---|
Rok vydání: | 2018 |
Předmět: |
FOS: Computer and information sciences
Computer Science::Machine Learning Computer science Computer Vision and Pattern Recognition (cs.CV) Computer Science - Computer Vision and Pattern Recognition Geometry 02 engineering and technology 010501 environmental sciences Riemannian geometry Space (mathematics) Curvature 01 natural sciences Autoencoder Statistics::Machine Learning symbols.namesake Metric (mathematics) 0202 electrical engineering electronic engineering information engineering symbols Embedding 020201 artificial intelligence & image processing Invariant (mathematics) Feature learning 0105 earth and related environmental sciences |
Zdroj: | ICVGIP |
Popis: | Deep generative models like variational autoencoders approximate the intrinsic geometry of high dimensional data manifolds by learning low-dimensional latent-space variables and an embedding function. The geometric properties of these latent spaces has been studied under the lens of Riemannian geometry; via analysis of the non-linearity of the generator function. In new developments, deep generative models have been used for learning semantically meaningful `disentangled' representations; that capture task relevant attributes while being invariant to other attributes. In this work, we explore the geometry of popular generative models for disentangled representation learning. We use several metrics to compare the properties of latent spaces of disentangled representation models in terms of class separability and curvature of the latent-space. The results we obtain establish that the class distinguishable features in the disentangled latent space exhibits higher curvature as opposed to a variational autoencoder. We evaluate and compare the geometry of three such models with variational autoencoder on two different datasets. Further, our results show that distances and interpolation in the latent space are significantly improved with Riemannian metrics derived from the curvature of the space. We expect these results will have implications on understanding how deep-networks can be made more robust, generalizable, as well as interpretable. Accepted at ICVGIP, 2018 |
Databáze: | OpenAIRE |
Externí odkaz: |