Stochastic encoders outperform deterministic ones in 'perfect perceptual quality'.
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.
Trend · papers per month
Deep learning models have shown state-of-the-art performance in many inverse reconstruction problems. However, it is not well understood what properties of the latent representation may improve the generalization ability of the network. Furthermore, limited models have been presented for inverse reconstructions over ti…
The variational autoencoder (VAE) imposes a probabilistic distribution (typically Gaussian) on the latent space and penalizes the Kullback--Leibler (KL) divergence between the posterior and prior. In NLP, VAEs are extremely difficult to train due to the problem of KL collapsing to zero. One has to implement various heu…
Paper introduces a new method for Transformers with linear complexity.
SFM resolves small-scale physics challenges in weather data.
Stochastic encoding improves gender classification of brain networks from UK Biobank data.
Proposes flexible auto-encoders for varying data dimensions.
ST-MAML tackles task ambiguity in meta-learning by encoding tasks with stochastic representations.
Posterior inference in directed graphical models is commonly done using a probabilistic encoder (a.k.a inference model) conditioned on the input. Often this inference model is trained jointly with the probabilistic decoder (a.k.a generator model). If probabilistic encoder encounters complexities during training (e.g. s…
Improved graph embedding through refined linear transformation and community recovery.
Paper formalizes and analyzes a new bound for variational inference.
VCAE improves autoencoder quality on MNIST and CelebA.
Method learns model for unknown stochastic system from data.
Deterministic training improves generative autoencoder performance.
A new model encodes distances and topology in latent variables.
PriorCVAE uses deep generative models to infer hyperparameters in MCMC.
A novel VAE called πVAE models complex data with stochastic processes.
Enhances deep kernel learning with stochastic latent variables for better model regularization.
The paper proposes using Autoencoders to learn summary statistics for Bayesian inference.
Bayesian attention improves model performance and robustness.
This paper considers the problem of implementing large-scale gradient descent algorithms in a distributed computing setting in the presence of {\em straggling} processors. To mitigate the effect of the stragglers, it has been previously proposed to encode the data with an erasure-correcting code and decode at the maste…
Develops a flexible deep autoencoding topic model with scalable hybrid Bayesian inference.
We introduce the Mutual Information Machine (MIM), a probabilistic auto-encoder for learning joint distributions over observations and latent variables. MIM reflects three design principles: 1) low divergence, to encourage the encoder and decoder to learn consistent factorizations of the same underlying distribution; 2…
LSI enables joint learning of latent variables and generative models.
We present a theory of homogeneous volatility bridge estimators for log-price stochastic processes. The main tool of our theory is the parsimonious encoding of the information contained in the open, high and low prices of incomplete bridge, corresponding to given log-price stochastic process, and in its close value, fo…
Proposes a new model for directed graphs combining deep learning and latent variable models.
A novel capsule network model improves surrogate modeling and uncertainty quantification from sparse data.
We marry ideas from deep neural networks and approximate Bayesian inference to derive a generalised class of deep, directed generative models, endowed with a new algorithm for scalable inference and learning. Our algorithm introduces a recognition model to represent approximate posterior distributions, and that acts as…
In this note we present a generative model of natural images consisting of a deep hierarchy of layers of latent random variables, each of which follows a new type of distribution that we call rectified Gaussian. These rectified Gaussian units allow spike-and-slab type sparsity, while retaining the differentiability nec…
Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying a linear transformation based on a "one-hot" encoding of the discrete symbols. Despite its simplicity, such approach yields the number of parameters that grows linearly with the vocabulary s…
Stochastic approach improves neural network training for kinetic simulations.
New model improves traffic flow predictions with physics and machine learning.
Quantum methods model uncertain volatility in financial markets.
Geometric arbitrage theory reformulates a generic asset model possibly allowing for arbitrage by packaging all asset and their forward dynamics into a stochastic principal fibre bundle, with a connection whose parallel transport encodes discounting and portfolio rebalancing, and whose curvature measures, in this geomet…
We propose a second-order (Hessian or Hessian-free) based optimization method for variational inference inspired by Gaussian backpropagation, and argue that quasi-Newton optimization can be developed as well. This is accomplished by generalizing the gradient computation in stochastic backpropagation via a reparametriza…
Embedding methods such as word embedding have become pillars for many applications containing discrete structures. Conventional embedding methods directly associate each symbol with a continuous embedding vector, which is equivalent to applying linear transformation based on "one-hot" encoding of the discrete symbols. …
Bayesian approach for policy search in stochastic domains.
Acoustic Neighbor Embeddings map speech and text to fixed dimensions for phonetic confusability.
Stochastic gradient descent (SGD) is a key ingredient in the training of deep neural networks and yet its geometrical significance appears elusive. We study a deterministic model in which the trajectories of our dynamical systems are described via geodesics of a family of metrics arising from the diffusion matrix. Thes…
Human motion prediction is a stochastic process: Given an observed sequence of poses, multiple future motions are plausible. Existing approaches to modeling this stochasticity typically combine a random noise vector with information about the previous poses. This combination, however, is done in a deterministic manner,…
QSD enhances deep network performance through biologically plausible dropout.
Mutual information bounds generalization error in variational classifiers.
New method selects features for sequential decision making.
Quantum Portfolios of quantum algorithms encoded on qbits have recently been reported. In this paper a discussion of the continuous variables version of quantum portfolios is presented. A risk neutral valuation model for options dependent on the measured values of the observables, analogous to the traditional Black-Sch…
Integrates inductive biases into VAEs using intermediary latent variables.
The contractive auto-encoder learns a representation of the input data that captures the local manifold structure around each data point, through the leading singular vectors of the Jacobian of the transformation from input to representation. The corresponding singular values specify how much local variation is plausib…
To backpropagate the gradients through stochastic binary layers, we propose the augment-REINFORCE-merge (ARM) estimator that is unbiased, exhibits low variance, and has low computational complexity. Exploiting variable augmentation, REINFORCE, and reparameterization, the ARM estimator achieves adaptive variance reducti…
We study unsupervised generative modeling in terms of the optimal transport (OT) problem between true (but unknown) data distribution and the latent variable model distribution . We show that the OT problem can be equivalently written in terms of probabilistic encoders, which are constrained to match the pos…