Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

3847691,1531,537 · Jun 202019922001200920172026
48 results for latent type modeling

DCRL learns causal relationships from mixed-type discrete data.

problem Challenges in learning causal relationships from discrete, mixed-type data.
method Generative framework modeling directed acyclic graph and sparse bipartite graph, flexible measurement models for different types of data.
result Consistent recovery of latent causal structure from observed data distribution.

Two types of nonidentifiability in latent position graphs identified and characterized.

problem Identifying and characterizing nonidentifiability in latent position random graph models.
method Defined and examined subspace nonidentifiability and model-based nonidentifiability, providing examples and characterizing limits.
result Characterized the limits of model-based nonidentifiability and obtained additional limiting results for specific graph models.

Deep Discrete Encoders (DDEs) tackle interpretable generative models for rich data with discrete latent layers.

problem Overparametrized, non-identifiable, and uninterpretable deep generative models in high-stakes applications.
method Directed graphical model with multiple binary latent layers, transparent identifiability conditions, scalable estimation pipeline.
result Transparent identifiability conditions and scalable estimation pipeline for interpretable DDEs.

We present the Mixed Likelihood Gaussian process latent variable model (GP-LVM), capable of modeling data with attributes of different types. The standard formulation of GP-LVM assumes that each observation is drawn from a Gaussian distribution, which makes the model unsuited for data with e.g. categorical or nominal a…

2018-11-19abs ↗pdf ↗

Quantitatively assessing relationships between latent variables and observed variables is important for understanding and developing generative models and representation learning. In this paper, we propose latent-observed dissimilarity (LOD) to evaluate the dissimilarity between the probabilistic characteristics of lat…

2016-03-30abs ↗pdf ↗

Neural circuits contain heterogeneous groups of neurons that differ in type, location, connectivity, and basic response properties. However, traditional methods for dimensionality reduction and clustering are ill-suited to recovering the structure underlying the organization of neural circuits. In particular, they do n…

2016-10-26abs ↗pdf ↗

Paper relaxes identifiability conditions for causal models with latent variables.

problem Challenges in identifying causal graphical models with latent variables.
method Proposes a double triangular graphical condition for nonparametric measurement models with binary latent variables.
result Guarantees identifiability of the entire causal graphical model under relaxed conditions.

