Method determines latent dimensionality in international trade flows.
problem Finding meaningful low-dimensional latent features in high-dimensional international trade data.
method Proposes a latent dimension determination method based on clustering of nonnegative RESCAL decompositions.
result Validates the latent features against empirical economic facts.
A neural network method determines the latent dimensionality of NMF.
problem Determining the correct number of hidden features (latent dimensionality) in NMF.
method Combining NMFk with an MLP classifier trained on a dataset of matrices with known latent features.
result The MLP classifier in conjunction with NMFk achieves a greater than 95% success rate in determining the correct number of latent features.
A recurring problem when building probabilistic latent variable models is regularization and model selection, for instance, the choice of the dimensionality of the latent space. In the context of belief networks with latent variables, this problem has been adressed with Automatic Relevance Determination (ARD) employing…
Polytopic Matrix Factorization models data as latent vectors from a polytope, maximizing determinant for identifiability.
problem Data decomposition with semi-structured latent vectors and polytope constraints.
method Model input data as latent vectors from a polytope, using determinant maximization for identifiability.
result Identifiability condition for polytopes with specific symmetry restrictions.
Latent representations are the essence of deep generative models and determine their usefulness and power. For latent representations to be useful as generative concept representations, their latent space must support latent space interpolation, attribute vectors and concept vectors, among other things. We investigate …
The paper proposes a test to determine the number of latent classes in ordinal categorical data.
problem Determining the correct number of latent classes in latent class models with ordinal categorical data.
method The test statistic centers the largest singular value of a normalized residual matrix by a simple sample-size adjustment.
result The test statistic converges to zero under the null hypothesis and exceeds a fixed positive constant under an under-fitted alternative.
Efficient RL in large POMDPs with latent determinism and embeddings.
problem Efficient reinforcement learning in large-scale POMDPs with latent states and observations.
method Conditional Hilbert space embeddings, linear optimal Q-function, deterministic latent transitions, gap assumption. result Computationally and statistically efficient algorithm for exact optimal policy.
The Gaussian Process Latent Variable Model (GP-LVM) is a non-linear probabilistic method of embedding a high dimensional dataset in terms low dimensional `latent' variables. In this paper we illustrate that maximum a posteriori (MAP) estimation of the latent variables and hyperparameters can be used for model selection…
Concept modulation models unify identifiability and extrapolation in conditional latent variable models.
problem Reliable generalization in conditional latent variable models
method Concept modulation models (CMMs) with structure AoΛoCoX result Lifts identifiability to conditional settings and controls extrapolation through attribute potentials.
Factor analysis aims to determine latent factors, or traits, which summarize a given data set. Inter-battery factor analysis extends this notion to multiple views of the data. In this paper we show how a nonlinear, nonparametric version of these models can be recovered through the Gaussian process latent variable model…
New method identifies latent relationships in deep models without additional constraints.
problem Latent representations in deep latent variable models are not statistically identifiable.
method Identifies relationships between latent variables (distances, angles, volumes) under mild model conditions.
result Empirically demonstrates more reliable latent distances without additional labeled data.
VBphenoR uses variational Bayes for EHR-based patient phenotyping.
problem Phenotyping patients from EHR data for targeted treatments.
method Variational Bayes Gaussian Mixture Model (GMM) and logistic regression.
result Closed-form inference for efficient patient phenotype determination.
We simplify inference for TPP models with latent structures.
problem Intractable marginalization in TPP models with latent structures.
method Approximate inference over latent variables using a tight upper bound on the approximation gap.
result Improved results for models like Survival Analysis.
The paper tackles causal disentanglement with linear models and interventions.
problem Identify latent variables in a causal model from observed data.
method Use linear transformations and interventions to uniquely identify latent variables.
result A single intervention on each latent variable is sufficient for identifying the latent causal model.
In this paper we present a fully Bayesian latent variable model which exploits conditional nonlinear(in)-dependence structures to learn an efficient latent representation. The latent space is factorized to represent shared and private information from multiple views of the data. In contrast to previous approaches, we i…
Paper proposes RCD method to discover causal structure with latent confounders.
problem Causal discovery from data with latent confounders.
method Repetitive causal discovery (RCD) method to infer causal directions between observed variables.
result RCD effectively identifies latent confounders and causal directions between observed variables.
Estimates distances between latent points in random geometric graphs.
problem Estimating distances between latent points in random geometric graphs.
method Spectral estimator of pairwise distances.
result Rate of convergence is the same as nonparametric estimation on the sphere, up to a logarithmic factor.
In this paper, we describe a novel approach to imitation learning that infers latent policies directly from state observations. We introduce a method that characterizes the causal effects of latent actions on observations while simultaneously predicting their likelihood. We then outline an action alignment procedure th…
We present a multi-task learning formulation for Deep Gaussian processes (DGPs), through non-linear mixtures of latent processes. The latent space is composed of private processes that capture within-task information and shared processes that capture across-task dependencies. We propose two different methods for segmen…
The Gaussian process latent variable model (GP-LVM) is a popular approach to non-linear probabilistic dimensionality reduction. One design choice for the model is the number of latent variables. We present a spike and slab prior for the GP-LVM and propose an efficient variational inference procedure that gives a lower …
A new TTS method uses diffusion and VAE for better speech synthesis.
problem Improving text-to-speech synthesis for better speech quality and robustness.
method Combines diffusion probabilistic model and variational autoencoder for latent variable conversion.
result The method is robust to poor orthography and alignment errors.
Fractal Flow enhances normalizing flows with interpretable latent space and hierarchical modeling.
problem High-dimensional density estimation and generative modeling challenges.
method Integrates topic modeling (LDA) and fractal strategy into normalizing flows.
result Achieves latent clustering, controllable generation, and superior estimation accuracy.
StarNet trains deep models without gradients using linear equations.
problem Training deep generative models with gradients.
method Solving determined systems of linear equations.
result Least-square bounds for latent codes and model parameters.
New method identifies causes in time series with latent variables.
problem Identifying direct and indirect causes in time series data with hidden variables.
method Proves necessary and sufficient conditions for causal feature selection using graph constraints and conditional independence tests.
result Method outperforms Granger causality in identifying causes with low false positives and false negatives.
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.
Study identifies latent variables and models from spacecraft data.
problem Learning reliable models from spacecraft data with complex relationships.
method Inductive bias inspired by controllable canonical forms for sparse, input-dependent latent variables.
result Identifies latent variables up to scaling and determines dynamic models up to transformations for linear and affine systems.
A latent space model for a family of random graphs assigns real-valued vectors to nodes of the graph such that edge probabilities are determined by latent positions. Latent space models provide a natural statistical framework for graph visualizing and clustering. A latent space model of particular interest is the Rando…
CANDECOMP/PARAFAC (CP) tensor factorization of incomplete data is a powerful technique for tensor completion through explicitly capturing the multilinear latent factors. The existing CP algorithms require the tensor rank to be manually specified, however, the determination of tensor rank remains a challenging problem e…
High dimensional time series are endemic in applications of machine learning such as robotics (sensor data), computational biology (gene expression data), vision (video sequences) and graphics (motion capture data). Practical nonlinear probabilistic approaches to this data are required. In this paper we introduce the v…
VSCOUT detects anomalies in high-dimensional data using a hybrid VAE approach.
problem Challenges in classical SPC for high-dimensional, non-Gaussian data.
method Hybrid VAE architecture with ARD prior, ensemble filtering, and changepoint detection.
result VSCOUT achieves superior sensitivity to special-cause structure and controlled false alarms.
New spectral clustering method handles discrete covariates for better community detection.
problem Community detection in networks with discrete covariates.
method Spectral algorithm that separates latent network structure from observed covariates.
result Achieves perfect clustering with high probability in large, sparse networks.
Bayesian optimization uses shared latent variables for multiple systems.
problem Optimizing systems with limited data and unknown relationships.
method Shared latent variables, Bayesian inference, probabilistic metamodel.
result Performance improvement in zero-, one-, and few-shot settings.
The paper develops a method to dynamically adjust VAE latent space dimensions during training.
problem Under- or overprovisioning of latent space dimensions in VAEs.
method GECO optimizer with L0-ARM gradient estimator to dynamically adjust latent space dimensions. result The latent space can be pruned effectively without violating reconstruction error constraints.
Paper recovers latent causal structure and linear transformation from indirect observations.
problem Recovering latent causal structure and linear transformation from indirect observations.
method Established sufficient conditions for DAG recovery, leveraged score function properties, and used soft/hard interventions.
result Perfect recovery of latent DAG structure and linear transformation up to scaling using soft interventions, hard interventions with additional hypothesis testing.
Hierarchical learning models, such as mixture models and Bayesian networks, are widely employed for unsupervised learning tasks, such as clustering analysis. They consist of observable and hidden variables, which represent the given data and their hidden generation process, respectively. It has been pointed out that co…
This study rethinks the latent space in generative modeling, improving performance with less complex models.
problem Determining the optimal latent space for generative models and understanding its impact on model complexity.
method Proposed a new distance metric between latent and data distributions, and a two-stage training strategy called Decoupled Autoencoder (DAE).
result Improves generative performance with less complex models, as shown by comprehensive experiments on various models.
Active learning selects inputs for GPSSM to learn latent states.
problem Optimally learn latent states of a GPSSM through active selection of inputs.
method Use mutual information to select informative inputs; approximate mutual information for GPSSM.
result Effective active learning of GPSSM dynamics in physical systems.
Improved RL in BMDPs reduces regret to O(sqrt(T)+n).
problem Real-world RL challenges due to large state and action spaces.
method Two-phase RL algorithm: latent structure learning followed by adaptive strategy.
result Achieves asymptotically optimal regret O(sqrt(T)+n).
In latent Gaussian trees the pairwise correlation signs between the variables are intrinsically unrecoverable. Such information is vital since it completely determines the direction in which two variables are associated. In this work, we resort to information theoretical approaches to achieve two fundamental goals: Fir…
This paper provides a unifying theoretical framework for stochastic optimization algorithms by means of a latent stochastic variational problem. Using techniques from stochastic control, the solution to the variational problem is shown to be equivalent to that of a Forward Backward Stochastic Differential Equation (FBS…
New method disentangles shared and private latent factors in multimodal data.
problem Challenges in disentangling shared and private latent factors in multimodal data.
method Proposes a modification to existing multimodal Variational Autoencoders (MMVAE) to better handle modality-specific variation.
result Demonstrates improved robustness of modified MMVAE to modality-specific variation.
AMES framework selects optimal embedding space for latent graph inference.
problem No principled method for choosing the best embedding space for latent graph inference.
method Differentiable AMES framework using backpropagation to select optimal embedding space.
result Consistently achieves comparable or superior results across multiple datasets.
New model uncovers non-Euclidean neural representations.
problem Discovering latent neural states in complex, non-Euclidean spaces.
method Manifold GPLVM for identifying latent variables and neural contributions.
result mGPLVM correctly recovers non-Euclidean latent structures in neural data.
Identifies latent actions and dynamics from offline data with diverse demonstrators.
problem Recovering latent actions and environment dynamics from action-free trajectories.
method Assumes distinct policies for each demonstrator, identifies latent transitions and policies via matrix factorization.
result Identifies latent transitions and demonstrator policies up to permutation.
New model for multi-layer categorical data improves latent class analysis.
problem Traditional latent class analysis for single-layer categorical data is insufficient for multi-layer data.
method Developed a multi-layer latent class model (multi-layer LCM) and three spectral methods for estimation.
result The debiased sum of Gram matrices method performs best in estimating latent classes.
Two autoencoding models learn latent traffic scene representations.
problem Learning latent representations of traffic scenarios.
method CNN and RNN models for spatio-temporal and temporal data, incorporating permutation invariance.
result Latent scenario embeddings can be used for clustering and similarity retrieval.
New method infers and samples point processes from latent diffusion.
problem Modeling point processes with latent diffusion.
method Itô's excursion theory for inference and sampling.
result Proposes a new method to infer and sample point processes.
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown parent datum. The latent graph structure is assumed to lie in the family of directed out-tree graphs which leads to efficient Bayesian inferen…