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

93186279372 · Jun 202019922001200920172026
48 results for Hierarchical Latent Variables

Researchers identify latent variables and causal structures from nonlinear hierarchical models.

problem Challenging task of identifying latent variables and causal structures from observational data, especially when relationships are nonlinear.
method Investigated nonlinear latent hierarchical causal models, developed identification criterion, and constructed an estimation procedure.
result Identifiability of causal structures and latent variables achieved under mild assumptions.

Improved hierarchical discrete VAEs for better stability and performance.

problem Training stable and efficient hierarchical discrete VAEs with numerous latent variables.
method Introducing Relaxed-Responsibility Vector-Quantisation to parameterise discrete latent variables in a hierarchical structure.
result Achieved state-of-the-art bits-per-dim results for various standard datasets.

HCL learns shared and modality-specific latent representations for multimodal data.

problem Binary shared-private decomposition inadequately represents shared information across subsets of modalities.
method Hierarchical Contrastive Learning framework combining latent-variable formulation, structural sparsity, and contrastive objective.
result HCL accurately recovers hierarchical structure and improves predictive performance on multimodal data.

We present a novel method for hierarchical topic detection where topics are obtained by clustering documents in multiple ways. Specifically, we model document collections using a class of graphical models called hierarchical latent tree models (HLTMs). The variables at the bottom level of an HLTM are observed binary va…

2016-05-21abs ↗pdf ↗

Formalizes concepts as latent variables in hierarchical models for high-dimensional data.

problem Lack of formalization and theoretical insights for learning discrete concepts from high-dimensional data.
method Formalizes concepts as latent causal variables in a hierarchical model, formulates conditions for concept identification.
result Conditions for identifying latent hierarchical models in unsupervised data, handling complex structures and high-dimensional data.

This work tackles posterior collapse in conditional and hierarchical VAEs.

problem Posterior collapse in VAEs leads to poor latent variable representations.
method Theoretical analysis of linear conditional and hierarchical VAEs, empirical validation.
result Theoretical and empirical evidence of posterior collapse causes in conditional and hierarchical VAEs.

Deep neural networks have been shown to be very successful at learning feature hierarchies in supervised learning tasks. Generative models, on the other hand, have benefited less from hierarchical models with multiple layers of latent variables. In this paper, we prove that hierarchical latent variable models do not ta…

2017-02-27abs ↗pdf ↗

SCHA-VAE generates novel data from limited examples using hierarchical context aggregation.

problem Generating data from a novel distribution with limited examples.
method Hierarchical context aggregation with attention-based point to set-level aggregation.
result Hierarchical approach better captures intrinsic variability in small data.

Learning in the latent variable model is challenging in the presence of the complex data structure or the intractable latent variable. Previous variational autoencoders can be low effective due to the straightforward encoder-decoder structure. In this paper, we propose a variational composite autoencoder to sidestep th…

2018-04-12abs ↗pdf ↗

Paper learns latent and hierarchical structures in CDMs from data.

problem Jointly learning latent and hierarchical structures in CDMs from observed data.
method Penalized likelihood approach for selecting attributes and estimating structures; EM and latent structure recovery algorithms.
result Good performance demonstrated by simulation and real data applications.

This work proposes a new method to train models with deep latent hierarchies using Optimal Transport.

problem Training models with deep latent hierarchies using VAEs often leads to the 'latent variable collapse' issue.
method Proposes a novel approach based on Optimal Transport to train models with deep latent hierarchies.
result The method avoids the 'latent variable collapse' issue and provides better sample generations and latent representation.

DSVNP uses global and local latent variables for improved neural process predictions.

problem Limited expressiveness of vanilla neural processes in capturing target-specific local variation.
method Introduces DSVNP combining global and local latent variables for prediction.
result Competitive prediction performance in multi-output regression and uncertainty estimation.

Paper proposes a new model for speech synthesis with better interpretability.