We investigate a class of feature allocation models that generalize the Indian buffet process and are parameterized by Gibbs-type random measures. Two existing classes are contained as special cases: the original two-parameter Indian buffet process, corresponding to the Dirichlet process, and the stable (or three-param…

2015-12-08abs ↗pdf ↗

We propose a kernel-based nonparametric test of relative goodness of fit, where the goal is to compare two models, both of which may have unobserved latent variables, such that the marginal distribution of the observed variables is intractable. The proposed test generalizes the recently proposed kernel Stein discrepanc…

2019-07-01abs ↗pdf ↗

The paper optimizes portfolios using MACD signals derived from price history.

problem Optimizing risky asset portfolios with latent mean-reverting and momentum factors.
method Derives optimal strategies based on MACD signals from EMA processes.
result Establishes admissibility and verification of optimal strategies.

New LVMs optimize any exponential family distribution without specific assumptions.

problem Optimizing latent variable models with non-Gaussian observables.
method Generic optimization using EM approach for exponential family distributions.
result Concise parameter update equations applicable to various data types.

Refines deep generative models to improve data density precision.

problem Achieving precise representation of data probability density in deep models.
method Iterated generative modeling to refine latent space, addressing topological obstructions.
result Latent Space Refinement (LaSeR) protocol improves generative model precision.

Develops a new method for nonlinear dimension reduction using random features.

problem Statistical challenges in generalizing Gaussian process-based latent variable models to non-Gaussian data.
method Random feature latent variable models (RFLVMs) that approximate nonlinear relationships with linear functions of random features.
result RFLVMs produce comparable results to state-of-the-art methods on various data types.

This text explores strategies for learning discrete latent structures in neural networks.

problem Learning discrete latent structures in neural networks is challenging.
method Continuous relaxation, surrogate gradients, and probabilistic estimation.
result Many latent structure learning strategies use the same fundamental building blocks but apply them differently.

Multitask learning algorithms are typically designed assuming some fixed, a priori known latent structure shared by all the tasks. However, it is usually unclear what type of latent task structure is the most appropriate for a given multitask learning problem. Ideally, the "right" latent task structure should be learne…

2012-06-27abs ↗pdf ↗

Aggregates models from different datasets using shared latent structures.

problem Aggregating models from heterogeneous datasets with shared latent structures.
method Bayesian nonparametrics for identifying correspondences among local model parameterizations.
result Framework successfully aggregates various model types across different applications.

We consider learning the possible causal direction of two observed variables in the presence of latent confounding variables. Several existing methods have been shown to consistently estimate causal direction assuming linear or some type of nonlinear relationship and no latent confounders. However, the estimation resul…

2013-10-24abs ↗pdf ↗

Unified sampling approach for Bayesian imaging problems.

problem Sampling from complex prior and posterior distributions in Bayesian imaging.
method Gaussian latent machine model for efficient prior and posterior sampling.
result Unified and generalized sampling algorithms for various imaging problems.

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.

The paper proposes a deep generative model for complex disease trajectories.

problem Modeling and analyzing complex disease trajectories.
method Deep generative time series approach with semi-supervised latent processes.
result The model can discover novel aspects of diseases and cluster them into new sub-types.

This paper improves spectral embedding for multipartite networks, revealing latent subspaces and providing consistent node representations.

problem Improving spectral embedding for multipartite networks to better represent node types.
method Developed a follow-on step to spectral embedding that recovers node representations in their intrinsic rather than ambient dimension, proving consistency under a specific model.
result Node representations in multipartite networks lie near type-specific subspaces, and the proposed method recovers these representations consistently.

Paper presents a framework for learning generative models with structured latent factors.

problem Learning controllable and generalizable representations of multivariate data with desired structural properties.
method The paper introduces a novel generative model framework that uses mask variables to model dependency structure and extends the multivariate information bottleneck theory.
result The framework learns semantically meaningful latent factors that reflect various desired structures and can automatically estimate dependency structure from data.

The paper presents efficient methods for identifying causal graphs with latent variables.

problem Recovering causal graphs with latent variables while minimizing intervention costs.
method Two intervention cost models (linear and identity) are considered. Algorithms are provided for both models.
result Upper bounds on the number of interventions needed for recovery, and approximation factors for the linear cost model.

Hierarchical Latent Attribute Models (HLAMs) are a family of discrete latent variable models that are attracting increasing attention in educational, psychological, and behavioral sciences. The key ingredients of an HLAM include a binary structural matrix and a directed acyclic graph specifying hierarchical constraints…

2019-06-19abs ↗pdf ↗

Latent Dirichlet Allocation models discrete data as a mixture of discrete distributions, using Dirichlet beliefs over the mixture weights. We study a variation of this concept, in which the documents' mixture weight beliefs are replaced with squashed Gaussian distributions. This allows documents to be associated with e…

2011-10-21abs ↗pdf ↗

New method improves uncertainty quantification in latent variable models.

problem Uncertainty quantification in latent variable models with SGLD-Gibbs.
method Statistical scaling limit theory for SGLD-Gibbs, proposing hyperparameter tuning.
result Explicit guidance on hyperparameter tuning for SGLD-Gibbs ensures meaningful uncertainty quantification.

Develops a new VAE for mixed-curvature latent spaces.

problem Lack of a generic approach for VAEs in curved latent spaces.
method Mixed-curvature Variational Autoencoder (MVAE) that trains on a product of constant curvature Riemannian manifolds.
result Generalizes Euclidean VAE to curved latent spaces and recovers Euclidean VAE when curvatures are zero.