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

83165248330 · Jun 202019922001200920172026
48 results for latent priors

New findings suggest latent regularization is unnecessary for high-quality image generation.

problem Improving image generation quality without latent regularization.
method Investigated the effect of latent regularization on image generation using learned priors.
result In the case of a sufficiently expressive prior, latent regularization is not necessary and may harm image quality.

X-VAE uses data-adaptive Gaussian priors to improve latent space modeling.

problem Limitations of standard Gaussian priors in complex datasets.
method Data-adaptive Gaussian prior derived from pretrained autoencoder latent codes.
result Improved latent space modeling and generation quality.

A new prior for VAEs improves model capacity by allowing a more flexible latent space.

problem Standard Gaussian priors in VAEs limit model capacity and performance.
method Proposed a Riemannian Brownian motion prior over a Riemannian structure of the latent space.
result The new prior significantly increases model capacity with only one additional scalar parameter.

SAHMM-VAE separates sources adaptively using hidden Markov priors.

problem Unsupervised blind source separation.
method Source-wise adaptive Hidden Markov prior variational autoencoder.
result Different latent dimensions align with different source-specific temporal organizations.

AR-Flow VAE improves blind source separation with flexible autoregressive priors.

problem Unsupervised blind source separation of latent signals from mixtures.
method AR-Flow VAE uses autoregressive flows to model latent sources, enhancing flexibility and capturing complex dependencies.
result AR-Flow VAE effectively separates latent sources, demonstrating improved performance over conventional methods.

A novel circuit motif uses sister cells for inference with correlated priors.

problem Structured priors in neural systems pose architectural challenges.
method Proposes a novel circuit motif using sister cells to implement correlated priors without direct interactions.
result Demonstrates the efficacy of correlated priors for inference in noisy environments.

Adaptive multi-stage density ratio estimation improves learning of latent space EBM.

problem Learning energy-based models in latent space is computationally expensive and challenging.
method Adaptive multi-stage density ratio estimation using NCE to bridge the gap between prior and posterior densities.
result The method enables more expressive prior models and sharpens the latent space EBM.

A new method maps high-dimensional Bayesian inverse problems to lower dimensions.

problem High-dimensional Bayesian inverse problems with complex prior information.
method Data-driven VAE prior and KRnet map for posterior approximation in latent space.
result Efficiently reduces computational cost and approximates posterior distributions.

A new method to learn EBM in latent space for better data modeling.

problem Efficiently modeling data with complex structures.
method Joint learning of latent space EBM and top-down network using maximum likelihood and MCMC sampling.
result Simple EBM in latent space captures data regularities effectively and performs well in generation and anomaly detection.

We propose to learn a hierarchical prior in the context of variational autoencoders to avoid the over-regularisation resulting from a standard normal prior distribution. To incentivise an informative latent representation of the data, we formulate the learning problem as a constrained optimisation problem by extending …

2019-05-13abs ↗pdf ↗

Improves latent space structure for better data representation.

problem Limited ability of conventional priors to encode data manifold structure.
method Introduces an Encoded Prior Sliced Wasserstein AutoEncoder with iterative training and geodesic interpolation.
result Learned manifold encoding preserves topological and geometric properties of data.

LDTA expands LDA's topic modeling capacity with tree-structured priors.

problem Limited expressiveness of Dirichlet priors in LDA for complex topic relationships.
method Introduces Latent Dirichlet-Tree Allocation (LDTA) with Dirichlet-Tree (DT) priors, and develops universal mean-field variational inference and Expectation Propagation.
result LDTA enables expressive, tree-structured priors over topic proportions, expanding modeling capacity of LDA.

We focus on generative autoencoders, such as variational or adversarial autoencoders, which jointly learn a generative model alongside an inference model. Generative autoencoders are those which are trained to softly enforce a prior on the latent distribution learned by the inference model. We call the distribution to …

2016-10-28abs ↗pdf ↗

We introduce a novel discriminative latent variable model for bilingual lexicon induction. Our model combines the bipartite matching dictionary prior of Haghighi et al. (2008) with a representation-based approach (Artetxe et al., 2017). To train the model, we derive an efficient Viterbi EM algorithm. We provide empiric…

2018-08-28abs ↗pdf ↗

This paper explores how the latent structure affects clustering in GAN-generated data.

