New framework for disentangling graph node and edge features.
problem Learning disentangled representations for attributed graphs with node and edge features.
method Proposes a novel variational objective and architecture for node and edge deconvolutions to disentangle latent factors.
result Demonstrates effectiveness of the proposed model and its extensions on synthetic and real-world datasets.
CoMGNN models heterogeneous graphs with evolving nodes and edges.
problem Modeling complex, evolving graphs with diverse information.
method Meta graph attention on co-evolving heterogeneous graphs.
result Significant improvement over state-of-the-art methods.
BWFlow improves graph generation by smoothly interpolating graph components.
problem Disjoint modeling of graph nodes and edges leads to irregular and non-smooth probability paths.
method Modeling graphs as MRFs and using optimal transport displacement for a smooth probability path.
result BWFlow achieves better training convergence and efficient sampling in graph generation.
Graphs are ubiquitous real-world data structures, and generative models that approximate distributions over graphs and derive new samples from them have significant importance. Among the known challenges in graph generation tasks, scalability handling of large graphs and datasets is one of the most important for practi…
New method for embedding large networks without attributes, achieving state-of-the-art performance.
problem Learning embeddings from large-scale networks without domain-dependent attributes.
method Use predefined local encodings based on node degree frequencies at different distances.
result Inductive network embeddings generalize well across unseen or distant regions in the network.
We propose the factorized action variational autoencoder (FAVAE), a state-of-the-art generative model for learning disentangled and interpretable representations from sequential data via the information bottleneck without supervision. The purpose of disentangled representation learning is to obtain interpretable and tr…
Improved disentanglement in VAEs using aggregated feature maps.
problem Improving disentanglement in Variational Autoencoders (VAEs).
method Regionally aggregated feature maps extracted from pre-trained CNNs on ImageNet.
result 2nd place in NeurIPS 2019 disentanglement challenge.
To evaluate disentangled representations several metrics have been proposed. However, theoretical guarantees for conventional metrics of disentanglement are missing. Moreover, conventional metrics do not have a consistent correlation with the outcomes of qualitative studies. In this paper we analyze metrics of disentan…
New technique learns causally disentangled representations for better generation.
problem Learning disentangled representations for accurate generation.
method Causally Disentangled Generation (CDG) approach with supervised regularization.
result CDG is necessary and sufficient for accurate disentangled generation.
Disentangled representations, where the higher level data generative factors are reflected in disjoint latent dimensions, offer several benefits such as ease of deriving invariant representations, transferability to other tasks, interpretability, etc. We consider the problem of unsupervised learning of disentangled rep…
Improved disentanglement through learned feature aggregation.
problem Disentangling latent factors in images.
method Variational autoencoder trained on regionally aggregated feature maps from ImageNet.
result 2nd place in NeurIPS 2019 disentanglement challenge.
We analyze disentangled representations under a causal generative process, proposing new metrics and datasets.
problem Addressing fairness and interpretability through disentangled representations with a causal perspective.
method Work under a causal generative process, proposing new metrics and datasets to study disentanglement.
result Proposed metrics capture the desiderata of disentangled causal process.
New framework learns disentangled causal representations from observed labels.
problem Learning meaningful disentangled causal representations from observed data.
method ICM-VAE framework using flow-based diffeomorphic functions and causal disentanglement prior.
result Induces highly disentangled causal factors and improves robustness.
Proposes a new method for disentangling data representations using topological analysis.
problem Learning disentangled representations for better model explainability and robustness.
method Integrates a multi-scale topological loss term into the training of deep learning models.
result Improves disentanglement scores compared to state-of-the-art methods.
A new method for disentangling action sequences improves model stability.
problem Challenges in unsupervised disentanglement learning due to incomplete theories and abstract notions.
method Introducing disentangling action sequences and a novel fractional variational autoencoder (FVAE) framework.
result FVAE improves the stability of disentanglement for action sequences.
GCAE uses density estimation to achieve reliable disentanglement in latent space.
problem Disentangled learning representations suffer from reliability issues.
method GCAE uses Gaussian Channel Autoencoder with Dual Total Correlation (DTC) to avoid the curse of dimensionality.
result GCAE achieves highly competitive and reliable disentanglement scores.
The paper connects disentanglement to manifold charts and commutativity.
problem Discovering local charts of the data manifold for disentanglement.
method Interpreting disentanglement as local charts of the data manifold and studying commutativity.
result Commutativity is a central property in disentanglement, as shown in manifold, group theoretic, and probabilistic frameworks.
Sparse incidence tensors can represent a variety of structured data. For example, we may represent attributed graphs using their node-node, node-edge, or edge-edge incidence matrices. In higher dimensions, incidence tensors can represent simplicial complexes and polytopes. In this paper, we formalize incidence tensors,…
Improved VAE learns disentangled representations with less supervision.
problem Learning disentangled representations is challenging.
method Semi-supervised disentanglement learning with label replacement.
result Significant improvement in disentanglement with minimal supervision.
New metric for disentangling multivariate representations, accounting for more complex entanglements.
problem Current disentanglement metrics fail to detect entanglements involving more than two variables.
method Partial Information Decomposition framework to analyze information sharing and propose a new disentanglement metric.
result The proposed metric correctly identifies entanglements in high-dimensional spaces.
Improved disentanglement of data factors using recursive training.
problem Current unsupervised disentanglement methods are inconsistent and fail to achieve levels of disentanglement seen in supervised approaches.
method Introduced PBT for VAEs, used UDR for heuristic scoring, and developed recursive rPU-VAE approach.
result Recursive training leads to robust disentanglement of data factors across multiple datasets.
We define and address the problem of unsupervised learning of disentangled representations on data generated from independent factors of variation. We propose FactorVAE, a method that disentangles by encouraging the distribution of representations to be factorial and hence independent across the dimensions. We show tha…
New method learns disentangled discrete representations using categorical variational autoencoders.
problem Learning disentangled representations from discrete latent spaces.
method Replaced standard Gaussian VAE with a categorical VAE to mitigate rotational invariance.
result Categorical distributions improve learning of disentangled representations.
Disentangled representations have recently been shown to improve fairness, data efficiency and generalisation in simple supervised and reinforcement learning tasks. To extend the benefits of disentangled representations to more complex domains and practical applications, it is important to enable hyperparameter tuning …
Method quantifies disentanglement of generative models using manifold topology.
problem Challenging and inconsistent measurement of disentanglement in generative models.
method Measures topological similarity of conditional submanifolds in learned representation.
result Method ranks models similarly to existing methods across multiple datasets.
A generative model with a disentangled representation allows for independent control over different aspects of the output. Learning disentangled representations has been a recent topic of great interest, but it remains poorly understood. We show that even for GANs that do not possess disentangled representations, one c…
Linear disentangled representations improve unsupervised action estimation.
problem Learning linear disentangled representations for unsupervised action estimation.
method Developed a method to induce irreducible representations in VAE models without labeled action sequences.
result Linear disentangled representations are a desirable property for unsupervised action estimation.
C2VAE learns disentangled and coupled representations without prior knowledge.
problem Learning disentangled and coupled representations in latent space.
method Introduces C2VAE, a self-supervised VAE that factorizes posterior and uses Gaussian copula for dependencies. result Demonstrates strong effect in enhancing disentangled representation learning.
This paper critically examines unsupervised disentangled representation learning, revealing challenges and limitations.
problem The difficulty of unsupervised learning of disentangled representations and the challenges in evaluation metrics.
method Theoretical analysis and a large-scale experimental study covering 8 datasets and 14000 models.
result Well-disentangled models cannot be identified without supervision, and different evaluation metrics disagree on what constitutes disentanglement.
Simple method disentangles content and style from pre-trained vision models.
problem Learning interpretable features in visual representations.
method Probabilistic linear entanglement model and simple disentanglement algorithm.
result Method provably disentangles content and style features.
Unsupervised mesh disentanglement separates identity and pose.
problem Geometric disentanglement for 3D deformable models.
method CFAN-VAE architecture using conformal factor and normal features.
result CFAN-VAE achieves state-of-the-art performance on unsupervised geometric disentanglement.
Study evaluates scalability and real-world impact of disentangled representations.
problem Scalability and real-world impact of disentangled representations.
method New high-resolution dataset and architectures for disentangled representation learning.
result Disentanglement predicts out-of-distribution task performance.
We propose orthogonality as a necessary condition for disentangling aleatoric and epistemic uncertainty.
problem Jointly estimating aleatoric and epistemic uncertainty is problematic and non-trivial.
method We propose orthogonality as a necessary condition for disentanglement and construct UDE to measure orthogonality and consistency.
result Orthogonality and consistency are necessary and sufficient criteria for disentanglement.
Disentangled representations naturally emerge in multi-task learning.
problem Finding adaptable representations for multiple tasks.
method Empirical study of neural networks trained on automatically generated supervised tasks.
result Disentanglement naturally occurs during multi-task learning.
We make two theoretical contributions to disentanglement learning by (a) defining precise semantics of disentangled representations, and (b) establishing robust metrics for evaluation. First, we characterize the concept "disentangled representations" used in supervised and unsupervised methods along three dimensions-in…
Learning to disentangle the hidden factors of variations within a set of observations is a key task for artificial intelligence. We present a unified formulation for class and content disentanglement and use it to illustrate the limitations of current methods. We therefore introduce LORD, a novel method based on Latent…
DGA and DVGA learn disentangled graph representations to improve graph analysis.
problem Holistic graph auto-encoders fail to capture latent factors effectively.
method Design disentangled graph convolutional network and component-wise flow, impose independence constraints.
result Improved disentangled graph representations enhance graph analysis tasks.
Boxhead dataset tests autoencoder disentanglement in hierarchical data.
problem Evaluate disentanglement in hierarchical data.
method Introduced Boxhead dataset with hierarchically structured factors, evaluated autoencoder models.
result Hierarchical models outperform single-layer VAEs in disentangling factors.
This work shows how disentangled and sparse representations improve multi-task learning.
problem Improving generalization in multi-task learning with disentangled and sparse representations.
method Proved a new identifiability result and proposed a practical approach using sparsity-promoting bi-level optimization.
result Maximally sparse base-predictors yield disentangled representations under certain conditions.
We define disentanglement in generative models and prove it's related to identifiable factors.
problem Understanding disentanglement in generative models like VAEs and GANs.
method Characterized disentanglement in smooth generative pushforward models using the SVD of the Jacobian.
result Disentanglement is identifiable under certain conditions on the generator, promoting separable factors.
GCVAE improves disentanglement in VAEs while balancing reconstruction error.
problem Improving disentanglement in VAEs while maintaining low reconstruction error.
method Introduces three controllable Lagrangian hyperparameters to optimize reconstruction and KL divergence loss.
result GCVAE outperforms state-of-the-art models in disentanglement while balancing reconstruction.
A new VAE model improves disentanglement with identifiable latent factors.
problem Learning disentangled representations without inductive biases.
method A novel VAE with a conditional prior over latent variables.
result Superior performance in disentanglement metrics.
Proposes TCWAE to learn disentangled representations using the Wasserstein Autoencoder.
problem Balancing reconstruction fidelity and disentanglement in learning representations.
method TCWAE (Total Correlation Wasserstein Autoencoder) using different KL estimators.
result Competitive results on data sets with known generative factors, and improved reconstructions on unknown factors.
DynamicVAE improves disentanglement and reconstruction accuracy without sacrificing one for the other.
problem The inherent trade-off between disentanglement and reconstruction accuracy in VAE models.
method DynamicVAE uses a modified incremental PI controller to dynamically adjust the weight β during training, decoupling disentanglement and reconstruction accuracy.
result DynamicVAE significantly improves reconstruction accuracy while maintaining disentanglement comparable to existing methods.
New definition of disentanglement for non-independent factors of variation.
problem Current disentanglement definitions assume independent factors of variation, limiting their applicability.
method Definition based on information theory, related to Information Bottleneck Method, proposed measurement method.
result Proposed method correctly measures disentanglement with non-independent factors of variation.
The notion of disentangled autoencoders was proposed as an extension to the variational autoencoder by introducing a disentanglement parameter β, controlling the learning pressure put on the possible underlying latent representations. For certain values of β this kind of autoencoders is capable of encoding independ…
A crucial problem in learning disentangled image representations is controlling the degree of disentanglement during image editing, while preserving the identity of objects. In this work, we propose a simple yet effective model with the encoder-decoder architecture to address this challenge. To encourage disentanglemen…
Disentangled generative models map a latent code vector to a target space, while enforcing that a subset of the learned latent codes are interpretable and associated with distinct properties of the target distribution. Recent advances have been dominated by Variational AutoEncoder (VAE)-based methods, while training di…