SENA-discrepancy-VAE interprets latent causal factors in biological pathways.
problem Interpreting latent causal factors in biological pathways.
method SENA-discrepancy-VAE, a model based on discrepancy-VAE, that produces interpretable latent causal factors.
result Sena-discrepancy-VAE achieves comparable predictive performance with non-interpretable counterparts while providing biologically meaningful causal factors.
Novel KAN-based autoencoder improves asset pricing models' accuracy and interpretability.
problem Improving asset pricing models' accuracy and interpretability.
method Kolmogorov-Arnold Networks (KANs) inspired autoencoder for latent factor exposures.
result Outperforms Multilayer Perceptrons in both accuracy and interpretability.
LaCIM avoids spurious correlation by modeling latent causal factors.
problem Avoiding spurious correlation in supervised learning.
method Introducing latent variables for causal prediction and optimizing over latent space.
result Improved interpretability, robustness, and prediction power on OOD scenarios.
MRTL learns interpretable spatial patterns efficiently.
problem Efficient and interpretable spatial analysis in various fields.
method Multiresolution Tensor Learning (MRTL) algorithm.
result 4~5x speedup with accurate and interpretable latent factors.
spex-LVM infers interpretable latent factors from biomedical data.
problem Inability to learn sparse and interpretable hidden states.
method Factorial latent variable model with sparse priors and domain-relevant annotations.
result Robustly identifies relevant structure in RNA-seq datasets.
Study improves interpretability in generative models by disentangling latent variables in scientific datasets.
problem Extracting generative factors from complex, high-dimensional datasets in unsupervised or semi-supervised settings.
method Introducing Aux-VAE, a novel architecture within the VAE framework, which disentangles latent variables by guiding them with auxiliary variables.
result Aux-VAE achieves disentanglement with minimal modifications to the standard VAE loss function, validated on multiple datasets.
This work proposes a new algorithm for automated and simultaneous phenotyping of multiple co-occurring medical conditions, also referred as comorbidities, using clinical notes from the electronic health records (EHRs). A basic latent factor estimation technique of non-negative matrix factorization (NMF) is augmented wi…
After deep generative models were successfully applied to image generation tasks, learning disentangled latent variables of data has become a crucial part of deep generative model research. Many models have been proposed to learn an interpretable and factorized representation of latent variable by modifying their objec…
Unified framework for disentangled VAEs improves latent space interpretability.
problem Challenges in evaluating and interpreting latent representations, especially for diverse data types.
method Unified bfVAE framework, FVH-LT, DBSR-LS, GAS, LSSI.
result bfVAE provides more favorable trade-off between disentanglement and reconstruction.
Enhances interpretability of linear latent spaces through automated clustering and ranking.
problem Severe interpretability issues in latent directions of PCA, ICA, CCA, and FA.
method LS-PIE framework automates clustering and ranking of latent vectors.
result Enhanced interpretability of latent vectors through LR, LS, LC, and LCON.
New method explains high-dimensional sphere data with latent factors.
problem Understanding intricate dependence structure in high-dimensional sphere data.
method Exploratory factor analysis of the projected normal distribution with a fast alternating expectation profile conditional maximization algorithm.
result Uniformly excellent results on various data types, including tweets, brain imaging, and cancer gene expression.
New algorithm for low-rank optimal transport with improved interpretability and efficiency.
problem Quadratic scaling of optimal transport coupling matrix for massive datasets.
method Factor Relaxation with Latent Coupling (FRLC) algorithm.
result Superior performance on diverse applications including graph clustering and spatial transcriptomics.
PRISM-VQ combines financial priors with vector quantization for better stock prediction.
problem Predicting cross-sectional stock returns is hard due to low signal-to-noise ratios and changing market conditions.
method Integrates expert priors, vector-quantized latent factors, and dynamic factor loadings.
result Consistent improvements in cross-sectional return prediction and portfolio performance.
We present a Bayesian tensor factorization model for inferring latent group structures from dynamic pairwise interaction patterns. For decades, political scientists have collected and analyzed records of the form "country i took action a toward country j at time t"---known as dyadic events---in order to form an…
Sparse GFA identifies disease factors in FTD subgroups.
problem Heterogeneity in neurological disorders hinders understanding and treatment.
method Sparse Group Factor Analysis (GFA) with regularised horseshoe priors.
result Identified latent disease factors differentially expressed in FTD subgroups.
Bayesian hypergraph inference models disease pathways from EHR data.
problem Modeling rare diseases influenced by shared risk factors.
method Bayesian hypergraph inference framework reframing multi-disease modeling.
result Interpretable disease pathways and well-calibrated uncertainty quantification.
ATLAS separates invariant and transferable latent factors across diverse environments.
problem Transfer learning and robust prediction in heterogeneous environments.
method ATLAS leverages invariance principle to disentangle latent factors and uses auxiliary labels for robust prediction.
result Near-oracle performance and robust transferable prediction in new environments.
Most existing word embedding methods can be categorized into Neural Embedding Models and Matrix Factorization (MF)-based methods. However some models are opaque to probabilistic interpretation, and MF-based methods, typically solved using Singular Value Decomposition (SVD), may incur loss of corpus information. In addi…
Method evaluates disentanglement in DLVMs, including those not aligned with latent axes.
problem Evaluate disentanglement in DLVMs, especially those not aligned with latent axes.
method Proposes a statistical method to discover generative factors of a dataset.
result Empirically demonstrates the advantage of the method on two datasets.
A Bayesian Boolean Matrix Factorization for cancer genomics
problem Identifying coordinated feature changes in cancer
method Bayesian Boolean Matrix Factorization
result Captures widespread, near-simultaneous chromosome-number changes
We present a framework for learning disentangled and interpretable jointly continuous and discrete representations in an unsupervised manner. By augmenting the continuous latent distribution of variational autoencoders with a relaxed discrete distribution and controlling the amount of information encoded in each latent…
Method ranks generative models without needing latent factor supervision.
problem Challenges in selecting generative models for qualities like disentanglement.
method Ranking generative models based on training dynamics, without requiring labels for latent factors.
result Method correlates with supervised disentanglement metrics and can predict downstream performance.
Proposes a flexible feature allocation model for sparse factor analysis.
problem Sparse data and rigid assumptions in traditional exploratory tools.
method Adaptive latent feature sharing with control over feature sparsity.
result Derives a novel adaptive Factor analysis (aFA) and aPPCA for flexible dimensionality reduction.
MuVI models multi-view data with structured sparsity, integrating domain knowledge.
problem Disentangling variation across multiple data views in complex systems.
method Multi-view latent variable model with structured sparsity using a modified horseshoe prior.
result MuVI outperforms state-of-the-art methods in structured sparsity modeling and integrates noisy domain expertise.
Deep generative models have recently yielded encouraging results in producing subjectively realistic samples of complex data. Far less attention has been paid to making these generative models interpretable. In many scenarios, ranging from scientific applications to finance, the observed variables have a natural groupi…
Powerful generative models, particularly in Natural Language Modelling, are commonly trained by maximizing a variational lower bound on the data log likelihood. These models often suffer from poor use of their latent variable, with ad-hoc annealing factors used to encourage retention of information in the latent variab…
New method identifies latent causal factors from observational data alone.
problem Identifying latent causal factors without interventions or graphical restrictions.
method Characterization of latent factors in nonlinear causal models with additive Gaussian noise and linear mixing, using a practical algorithm based on solving a quadratic program over observed data.
result Latent causal variables can be identified up to a layer-wise transformation, and further disentanglement is not possible.
Scalable GP model tackles big data, categorical factors, and multiple responses.
problem Handling big datasets, categorical inputs, and multiple responses in Gaussian processes.
method Latent variable Gaussian process (LVGP) with variational inference for scalability and interpretability.
result The method scales well for large datasets and outperforms state-of-the-art methods.
We present a factorized hierarchical variational autoencoder, which learns disentangled and interpretable representations from sequential data without supervision. Specifically, we exploit the multi-scale nature of information in sequential data by formulating it explicitly within a factorized hierarchical graphical mo…
Paper identifies latent factors from noisy measurements using tensor decomposition.
problem Identification of latent factors from noisy, correlated measurements.
method Tensor decomposition of third order cross moments, Kruskal theorem, Kotlarski identity, generalized Kruskal rank.
result Full distribution of latent factors and measurement errors identified without injective measurements.
In this article, we focus on decomposing latent representations in generative adversarial networks or learned feature representations in deep autoencoders into semantically controllable factors in a semisupervised manner, without modifying the original trained models. Particularly, we propose factors' decomposer-entang…
New Bayesian method for sparse multidimensional item response theory.
problem Sparse interpretable explanations for questionnaire data.
method Bayesian EM algorithm for sparse factor loadings.
result Reliable recovery of factor dimensionality and latent structure.
NCFA uses deep learning and causal discovery to analyze complex data.
problem Analyzing complex, interdependent data with causal relationships.
method NCFA combines latent causal discovery and variational autoencoders.
result NCFA outperforms standard VAEs in sparsity, complexity, and causal interpretability.
A scalable framework selects top factors from CAE latent factors for better portfolio optimization.
problem Limited latent factor dimension in CAE models degrades performance.
method Couple high-dimensional CAE with uncertainty-aware factor selection.
result Pruning strategy delivers substantial gains in risk-adjusted performance.
SOFARI improves inference on multi-task learning latent factors.
problem Challenges in precise inference on multi-task learning latent factor matrices.
method High-dimensional manifold-based Neyman near-orthogonality inference on Stiefel manifold structure.
result Easy-to-use bias-corrected estimators for latent factor vectors and singular values with asymptotic normal distributions.
OrphicX generates causal explanations for GNNs by isolating latent causal factors.
problem Generating interpretable causal explanations for complex graph neural networks.
method Develops a generative model and objective function to isolate latent causal factors, maximizing information flow.
result OrphicX effectively identifies causal semantics, significantly outperforming alternatives.
New method linearizes nonlinear coupled oscillators on graphs.
problem Predicting global synchronization in nonlinear coupled oscillators on graphs.
method Latent dynamic filters learned through supervised matrix factorization.
result Latent dynamics filters enable effective prediction of global synchronization.
In variational autoencoders, the prior on the latent codes z is often treated as an afterthought, but the prior shapes the kind of latent representation that the model learns. If the goal is to learn a representation that is interpretable and useful, then the prior should reflect the ways in which the high-level fact…
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…
AlphaLogics mines market logic to generate interpretable alpha factors.
problem Complex, opaque alpha factors from factor mining overlook market logic.
method Market Logic Mining, Factor Generation and Optimization, Market Logic Generation and Optimization.
result AlphaLogics improves predictive metrics and risk-adjusted returns over baselines.
Many predictive tasks, such as diagnosing a patient based on their medical chart, are ultimately defined by the decisions of human experts. Unfortunately, encoding experts' knowledge is often time consuming and expensive. We propose a simple way to use fuzzy and informal knowledge from experts to guide discovery of int…
New method for high-dimensional manifold-based inference tackles latent responses.
problem Inference on latent right factor vectors in multi-task learning with large numbers of responses and features.
method SOFARI-R method with two variants: one for strongly orthogonal factors and another for weakly orthogonal factors.
result Bias-corrected estimators for latent right factor vectors with asymptotically normal distributions and justified asymptotic variance estimates.
Generalized principal component analysis (GLM-PCA) facilitates dimension reduction of non-normally distributed data. We provide a detailed derivation of GLM-PCA with a focus on optimization. We also demonstrate how to incorporate covariates, and suggest post-processing transformations to improve interpretability of lat…
Enhances FA framework for heterogeneous data with feature selection and semi-supervised learning.
problem Feature extraction and latent representation of heterogeneous data.
method Sparse Semi-supervised Heterogeneous Interbattery Bayesian Analysis (SSHIBA) framework.
result SSHIBA outperforms state-of-the-art algorithms and shows interpretability gains.
Half-AVAE enhances VAE for underdetermined ICA with adversarial training.
problem Challenges in ICA under underdetermined conditions.
method Encoder-free VAE with adversarial networks and EE terms.
result Half-AVAE outperforms baseline models in underdetermined ICA.
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…
User behavior data in recommender systems are driven by the complex interactions of many latent factors behind the users' decision making processes. The factors are highly entangled, and may range from high-level ones that govern user intentions, to low-level ones that characterize a user's preference when executing an…
New model separates images into independent factors quickly and easily.
problem Separating high-dimensional data like images into independent latent factors.
method Combines bijective feature maps with linear ICA model on the Stiefel manifold.
result Models converge quickly and achieve better unsupervised latent factor discovery.