problem Improving interpretability in speech synthesis models.
method Hierarchical, fine-grained latent variable model with conditional variational auto-encoder (VAE).
result The new model allows better interpretability without degrading performance.

Proposes a method to improve surrogate modeling and design optimization using latent variables.

problem Improving efficiency in multi-fidelity adaptive sampling without hierarchical assumptions.
method A framework using a latent variable Gaussian process to capture correlations between different fidelity models and optimize adaptive sampling.
result Demonstrates superior performance in convergence rate and robustness compared to existing methods.

New normalizing flows in hyperbolic space improve posterior modeling for hierarchical data.

problem Limited flexibility of existing normalizing flows in Euclidean space for hierarchical data.
method Elevated normalizing flows to hyperbolic spaces using coupling transforms and Wrapped Hyperboloid Coupling.
result Improved performance on density estimation and hierarchical graph data.

APo-VAE generates text in hyperbolic space for better hierarchical representation.

problem Lack of hierarchical structure in Euclidean embeddings for natural language.
method Adversarial Poincare Variational Autoencoder (APo-VAE) in hyperbolic latent space.
result APo-VAE outperforms Euclidean VAEs in capturing latent language hierarchies.

We introduce a new approach to learning in hierarchical latent-variable generative models called the "distributed distributional code Helmholtz machine", which emphasises flexibility and accuracy in the inferential process. In common with the original Helmholtz machine and later variational autoencoder algorithms (but …

2018-05-28abs ↗pdf ↗

In this paper, we compare various methods to compress a text using a neural model. We find that extracting tokens as latent variables significantly outperforms the state-of-the-art discrete latent variable models such as VQ-VAE. Furthermore, we compare various extractive compression schemes. There are two best-performi…

2018-11-14abs ↗pdf ↗

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 ↗

We address the problem of learning hierarchical deep neural network policies for reinforcement learning. In contrast to methods that explicitly restrict or cripple lower layers of a hierarchy to force them to use higher-level modulating signals, each layer in our framework is trained to directly solve the task, but acq…

2018-04-09abs ↗pdf ↗

Black box variational inference allows researchers to easily prototype and evaluate an array of models. Recent advances allow such algorithms to scale to high dimensions. However, a central question remains: How to specify an expressive variational distribution that maintains efficient computation? To address this, we …

2015-11-07abs ↗pdf ↗

New insights into optimizing latent representations in hierarchical VAEs.

problem Optimizing latent representations in hierarchical VAEs for various applications.
method Identifying a general class of inference models and deriving theoretical bounds on performance.
result Guidance for practitioners on optimal regions in rate-space for different applications.

We develop deep Poisson-gamma dynamical systems (DPGDS) to model sequentially observed multivariate count data, improving previously proposed models by not only mining deep hierarchical latent structure from the data, but also capturing both first-order and long-range temporal dependencies. Using sophisticated but simp…

2018-10-26abs ↗pdf ↗

Proposes a hierarchical model for learning discrete Bayesian networks with shrinkage.

problem Learning discrete Bayesian networks with high-order interactions and cell probabilities.
method Hierarchical Dirichlet shrinkage model with Metropolis-adjusted Langevin algorithm for sampling.
result Efficiently learns graph structure and selects between DAGs from sparse count data.

Model complexity is an important factor to consider when selecting among graphical models. When all variables are observed, the complexity of a model can be measured by its standard dimension, i.e. the number of independent parameters. When hidden variables are present, however, standard dimension might no longer be ap…

2012-12-12abs ↗pdf ↗

In data science and machine learning, hierarchical parametric models, such as mixture models, are often used. They contain two kinds of variables: observable variables, which represent the parts of the data that can be directly measured, and latent variables, which represent the underlying processes that generate the d…

2014-08-25abs ↗pdf ↗

Probabilistic models with discrete latent variables naturally capture datasets composed of discrete classes. However, they are difficult to train efficiently, since backpropagation through discrete variables is generally not possible. We present a novel method to train a class of probabilistic models with discrete late…

2016-09-07abs ↗pdf ↗