problem Achieving well-clustered data in GAN-generated spaces, especially with class imbalance.
method Derives conditions for faithful clustering in GANs, including multimodal latent space, latent space inversion, and cluster priors imposition.
result Necessary and sufficient conditions for clustering in GANs are identified, and their importance is demonstrated through ablative studies.

tvGP-VAE models tensor-valued latent variables with Gaussian processes for better data structure representation.

problem Agnostic latent variables in VAEs ignore data structure correlations.
method Proposes tensor-variate Gaussian process prior for variational autoencoder.
result Explicitly modeling correlation structures improves model performance in reconstruction.

StrADiff separates sources from mixtures without labels, using structured priors.

problem Blind source separation of linear and nonlinear mixtures without labeled data.
method Structured Source-Wise Adaptive Diffusion Framework with Gaussian process priors.
result StrADiff can recover latent source trajectories in an unsupervised manner, especially stable in linear mixtures.

In variational autoencoders, the prior on the latent codes zz 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…

2018-10-16abs ↗pdf ↗

PPT optimizes transformer behavior by steering its latent posterior using prior samples.

problem Eliciting desired behavior from transformers without backpropagation.
method Posterior Prefix Tuning (PPT) uses predictive Monte Carlo (PMC) samples and importance sampling to optimize the latent posterior.
result PPT optimizes transformer behavior without backpropagation, achieving high utility across different utility functions.

We develop a generalisation of disentanglement in VAEs---decomposition of the latent representation---characterising it as the fulfilment of two factors: a) the latent encodings of the data having an appropriate level of overlap, and b) the aggregate encoding of the data conforming to a desired structure, represented t…

2018-12-06abs ↗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.

Proposes a VAE variant for ordinal content factors.

problem Isolating ordinal-valued content factors in deep latent variable models.
method Introduces a partially ordered set (poset) structure and a conditional Gaussian spacing prior model.
result Significant improvements in content-style separation over previous non-ordinal approaches.

Study finds physical priors don't significantly improve ML models for learning latent dynamics.

problem Learning latent dynamics from visual observations without access to the underlying state.
method Benchmarked 17 datasets with visual observations of physical systems using various physically inspired methods alongside baselines.
result Physical priors do not significantly improve standard techniques for learning latent dynamics.

The variational autoencoder (VAE) is a powerful generative model that can estimate the probability of a data point by using latent variables. In the VAE, the posterior of the latent variable given the data point is regularized by the prior of the latent variable using Kullback Leibler (KL) divergence. Although the stan…

2018-09-14abs ↗pdf ↗

LIMP learns latent shapes with metric preservation, improving generative models.

problem Insufficient training data for high-fidelity latent representations.
method Metric preservation as a prior, geometric distortion criterion, geodesic loss.
result Synthetic samples of higher quality achieved through metric preservation.

This paper tackles sampling issues in latent space EBMs by introducing diffusion-based amortization.

problem Degenerate MCMC sampling quality hinders latent space EBM learning and generation quality.
method Introduces diffusion-based amortization for long-run MCMC sampling.
result The learned amortization of MCMC is a valid long-run MCMC sampler.

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.

C-t3t^3VAE improves class representation in long-tailed generative models.

problem Latent geometric bias in VAEs under class imbalance.
method Per-class Student's t-distribution priors, closed-form objective, equal-weight latent mixture.
result Consistently lower FID scores and better class-balanced generation for severely imbalanced datasets.

Improves robustness of information bottleneck framework with sparsity-inducing prior.

problem Fixed-dimensional priors restrict flexibility and restrict robustness.
method Sparsity-inducing spike-slab categorical prior that learns dimension distribution per data point.
result Improves accuracy and robustness compared to traditional priors and other methods.

A new method learns latent space normalizing flow for approximate inference in generator models.

problem Approximate inference in generator models with complex posterior distributions.
method Jointly learns latent space normalizing flow and generator model using MCMC-based maximum likelihood.
result The short-run Langevin flow approximates the posterior and aligns with the normalizing flow prior.

Proposes a multi-view VAE for imputing missing data from correlated sources.

problem Imputing missing data from multi-view sources with latent space correlation.
method Enforces a joint prior with latent space correlation between VAEs trained on each view.
result More strongly correlated latent spaces are uncovered, enabling effective imputation.