Timezone: »
Learning disentangled representations is important for unraveling the underlying complex interactions between latent generative factors. Disentanglement has been formalized using a symmetry-centric notion for unstructured spaces, however, graphs have eluded a similarly rigorous treatment. We fill this gap with a new notion of conditional symmetry for disentanglement, and leverage tools from Lie algebras to encode graph properties into subgroups using suitable adaptations of generative models such as Variational Autoencoders. Unlike existing works on disentanglement, the proposed models segregate the latent space into uncoupled and entangled parts. Experiments on synthetic and real datasets suggest that these models can learn effective disengaged representations, and improve performance on downstream tasks such as few-shot classification and molecular generation.
Author Information
Giangiacomo Mercatali (University of Manchester)
Andre Freitas (University of Manchester)
Vikas Garg (Aalto University/YaiYai Ltd)
More from the Same Authors
-
2022 : Modular Flows: Differential Molecular Generation »
Yogesh Verma · Samuel Kaski · Markus Heinonen · Vikas Garg -
2022 : Provably expressive temporal graph networks »
Amauri Souza · Diego Mesquita · Samuel Kaski · Vikas Garg -
2022 : Modular Flows: Differential Molecular Generation »
Yogesh Verma · Samuel Kaski · Markus Heinonen · Vikas Garg -
2022 Spotlight: Are GANs overkill for NLP? »
David Alvarez-Melis · Vikas Garg · Adam Kalai -
2022 : Panel »
Vikas Garg · Pan Li · Srijan Kumar · Emanuele Rossi · Shenyang Huang -
2022 : KeyNote 3 by Vikas Garg: Provably Powerful Temporal Graph Networks »
Vikas Garg -
2022 Poster: Modular Flows: Differential Molecular Generation »
Yogesh Verma · Samuel Kaski · Markus Heinonen · Vikas Garg -
2022 Poster: Are GANs overkill for NLP? »
David Alvarez-Melis · Vikas Garg · Adam Kalai -
2022 Poster: Provably expressive temporal graph networks »
Amauri Souza · Diego Mesquita · Samuel Kaski · Vikas Garg -
2019 Poster: Solving graph compression via optimal transport »
Vikas Garg · Tommi Jaakkola -
2019 Poster: Generative Models for Graph-Based Protein Design »
John Ingraham · Vikas Garg · Regina Barzilay · Tommi Jaakkola -
2019 Poster: Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms »
Vikas Garg · Tamar Pichkhadze -
2018 Poster: Learning SMaLL Predictors »
Vikas Garg · Ofer Dekel · Lin Xiao -
2018 Poster: Supervising Unsupervised Learning »
Vikas Garg · Adam Kalai -
2018 Spotlight: Supervising Unsupervised Learning »
Vikas Garg · Adam Kalai -
2016 Poster: Learning Tree Structured Potential Games »
Vikas Garg · Tommi Jaakkola