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,694 papers · 148 categories

Trend · papers per month

1122 · Jul 201819922001200920172026
19 results for AAE

Any autoencoder network can be turned into a generative model by imposing an arbitrary prior distribution on its hidden code vector. Variational Autoencoder (VAE) [2] uses a KL divergence penalty to impose the prior, whereas Adversarial Autoencoder (AAE) [1] uses {\it generative adversarial networks} GAN [3]. GAN trade…

2018-07-19abs ↗pdf ↗

Constant-curvature Riemannian manifolds (CCMs) have been shown to be ideal embedding spaces in many application domains, as their non-Euclidean geometry can naturally account for some relevant properties of data, like hierarchy and circularity. In this work, we introduce the CCM adversarial autoencoder (CCM-AAE), a pro…

2018-12-11abs ↗pdf ↗

Most deep latent factor models choose simple priors for simplicity, tractability or not knowing what prior to use. Recent studies show that the choice of the prior may have a profound effect on the expressiveness of the model,especially when its generative network has limited capacity. In this paper, we propose to lear…

2019-09-10abs ↗pdf ↗

We study unsupervised generative modeling in terms of the optimal transport (OT) problem between true (but unknown) data distribution PXP_X and the latent variable model distribution PGP_G. We show that the OT problem can be equivalently written in terms of probabilistic encoders, which are constrained to match the pos…

2017-05-22abs ↗pdf ↗

This work evaluates deep generative models using RD curves, providing a more comprehensive quality assessment.

problem Quantitative evaluation of deep generative models is challenging, especially for implicit models.
method Proposes using rate distortion (RD) curves to evaluate and compare deep generative models, approximating the entire curve with similar computations to log-likelihood estimation.
result Approximating the entire RD curve provides a more comprehensive quality assessment than scalar-valued metrics.

Method evaluates disentanglement in DLVMs, including those not aligned with latent axes.

problem Evaluate disentanglement in DLVMs, especially those not aligned with latent axes.
method Proposes a statistical method to discover generative factors of a dataset.
result Empirically demonstrates the advantage of the method on two datasets.

Improves classifier performance in multi-stage processes with adversarial autoencoders and multi-task learning.

problem Challenges in training classifiers due to varying sample sizes and information content across stages.
method Combines adversarial autoencoders, multi-task learning, and semi-supervised learning to address underfitting and overfitting.
result Our approach outperforms state-of-the-art methods across different domains.

We propose the Wasserstein Auto-Encoder (WAE)---a new algorithm for building a generative model of the data distribution. WAE minimizes a penalized form of the Wasserstein distance between the model distribution and the target distribution, which leads to a different regularizer than the one used by the Variational Aut…

2017-11-05abs ↗pdf ↗

We prove a relation between the scaling hβh^β of the elastic energies of shrinking non-Euclidean bodies ShS_h of thickness h0h\to 0, and the curvature along their mid-surface SS. This extends and generalizes similar results for plates [BLS16, LRR] to any dimension and co-dimension. In particular, it proves that the na…

2018-01-07abs ↗pdf ↗

Study uses reinforcement learning to optimize portfolios under recursive utility.

problem Improving portfolio allocation using risk-sensitive objectives.
method Approximated certainty equivalent via Monte Carlo, trained actor-critic algorithms (PPO, A2C).
result Recursive-utility agent outperforms discounted baseline in Sharpe ratio, max drawdown, and cumulative return.

Proposes a new framework for open set recognition using conditional probabilistic generative models.

problem Unknown samples can mislead traditional deep neural networks during testing.
method Conditional Probabilistic Generative Models (CPGM) that combine generative models with discriminative information.
result Significantly outperforms baselines on multiple benchmark datasets.

Paper proposes a new method for predicting drug interactions using adversarial autoencoders.

problem Predicting drug interactions to prevent adverse events.
method Introduces adversarial autoencoders based on Wasserstein distances and Gumbel-Softmax relaxation to generate high-quality negative samples.
result Significant improvements in link prediction and DDI classification tasks.