New algorithms for latent class analysis using regularized spectral clustering.
problem Identifying latent classes within populations from categorical data.
method Developed two new algorithms using a regularized Laplacian matrix to estimate latent classes.
result Our algorithms provide consistent latent class analysis under mild conditions and can accurately infer the number of latent classes.
A new model for latent class analysis with weighted responses.
problem Limitation of latent class model for real-world data with continuous or negative responses.
method Proposed a novel generative model, the weighted latent class model (WLCM).
result The proposed WLCM is more realistic and general than the latent class model.
This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent class analysis in which the observation space is subdivided and each aspect of the original space is represented by a separate latent class mod…
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.
ESRLCM clusters similar responses, more broadly than traditional models.
problem Clustering multivariate categorical data with common response patterns.
method Bayesian Equivalence Set Restricted Latent Class Model (ESRLCM).
result ESRLCM identifies clusters with similar item response probabilities.
Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two-mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Semantic Analysis which s…
StepMix estimates mixture models with covariates for social science applications.
problem Estimating latent classes with covariates in social science models.
method Pseudo-likelihood estimation using one-, two-, and three-step approaches.
result Unified framework for expectation-maximization subroutines.
Proposes a flexible method for learning latent causal representations.
problem Limited applicability of existing causal representation learning methods.
method Imposes constraints on function classes and relaxes identifiability conditions.
result Establishes partial identifiability results under weaker conditions.
Latent tree models are graphical models defined on trees, in which only a subset of variables is observed. They were first discussed by Judea Pearl as tree-decomposable distributions to generalise star-decomposable distributions such as the latent class model. Latent tree models, or their submodels, are widely used in:…
This research quantifies cross-sectoral inequalities using latent class analysis.
problem Addressing multiple and intersecting forms of inequality in various sectors.
method Innovative latent class analysis approach to quantify discrepancies.
result Significant discrepancies found among minority ethnic groups and between them and non-minority groups.
Deep equilibrium models estimate latent variables from data.
problem Estimating latent variables from data.
method Generalized exponential family models, deep equilibrium networks.
result Deep equilibrium models solve MAP estimates for latent and transformation parameters.
Linear Discriminant Analysis (LDA) is a well-known method for dimensionality reduction and classification. Previous studies have also extended the binary-class case into multi-classes. However, many applications, such as object detection and keyframe extraction cannot provide consistent instance-label pairs, while LDA …
In many countries information on expectations collected through consumer confidence surveys are used in macroeconomic policy formulation. Unfortunately, before doing so, the consistency of responses is often not taken into account, leading to biases creeping in and affecting the reliability of the indices hence created…
New bounds for contrastive learning handle domain shifts and generalization.
problem Domain shifts and generalization challenges in downstream tasks.
method Novel generalization bounds accounting for both domain shift and generalization.
result Performance of contrastively learned representations depends on statistical discrepancy between pretraining and downstream distributions.
PCA outperforms random projections in retaining second order signals from latent groups.
problem Preserving second order structure in latent groups under unsupervised linear projections.
method Theoretical framework and quasi-exhaustive enumeration of projections.
result PCA outperforms random projections in retaining second order signals across a broad range of data-generating parameters.
New method identifies latent variables in cognitive models using neural networks.
problem Inference of latent variables in complex cognitive models is limited.
method Recurrent neural networks and simulation-based inference for latent variable sequences.
result Extends neural Bayes estimation to broader classes of cognitive models.
We derive a novel sensitivity analysis of input variables for predictive epistemic and aleatoric uncertainty. We use Bayesian neural networks with latent variables as a model class and illustrate the usefulness of our sensitivity analysis on real-world datasets. Our method increases the interpretability of complex blac…
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).
Generative models learn manifold structure; new approach uses atlas and geodesic interpolation.
problem Challenges in representing manifolds with topology different from Euclidean space.
method Atlas Generative Models (AGMs) with hybrid latent spaces and geodesic interpolation.
result Geodesic interpolation can be extended to AGMs, improving manifold representation.
Simple Deep LDA models achieve accuracy competitive with softmax baselines.
problem Training Deep LDA models by maximum likelihood estimation leads to overlapping or collapsed class clusters.
method Proposed a constrained Deep LDA formulation with geometric constraints to fix class means and covariance.
result MLE becomes stable under geometric constraints, yielding well-separated class clusters.
The main aim of this paper is to inspect the properties of survey based on households inflation expectations, conducted by Reserve Bank of India. It is theorized that the respondents answers are exaggerated by extreme response bias. Latent class analysis has been hailed as a promising technique for studying measurement…
In this work, we utilize Machine Learning for early recognition of patients at high risk of acute respiratory distress syndrome (ARDS), which is critical for successful prevention strategies for this devastating syndrome. The difficulty in early ARDS recognition stems from its complex and heterogenous nature. In this s…
Unified framework for clustering with auxiliary data.
problem Clustering with datasets reflecting similar but different latent structures.
method Adaptive Transfer Clustering (ATC) algorithm that optimizes bias-variance decomposition.
result ATC proves optimal under Gaussian mixture model and shows transfer benefits.
Two-Timescale EM Methods improve EM for nonconvex models.
problem Nonconvex latent variable models are challenging for EM.
method Two-stage stochastic updates to handle nonconvex optimization.
result Global convergence for nonconvex objective functions.
Paper reviews and compares NMF, PLSA, LBA, EMA, and LCA models.
problem Identifiability of latent models.
method Comparison and proof of identifiability.
result Identifiability of LBA, EMA, LCA, PLSA is unique if and only if NMF is unique.
This study analyzes prediction risk for PCR method in latent factor regression models.
problem Prediction risk analysis in latent factor regression models.
method Adaptive PCR method with risk bounds established under factor regression model.
result Unified framework for analyzing various linear prediction methods under factor regression.
In many applications, observed data are influenced by some combination of latent causes. For example, suppose sensors are placed inside a building to record responses such as temperature, humidity, power consumption and noise levels. These random, observed responses are typically affected by many unobserved, latent fac…
Additive decoders tackle latent variables and image generation.
problem Latent variables identification and out-of-support image generation in representation learning.
method Additive decoders that can identify latent variables up to permutation and block-wise invertible transformations, and generate novel images by recombining observed factors.
result Additive decoders provide a new setting for nonlinear independent component analysis and can generate novel images by recombining observed factors.
Recent empirical works have successfully used unlabeled data to learn feature representations that are broadly useful in downstream classification tasks. Several of these methods are reminiscent of the well-known word2vec embedding algorithm: leveraging availability of pairs of semantically "similar" data points and "n…
A new approach to unsupervised learning using recognition-parametrised models.
problem Discovering meaningful latent structure in observational data.
method Recognition-Parametrised Model (RPM) combining parametric and non-parametric components.
result Effective learning of latent structure without explicit generative models.
A new method for analyzing latent space models without reference configurations.
problem Posterior summaries of latent coordinates in Euclidean latent space models are not canonical due to likelihood invariance.
method Quotient-based posterior analysis using the centered Gram map.
result Intrinsic posterior summaries of mean structure and uncertainty can be computed directly from posterior samples.
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.
Probabilistic Autoencoder learns latent space weights' distribution.
problem Nonlinear model reconstruction error and sample quality.
method Normalizing flow for latent space weights' probability distribution.
result PAE achieves small reconstruction errors, high sample quality, and good performance.
Probabilistic linear discriminant analysis (PLDA) is a method used for biometric problems like speaker or face recognition that models the variability of the samples using two latent variables, one that depends on the class of the sample and another one that is assumed independent across samples and models the within-c…
Connectivity estimation is challenging in the context of high-dimensional data. A useful preprocessing step is to group variables into clusters, however, it is not always clear how to do so from the perspective of connectivity estimation. Another practical challenge is that we may have data from multiple related classe…
Develops SCMs for latent selection to simplify causal analysis.
problem Latent selection complicates causal analysis.
method Introduces a conditioning operation for SCMs to encode latent selection.
result Conditioning operation preserves simplicity, acyclicity, and linearity of SCMs.
Confidence-based filtering reveals latent structure in diffusion models.
problem Unclear latent structure in diffusion models.
method Confidence scores from a classifier.
result Class-relevant latent structure emerges under confidence-based filtering.
We present a novel analysis of the dynamics of tensor power iterations in the overcomplete regime where the tensor CP rank is larger than the input dimension. Finding the CP decomposition of an overcomplete tensor is NP-hard in general. We consider the case where the tensor components are randomly drawn, and show that …
New method identifies latent variables with causal dependencies from observed data.
problem Identify latent variables with causal relationships from observed data.
method Linear causal disentanglement via higher-order cumulants, with perfect and soft interventions.
result Recovery of parameters via coupled tensor decomposition and polynomial equations.
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.
We study the problem of learning representations with controllable connectivity properties. This is beneficial in situations when the imposed structure can be leveraged upstream. In particular, we control the connectivity of an autoencoder's latent space via a novel type of loss, operating on information from persisten…
Method interprets GAN latent space via latent variable correlation analysis.
problem Understanding the inner workings of GANs.
method Analyzing correlation between latent variables and semantic contents in generated images.
result A method for controllable semantic content generation in GANs.
Developed DLCM for more accurate clustering of categorical data.
problem Restrictive conditional independence assumption in traditional LCMs.
method Bayesian Dependent Latent Class Model (DLCM) that allows conditional dependence.
result DLCMs are effective in applications with time series, overlapping items, and structural zeroes.
DNLL loss improves deep LDA accuracy and consistency.
problem Pathological solutions in unconstrained Deep LDA.
method Introducing Discriminative Negative Log-Likelihood (DNLL) loss.
result Deep LDA trained with DNLL produces clean latent spaces and better calibrated probabilities.
PRESTO maps latent representations across diverse ML models.
problem Understanding variability in latent representations across different ML models.
method Uses persistent homology to characterize latent spaces and measure their pairwise similarity.
result Preserves desirable properties and enables sensitivity analysis of latent representations.
Deep model learns complex latent codes without assuming factor structure.
problem Learning latent codes with complex, non-factorial distributions.
method Deep generative factor analysis with beta process prior and stochastic EM algorithm.
result Preliminary results show model can approximate complex distributions.
New findings on identifying latent variables in nonlinear ICA models.
problem Identifying latent variables in nonlinear ICA models is challenging due to spurious solutions.
method Proved that conformal maps are identifiable and provided theoretical results on preventing spurious solutions.
result Conformal maps are identifiable in nonlinear ICA models, preventing spurious solutions.
DCAE learns compact latent representations for one-class novelty detection.
problem Learning compact latent representations for one-class novelty detection.
method DCAE learns compact and collapse-free latent representations through internal discriminative layers of GANs, reconstructing in-class data finely and exclusively.
result DCAE achieves state-of-the-art performance on novelty and adversarial example detection.