AN2VEC disentangles feature and structural information in social networks.
problem Difficulty in separating feature and structural information in social networks.
method Graph Convolutional Networks (GCN) Variational Autoencoder for disentangled node embeddings.
result AN2VEC captures joint information of structure and features better than unshared information.
We develop the Latent Multi-group Membership Graph (LMMG) model, a model of networks with rich node feature structure. In the LMMG model, each node belongs to multiple groups and each latent group models the occurrence of links as well as the node feature structure. The LMMG can be used to summarize the network structu…
New metric proposed to accurately measure disentanglement.
problem Lack of theoretical guarantees and consistent correlation for existing disentanglement metrics.
method Analysis and creation of a new metric.
result Proposed metric satisfies two desirable properties for disentanglement.
Unified method for disentangling classes and content improves AI representation learning.
problem Current methods struggle with disentangling class and content variations.
method LORD: Latent Optimization for Representation Disentanglement with asymmetric noise regularization.
result LORD achieves superior disentanglement performance compared to existing methods.
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.
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 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.
UDR selects disentangled models without labels.
problem Unsupervised disentangled model selection.
method UDR leverages variational autoencoder disentanglement theory to rank models.
result UDR performs comparably to supervised methods and correlates with task performance.
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.
The paper defines metrics for evaluating disentangled representations in learning models.
problem Evaluating disentangled representations in learning models.
method Defining semantics and metrics for disentanglement learning.
result Proposed metrics correctly characterize representations learned by different methods.
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.
This work proposes a model to disentangle image factors effectively and control their manipulation.
problem Controlling disentanglement during image editing while preserving object identity.
method Encoder-decoder architecture with decorrelation regularization and soft target representations.
result The model successfully disentangles image factors and manipulates them effectively.
Paper introduces Wasserstein total correlation for disentangled representation learning.
problem Learning disentangled representations from data.
method Adversarial training of a critic to estimate Wasserstein total correlation in variational and Wasserstein autoencoders.
result Proposed method achieves comparable disentanglement performance with less reconstruction loss.
This paper tackles disentanglement in image editing and reconstruction.
problem Learning disentangled image representations and balancing disentanglement strength and reconstruction quality.
method Distance covariance based decorrelation regularization for disentanglement, soft target representation for reconstruction, and collapsing AE decoder and GAN generator.
result The proposed model improves the disentanglement strength and perceptual quality of generated images.
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.
Disentanglement-PyTorch library facilitates disentangled representation learning.
problem Unsupervised learning of disentangled representations.
method Modular library for variational algorithms, decoupling architectures, latent space, and training algorithms.
result Achieved 3rd rank in NeurIPS 2019 Disentanglement Challenge.
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…
Improves disentangled GAN training and selection without labeled data.
problem Challenges in training disentangled GANs, especially self-supervision.
method Contrastive Regularizer and ModelCentrality for unsupervised disentanglement.
result Significantly improved disentanglement scores without labeled data.
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.
A method for disentangling latent variables using weak supervision based on pairwise similarities.
problem Disentangling latent variables without strong supervision.
method Weak supervision through binary or real-valued similarities, applied within a Variational Autoencoder framework.
result Utilizing weak supervision improves disentanglement performance substantially.
Study evaluates unsupervised disentanglement methods on a toy dataset.
problem Lack of clear disentanglement metrics capturing independent features.
method Empirical evaluation of six unsupervised disentanglement methods on MPI3D dataset.
result Beta-TCVAE outperforms other methods in metrics, but not in disentanglement quality.
New approach to disentangled representations using mutual information.
problem Disentangled representations lack sufficient inductive biases.
method Formulate disentanglement through mutual information and conditional independence.
result Violation of mutual information assumption leads to loss of disentanglement.
The paper provides a framework for weakly supervised disentanglement guarantees.
problem Learning disentangled representations in real-world data.
method Theoretical framework for analyzing disentanglement guarantees with weak supervision.
result Empirical verification of weak supervision methods' predictive power and usefulness.
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.
Disentangled representations improve abstract visual reasoning tasks.
problem The usefulness of disentangled representations for abstract visual reasoning.
method A large-scale study with 360 state-of-the-art unsupervised disentanglement models and 3600 abstract reasoning models.
result Disentangled representations lead to better down-stream performance in abstract reasoning tasks.
The paper explores how disentangled representations can improve fairness in prediction tasks.
problem Improving fairness in prediction tasks using disentangled representations.
method Investigates different notions of disentanglement and analyzes representations of state-of-the-art models.
result Disentanglement scores are correlated with increased fairness in prediction tasks.
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.
IPGDN learns disentangled node representations in graphs.
problem Learning disentangled node representations in graph convolutional networks (GCNs).
method IPGDN uses neighborhood routing mechanism and HSIC to enforce independence among latent representations.
result IPGDN outperforms state-of-the-arts in graph classification, clustering, and visualization.
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.
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.